The following pages link to Concorde (Q16936):
Displaying 50 items.
- Genetic operators for combinatorial optimization in TSP and microarray gene ordering (Q2383954) (← links)
- Method of scaling in approximate solution of the traveling salesman problem (Q2392635) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- Fast separation for the three-index assignment problem (Q2398106) (← links)
- An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem (Q2408163) (← links)
- On learning and branching: a survey (Q2408515) (← links)
- Hölder curves and parameterizations in the Analyst's traveling salesman theorem (Q2419274) (← links)
- The symmetric quadratic traveling salesman problem (Q2434982) (← links)
- The covering Canadian traveller problem (Q2440168) (← links)
- Priority functions for the approximation of the metric TSP (Q2444775) (← links)
- A note on the extension complexity of the knapsack polytope (Q2450664) (← links)
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem (Q2452379) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- TTT plots: a perl program to create time-to-target plots (Q2468777) (← links)
- Solution of real-world postman problems (Q2482818) (← links)
- Implementation analysis of efficient heuristic algorithms for the traveling salesman problem (Q2571201) (← links)
- The 2-edge-connected subgraph polyhedron (Q2576774) (← links)
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem (Q2630253) (← links)
- Splitting a giant tour using integer linear programming (Q2631278) (← links)
- Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics (Q2636833) (← links)
- Separation, dimension, and facet algorithms for node flow polyhedra (Q2638390) (← links)
- Heuristic methods to consecutive block minimization (Q2664289) (← links)
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem (Q2668597) (← links)
- Iterated local search for consecutive block minimization (Q2668701) (← links)
- A computational software system to design order picking warehouses (Q2668754) (← links)
- A partitioning column approach for solving LED sorter manipulator path planning problems (Q2673413) (← links)
- Patch ordering as a regularization for inverse problems in image processing (Q2797782) (← links)
- Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure (Q2802246) (← links)
- A Polyhedral Study of the Quadratic Traveling Salesman Problem (Q2806910) (← links)
- Nonoblivious 2-opt heuristics for the traveling salesman problem (Q2811309) (← links)
- The balanced minimum evolution problem (Q2815445) (← links)
- Robust software partitioning with multiple instantiation (Q2815463) (← links)
- Dividing a territory among several vehicles (Q2815468) (← links)
- The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme (Q2817793) (← links)
- A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks (Q2835682) (← links)
- Generalized traveling salesman problem reduction algorithms (Q2867371) (← links)
- Periodic sequences of arbitrage: a tale of four currencies (Q2895984) (← links)
- Robotic data mules for collecting data over sparse sensor fields (Q2899413) (← links)
- Computational experience with a software framework for parallel integer programming (Q2901073) (← links)
- A new approach to solve the classical symmetric traveling salesman problem by zero suffix method (Q2908906) (← links)
- A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
- Heuristics for the traveling repairman problem with profits (Q2917285) (← links)
- An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem (Q2940530) (← links)
- An Introduction to Geometric Semantic Genetic Programming (Q2958226) (← links)
- Complexity of combinatorial optimization problems in terms of face lattices of associated polytopes (Q2959185) (← links)
- A Branch-and-Bound Algorithm for the Close-Enough Traveling Salesman Problem (Q2960368) (← links)
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems (Q2967617) (← links)
- Selfish Transportation Games (Q2971133) (← links)
- An Exact Rational Mixed-Integer Programming Solver (Q3009754) (← links)
- Matching preclusion for the (<i>n, k</i>)-bubble-sort graphs (Q3056376) (← links)
