Results 121 to 130 of about 11,422 (178)

Reachability cuts for the vehicle routing problem with time windows [PDF]

This paper introduces a class of cuts, called reachability cuts, for the Vehicle Routing Problem with Time Windows (VRPTW). Reachability cuts are closely related to cuts derived from precedence constraints in the Asymmetric Traveling Salesman Problem ...
Lysgaard, Jens
core  

Throughput Rate Optimization in High Multiplicity Sequencing Problems

Mixed model assembly systems assemble products (parts) of differenttypes in certain prespecified quantities. A minimal part set is a smallestpossible set of product type quantities, to be called the multiplicities,in which the numbers of assembled ...
Grigoriev,Alexander, Klundert,Joris ,van de   +1 more
core  

Traveling Salesman Problem

, 2016
The traveling salesman problem asks for the shortest route by which a salesman can visit a set of locations and return home. Drag the points to change the locations the salesman visits to see how the route changesComponente Curricular::Educação Superior::
McLoone, Jon
core   +1 more source

Traveling salesman games with the Monge property

, 2001
Several works indicate the relationship between well-solved combinatorial optimization problems and the core non-emptiness of cooperative games associated with them.
Yoshio Okamoto
core  

Traveling Salesman Problem

, 2011
The traveling salesman problem asks for the shortest route by which a salesman can visit a set of locations and return home. Drag the points to change the locations the salesman visits to see how the route changesComponente Curricular::Educação Superior::
McLoone, Jon
core  

On Semidefinite Programming Relaxations of Association Schemes With Application to Combinatorial Optimization Problems

AMS classification: 90C22, 20Cxx, 70-08traveling salesman problem;maximum bisection;semidefinite programming;association ...
Klerk, E. de, Pasechnik, D.V.
core  

On the high multiplicity traveling salesman problem.

Grigoriev, Alexander, Klundert, Joris van de   +1 more
core   +2 more sources

Traveling Salesman

, 1966
openaire   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Traveling Salesman Problems with Profits

Transportation Science, 2005
Traveling salesman problems with profits (TSPs with profits) are a generalization of the traveling salesman problem (TSP), where it is not necessary to visit all vertices. A profit is associated with each vertex. The overall goal is the simultaneous optimization of the collected profit and the travel costs.
Dominique Feillet, Pierre Dejax, Michel Gendreau   +2 more
exaly   +2 more sources

The travelling salesman and the PQ-tree

Mathematics of Operations Research, 1996
Let D = (dij ) be the n × n distance matrix of a set of n cities {1, 2, …, n}, and let T be a PQ-tree with node degree bounded by d that represents a set Π(T) of permutations over {1, 2, …, n}. We show how to compute for D in O(2 dn 3) time the shortest travelling salesman tour contained in Π(T).
Burkard, R.E., Deineko, V.G., Woeginger, G.J.   +2 more
openaire   +4 more sources