The following pages link to (Q5187226):
Displayed 50 items.
- An efficient procedure for the N-city traveling salesman problem (Q583107) (← links)
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (Q705506) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- An improved annealing scheme for the QAP (Q752002) (← links)
- A threshold accepting heuristic with intense local search for the solution of special instances of the traveling salesman problem (Q857330) (← links)
- A (0-1) goal programming model for scheduling the tour of a marketing executive (Q858472) (← links)
- A new asymmetric pyramidally solvable class of the traveling salesman problem (Q867920) (← links)
- Bound sets for biobjective combinatorial optimization problems (Q875413) (← links)
- The dragon war (Q876681) (← links)
- Sequencing and scheduling in robotic cells: recent developments (Q880509) (← links)
- Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem (Q885705) (← links)
- Analyzing the Held-Karp TSP bound: A monotonicity property with application (Q912624) (← links)
- The \((n^ 2-1)\)-puzzle and related relocation problems (Q917310) (← links)
- An efficient implementation of local search algorithms for constrained routing problems (Q918421) (← links)
- Synchronized routing of seasonal products through a production/distribution network (Q926350) (← links)
- The on-line asymmetric traveling salesman problem (Q935844) (← links)
- Golden ratio versus pi as random sequence sources for Monte Carlo integration (Q949528) (← links)
- Using immune-based genetic algorithms for single trader's periodic marketing problem (Q949553) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem (Q954046) (← links)
- Model-based view planning (Q1008495) (← links)
- An introduction to parallelism in combinatorial optimization (Q1076605) (← links)
- On common edges in optimal solutions to traveling salesman and other optimization problems (Q1105496) (← links)
- Continuous reductions among combinatorial optimization problems (Q1112622) (← links)
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation (Q1118536) (← links)
- A stochastic and dynamic model for the single-vehicle pick-up and delivery problem (Q1124700) (← links)
- Submodularity and the traveling salesman problem (Q1124707) (← links)
- A note on exploiting the Hamiltonian cycle problem substructure of the asymmetric traveling salesman problem (Q1178723) (← links)
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities (Q1181903) (← links)
- An additive bounding procedure for the asymmetric travelling salesman problem (Q1184344) (← links)
- Traveling salesman games (Q1184345) (← links)
- A note on the effect of neighborhood structure in simulated annealing (Q1184445) (← links)
- How to find Steiner minimal trees in Euclidean \(d\)-space (Q1186793) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- A parallel branch and bound algorithm for solving large asymmetric traveling salesman problems (Q1194853) (← links)
- The stochastic vehicle routing problem revisited (Q1197946) (← links)
- Quick updates for \(p\)-opt TSP heuristics (Q1198624) (← links)
- Traveling salesman problem under categorization (Q1200771) (← links)
- On the solving strategy in composite heuristics (Q1200786) (← links)
- On the complexity of generating synchronizable test sequences (Q1203646) (← links)
- The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem (Q1261382) (← links)
- Algebraic languages for mathematical programming (Q1261394) (← links)
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514) (← links)
- A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
- Vehicle routing problem with trailers (Q1268206) (← links)
- The use of dynamic programming in genetic algorithms for permutation problems (Q1268271) (← links)
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions (Q1270780) (← links)
- A stochastic and dynamic routing policy using branching processes with state dependent immigration (Q1278373) (← links)