The following pages link to Concorde (Q16936):
Displaying 50 items.
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Genetic algorithm for combinatorial path planning: the subtour problem (Q541476) (← links)
- Computing compatible tours for the symmetric traveling salesman problem (Q542055) (← links)
- The neighbor-net algorithm (Q550258) (← links)
- The linear ordering problem. Exact and heuristic methods in combinatorial optimization. (Q612873) (← links)
- The balanced traveling salesman problem (Q614063) (← links)
- Traveling salesman problem with clustering (Q616229) (← links)
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs (Q621695) (← links)
- Genetic algorithm for asymmetric traveling salesman problem with imprecise travel times (Q631908) (← links)
- A comparison of lower bounds for the symmetric circulant traveling salesman problem (Q643021) (← links)
- Pattern discrete and mixed hit-and-run for global optimization (Q645554) (← links)
- Data transfer planning with tree placement for collaborative environments (Q647480) (← links)
- Approximating the metric TSP in linear time (Q649110) (← links)
- Seeking global edges for traveling salesman problem in multi-start search (Q652693) (← links)
- The random quadratic assignment problem (Q658428) (← links)
- A hybrid simulation-optimization algorithm for the Hamiltonian cycle problem (Q666352) (← links)
- The travelling salesman problem and adiabatic quantum computation: an algorithm (Q670009) (← links)
- Efficiently embedding QUBO problems on adiabatic quantum computers (Q670075) (← links)
- Continuous line drawings via the traveling salesman problem (Q703303) (← links)
- A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery (Q705506) (← links)
- A heuristic approach for the travelling purchaser problem (Q707139) (← links)
- A library of local search heuristics for the vehicle routing problem (Q708775) (← links)
- Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms (Q709151) (← links)
- The dynamic dispatch waves problem for same-day delivery (Q724132) (← links)
- A minimum spanning tree based heuristic for the travelling salesman tour (Q724377) (← links)
- Global versus local search: the impact of population sizes on evolutionary algorithm performance (Q727394) (← links)
- New semidefinite programming relaxations for the linear ordering and the traveling salesman problem (Q729796) (← links)
- Heuristics for the mixed swapping problem (Q733528) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (Q744218) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization (Q847846) (← links)
- On generalizations of the Petersen graph and the Coxeter graph (Q895061) (← links)
- A semidefinite optimization approach to the target visitation problem (Q895779) (← links)
- Multi-objective meta-heuristics for the traveling salesman problem with profits (Q928691) (← links)
- Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem (Q933505) (← links)
- George Dantzig's contributions to integer programming (Q951090) (← links)
- Integer linear programming models for topology optimization in sheet metal design (Q953299) (← links)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- Simpler analysis of LP extreme points for traveling salesman and survivable network design problems (Q974982) (← links)
- Estimation-based metaheuristics for the probabilistic traveling salesman problem (Q976010) (← links)
- Finding paths of length \(k\) in \(O^{*}(2^k)\) time (Q976105) (← links)
- Validating vehicle routing zone construction using Monte Carlo simulation (Q976400) (← links)
- On the domino-parity inequalities for the STSP (Q985309) (← links)
- A network flow model for biclustering via optimal re-ordering of data matrices (Q989888) (← links)
- Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
- Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
- Local cuts revisited (Q1003489) (← links)
- Design and analysis of stochastic local search for the multiobjective traveling salesman problem (Q1010272) (← links)
- General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic (Q1043852) (← links)
