Keyword: programming: travelling salesman

Found 410 papers in total
The Fixed-Outdegree 1-Arborescence polytope
The Fixed-Outdegree 1-Arborescence polytope
1992,
A 1-arborescence is a spanning arborescence rooted at node 1, plus one arc incident...
On the solving strategy in composite heuristics
On the solving strategy in composite heuristics
1992,
The relationship between the qualities of the initial solution and the final solution...
On the resources allocation problem
On the resources allocation problem
1992,
This paper investigates a method for allocating production resources to manufacturing...
On the economic lot scheduling problem with backlogging: The common cycle approach
On the economic lot scheduling problem with backlogging: The common cycle approach
1992,
This paper presents an analysis of the single machine economic lot scheduling problem...
Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms
Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms
1992,
The time dependent vehicle routing problem (TDVRP) is defined as follows. A vehicle...
RS-vector algorithms for combinatorial problems
RS-vector algorithms for combinatorial problems
1992,
The RS-vector machine is a vector machine based on the vector operations called repeat...
Scheduling examinations to reduce second-order conflicts
Scheduling examinations to reduce second-order conflicts
1992,
The authors consider the problem of assigning groups of exams to time-slots such that...
The guilty net for the travelling salesman problem
The guilty net for the travelling salesman problem
1992,
A new, adaptive neural structure is proposed for solving the traveling salesman...
Operational estimators for the length of a traveling salesman tour
Operational estimators for the length of a traveling salesman tour
1992,
The paper defines several estimators that can be used to obtain approximations for the...
Application of the TSP algorithm in structural system reliability calculations
Application of the TSP algorithm in structural system reliability calculations
1991,
The reliability of multi-element, fatigue-prone systems subjected to cyclic,...
Solvable cases of the no-wait flow-shop scheduling problem
Solvable cases of the no-wait flow-shop scheduling problem
1991,
The no-wait flow-shop scheduling program (NWFSSP) with a makespan objective function...
The precedence constrained traveling salesman problem
The precedence constrained traveling salesman problem
1991,
The authors consider a generalization of the classical traveling salesman problem...
A modification of the dynamic programming method for the travelling-salesman problem
A modification of the dynamic programming method for the travelling-salesman problem
1989,
A time-optimal control problem is considered for a simple trajectory visiting a given...
Exact and heuristic algorithms of dynamic programming for combinatorial optimization problem
Exact and heuristic algorithms of dynamic programming for combinatorial optimization problem
1991,
The main difficulty arising in using dynamic programming to solve combinatorial...
Travelling salesman problem tools for microcomputers
Travelling salesman problem tools for microcomputers
1991,
The problem of determining minimum total distance to be travelled by a salesman, who...
Efficiently solvable special case of bottleneck travelling salesman problems
Efficiently solvable special case of bottleneck travelling salesman problems
1991,
The paper investigates bottleneck travelling salesman problems (BTSP) which can be...
Probabilistic routing problems in the plane
Probabilistic routing problems in the plane
1991,
Probabilistic routing problems are generalized versions of deterministic routing...
Convergent duality for the traveling salesman problem
Convergent duality for the traveling salesman problem
1991,
A constructive method is presented for optimizing exactly the traveling salesman...
Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
1991,
Given the minimum Hamiltonian path (or traveling salesman tour) H 0 in an undirected...
Probabilistic analysis of the Held and Karp lower bound for the Euclidean traveling salesman problem
Probabilistic analysis of the Held and Karp lower bound for the Euclidean traveling salesman problem
1991,
The authors analyze probabilistically the classical Held-Karp lower bound derived from...
A branch-and-cut approach to a traveling salesman problem with side constraints
A branch-and-cut approach to a traveling salesman problem with side constraints
1989,
A problem posed by O.L. Deutsch as the Artificial Intelligence Design Challenge for...
On patching algorithms for random asymmetric travelling salesman problems
On patching algorithms for random asymmetric travelling salesman problems
1990,
Let the arc-lengths L ij of a complete digraph on n vertices be independent uniform...
Facet identification for the symmetric traveling salesman polytope
Facet identification for the symmetric traveling salesman polytope
1990,
Several procedures for the identification of facet inducing inequalities for the...
Classification of travelling salesman problem formulations
Classification of travelling salesman problem formulations
1990,
Several single-commodity, two-commodity and multi-commodity flow formulations have...
Papers per page: