Automating configuration of convolutional neural network hyperparameters using genetic algorithm
In recent years, Convolutional Neural Networks (CNN) have been widely used for real-world
applications in the field of computer vision. Their class-leading performance, however …
applications in the field of computer vision. Their class-leading performance, however …
Representations of quadratic combinatorial optimization problems: A case study using quadratic set covering and quadratic knapsack problems
AP Punnen, P Pandey, M Friesen - Computers & Operations Research, 2019 - Elsevier
The objective function of a quadratic combinatorial optimization problem (QCOP) can be
represented using two data items, a quadratic cost matrix Q and a linear cost vector c …
represented using two data items, a quadratic cost matrix Q and a linear cost vector c …
On the complexity of min–max–min robustness with two alternatives and budgeted uncertainty
A Chassein, M Goerigk - Discrete Applied Mathematics, 2021 - Elsevier
We study robust solutions for combinatorial optimization problems with budgeted uncertainty
sets in the min–max–min setting, where the decision maker is allowed to choose a set of k …
sets in the min–max–min setting, where the decision maker is allowed to choose a set of k …
Experimental analysis of algorithms for the independent quadratic assignment problem
The independent quadratic assignment problem is a variation of the well-known Koopmans–
Beckman quadratic assignment problem. The model has a wide variety of applications but it …
Beckman quadratic assignment problem. The model has a wide variety of applications but it …
A hybrid teaching-learning-based optimization algorithm for the travel route optimization problem alongside the urban railway line
F Liu, C Liu, Q Zhao, C He - Sustainability, 2021 - mdpi.com
Accurate travel route optimization is essential to promote and grow tourism in modern
society. This paper investigates a travel route optimization problem alongside the urban …
society. This paper investigates a travel route optimization problem alongside the urban …
Two-stage robust optimization problems with two-stage uncertainty
We consider two-stage robust optimization problems, which can be seen as games between
a decision maker and an adversary. After the decision maker fixes part of the solution, the …
a decision maker and an adversary. After the decision maker fixes part of the solution, the …
A characterization of linearizable instances of the quadratic traveling salesman problem
We consider the linearization problem associated with the quadratic traveling salesman
problem (QTSP). Necessary and sufficient conditions are given for a cost matrix $ Q $ of …
problem (QTSP). Necessary and sufficient conditions are given for a cost matrix $ Q $ of …
The linearization problem of a binary quadratic problem and its applications
We provide several applications of the linearization problem of a binary quadratic problem.
We propose a new lower bounding strategy, called the linearization-based scheme, that is …
We propose a new lower bounding strategy, called the linearization-based scheme, that is …
Matroid bases with cardinality constraints on the intersection
S Lendl, B Peis, V Timmermans - Mathematical Programming, 2022 - Springer
Abstract Given two matroids M _ 1=(E, B _ 1) M 1=(E, B 1) and M _ 2=(E, B _ 2) M 2=(E, B 2)
on a common ground set E with base sets B _1 B 1 and B _2 B 2, some integer k ∈ N k∈ N …
on a common ground set E with base sets B _1 B 1 and B _2 B 2, some integer k ∈ N k∈ N …
Hybrid Nearest-Neighbor Ant Colony Optimization Algorithm for Enhancing Load Balancing Task Management
F Mbarek, V Mosorov - Applied Sciences, 2021 - mdpi.com
Many computer problems that arise from real-world circumstances are NP-hard, while, in the
worst case, these problems are generally assumed to be intractable. Existing distributed …
worst case, these problems are generally assumed to be intractable. Existing distributed …