The firefly algorithm (FA), as a metaheuristic search method, is useful for solving diverse
optimization problems. However, it is challenging to use FA in tackling high dimensional …

As a special type of multi-objective combinatorial optimization problems (MOCOPs), the
multi-objective traveling salesman problem (MOTSP) plays an important role in practical …

We study the quadratic cycle cover problem (QCCP), which aims to find a node-disjoint cycle
cover in a directed graph with minimum interaction cost between successive arcs. We derive …

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 …

Coverage path planning is a fundamental challenge in robotics, with diverse applications in
aerial surveillance, manufacturing, cleaning, inspection, agriculture, and more. The main …

The travelling salesman problem (TSP) asks for a shortest tour through all vertices of a
graph with respect to the weights of the edges. The symmetric quadratic travelling salesman …

The angular-metric travelling salesman problem (AngleTSP) asks for a Hamiltonian cycle for
given points in the Euclidean plane mimimizing the sum of all turning angles. Setting as …

The use of a reversion technique during the search process of s-metaheuristics has received
little attention with respect to forest management and planning problems. Reversion involves …

In this paper we study the well-known Chvátal–Gomory (CG) procedure for the class of
integer semidefinite programs (ISDPs). We prove several results regarding the hierarchy of …

The quadratic traveling salesman problem asks for a tour of minimal total costs where the
costs are associated with each of two arcs that are traversed in succession. This structure …