Demonstration of adiabatic variational quantum computing with a superconducting quantum coprocessor
Adiabatic quantum computing enables the preparation of many-body ground states.
Realization poses major experimental challenges: Direct analog implementation requires …
Realization poses major experimental challenges: Direct analog implementation requires …
Heuristic algorithms for solving the generalized vehicle routing problem
The vehicle routing problem (VRP) is one of the most famous combinatorial optimization
problems and has been intensively studied due to the many practical applications in the field …
problems and has been intensively studied due to the many practical applications in the field …
[图书][B] Generalized network design problems: Modeling and optimization
PC Pop - 2012 - books.google.com
Combinatorial optimization is a fascinating topic. Combinatorial optimization problems arise
in a wide variety of important fields such as transportation, telecommunications, computer …
in a wide variety of important fields such as transportation, telecommunications, computer …
An efficient genetic algorithm for solving the generalized traveling salesman problem
The generalized traveling salesman problem (GTSP) is a generalization of the classical
traveling salesman problem. The GTSP is known to be an NP-hard problem and has many …
traveling salesman problem. The GTSP is known to be an NP-hard problem and has many …
Parameterized algorithms for generalized traveling salesman problems in road networks
MN Rice, VJ Tsotras - Proceedings of the 21st ACM SIGSPATIAL …, 2013 - dl.acm.org
The Generalized Traveling Salesman (Path) Problem involves finding a minimum-cost tour
(or path) through exactly one location from each of a set of generalized location categories …
(or path) through exactly one location from each of a set of generalized location categories …
A new efficient transformation of the generalized vehicle routing problem into the classical vehicle routing problem
P Pop, C Pop-Sitar - Yugoslav Journal of Operations Research, 2011 - doiserbia.nb.rs
Classical combinatorial optimization problems can be generalized in a natural way by
considering a related problem relative to a given partition of the nodes of the graph into …
considering a related problem relative to a given partition of the nodes of the graph into …
A decomposition-based method for solving the clustered vehicle routing problem
A Horvat-Marc, L Fuksz, PC Pop… - Logic Journal of the …, 2018 - academic.oup.com
In this article, we address a variant of the vehicle routing problem which occurs in real-life
applications, called the clustered vehicle routing problem. The clustered vehicle routing …
applications, called the clustered vehicle routing problem. The clustered vehicle routing …
An efficient ant colony system for solving the new generalized traveling salesman problem
L Mou - 2011 IEEE international conference on cloud …, 2011 - ieeexplore.ieee.org
The Generalized Traveling Salesman Problem (GTSP) is an extension of the classical
traveling salesman problem and has many interesting applications. In this paper we present …
traveling salesman problem and has many interesting applications. In this paper we present …
A novel ant colony system with double pheromones for the generalized TSP
LM Mou - 2011 Seventh International Conference on Natural …, 2011 - ieeexplore.ieee.org
The Generalized Traveling Salesman Problem (GTSP) is an extension of the classical
traveling salesman problem and has many interesting applications. The GTSP is known to …
traveling salesman problem and has many interesting applications. The GTSP is known to …
A memetic algorithm for solving the generalized minimum spanning tree problem
The generalized minimum spanning tree problem is a natural extension of the classical
minimum spanning tree problem, looking for a tree with minimum cost, spanning exactly one …
minimum spanning tree problem, looking for a tree with minimum cost, spanning exactly one …