The following pages link to (Q3720323):
Displaying 35 items.
- Match twice and stitch: a new TSP tour construction heuristic. (Q703270) (← links)
- A computational study of parametric tabu search for 0-1 mixed integer programs (Q709185) (← links)
- A decision-theoretic framework for comparing heuristics (Q798566) (← links)
- Reverse logistics: simultaneous design of delivery routes and returns strategies (Q850304) (← links)
- Solving a generalized traveling salesperson problem with stochastic customers (Q868135) (← links)
- Designing delivery districts for the vehicle routing problem with stochastic demands (Q872114) (← links)
- An improved assignment lower bound for the Euclidean traveling salesman problem (Q1058993) (← links)
- Experimentation in optimization (Q1084342) (← links)
- DB2 and DB2A: Two useful tools for constructing Hamiltonian circuits (Q1092923) (← links)
- Large traveling salesman problems arising from experiments in X-ray crystallography: A preliminary report on computation (Q1118536) (← links)
- The traveling salesman problem: An overview of exact and approximate algorithms (Q1194761) (← links)
- On the solving strategy in composite heuristics (Q1200786) (← links)
- Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation (Q1266547) (← links)
- Mechanisms for local search (Q1266572) (← links)
- New edges not used in shortest tours of TSP (Q1291639) (← links)
- Heuristics for the flow line problem with setup costs (Q1303708) (← links)
- Scheduling in a sequence dependent setup environment with genetic search (Q1342322) (← links)
- \(k\)-interchange heuristic as an optimization procedure for material handling applications (Q1401081) (← links)
- Best practices for comparing optimization algorithms (Q1642983) (← links)
- Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem (Q1730435) (← links)
- A distributed genetic algorithm for deterministic and stochastic labor scheduling problems (Q1806613) (← links)
- Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
- Computational efficiency and interactive MOLP algorithms: An implementation of the SIMOLP procedure (Q1825145) (← links)
- The traveling salesman problem with backhauls (Q1915968) (← links)
- Ejection chains, reference structures and alternating path methods for traveling salesman problems (Q1917273) (← links)
- Divide and conquer strategies for parallel TSP heuristics (Q1919776) (← links)
- A location-or-routing problem with partial and decaying coverage (Q2108134) (← links)
- Exact and heuristic dynamic programming algorithms for the traveling salesman problem with flexible time windows (Q2174903) (← links)
- Worst-case analysis of some convex hull heuristics for the Euclidean travelling salesman problem (Q2367039) (← links)
- A planning and scheduling model for onsertion in printed circuit board assembly (Q2371383) (← links)
- Genetic local search for multi-objective flowshop scheduling problems (Q2566706) (← links)
- The complexity of searching implicit graphs (Q2676567) (← links)
- (Q3993983) (← links)
- The complexity of searching succinctly represented graphs (Q4645179) (← links)
- Truly tight bounds for TSP heuristics (Q6047697) (← links)
