The following pages link to Concorde (Q16936):
Displaying 50 items.
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103) (← links)
- On Interior-Point Warmstarts for Linear and Combinatorial Optimization (Q3058509) (← links)
- An Effective Algorithm for and Phase Transitions of the Directed Hamiltonian Cycle Problem (Q3067705) (← links)
- Parallel multithreaded IDA* heuristic search: algorithm design and performance evaluation (Q3072379) (← links)
- (Q3086030) (← links)
- Improved exact method for the double TSP with multiple stacks (Q3113513) (← links)
- Model Checking the Ant Colony Optimisation (Q3163947) (← links)
- Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem (Q3169103) (← links)
- The periodic Vehicle routing problem: classification and heuristic (Q3411299) (← links)
- Benders Decomposition for Production Routing Under Demand Uncertainty (Q3465587) (← links)
- What you should know about the vehicle routing problem (Q3499286) (← links)
- (Q3515784) (← links)
- The Travelling Salesman Problem in Bounded Degree Graphs (Q3521919) (← links)
- How To Be Fickle (Q3525550) (← links)
- Modeling and Solving the Capacitated Vehicle Routing Problem on Trees (Q3564359) (← links)
- A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem (Q3569745) (← links)
- Improving the Held and Karp Approach with Constraint Programming (Q3569917) (← links)
- Finding Good Tours for Huge Euclidean TSP Instances by Iterative Backbone Contraction (Q3578366) (← links)
- A concise guide to the Traveling Salesman Problem (Q3582631) (← links)
- Simple-closed-curve sculptures of knots and links (Q3590066) (← links)
- Using River Formation Dynamics to Design Heuristic Algorithms (Q3603413) (← links)
- Traveling Salesman Problem and Membership in Pedigree Polytope - A Numerical Illustration (Q3627687) (← links)
- PARALLEL TEMPERING FOR THE TRAVELING SALESMAN PROBLEM (Q3636400) (← links)
- A generalized model and a heuristic algorithm for the large-scale covering tour problem (Q4553890) (← links)
- Winding indexes of Max. and Min. Hamiltonians in N-Gons (Q4595250) (← links)
- A construction for directed in-out subgraphs of optimal size (Q4622626) (← links)
- A general system for heuristic minimization of convex functions over non-convex sets (Q4638917) (← links)
- On the Metric $s$--$t$ Path Traveling Salesman Problem (Q4641715) (← links)
- (Q4735940) (← links)
- (Q4735941) (← links)
- EVERY LONGEST HAMILTONIAN PATH IN EVEN n-GONS (Q4903643) (← links)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
- The travelling salesman problem with neighbourhoods: MINLP solution (Q4924121) (← links)
- Randomized heuristics for the family traveling salesperson problem (Q4979987) (← links)
- (Q4999440) (← links)
- Constructing arbitrarily large graphs with a specified number of Hamiltonian cycles (Q5006572) (← links)
- Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples (Q5009933) (← links)
- A New Approach for Vehicle Routing with Stochastic Demand: Combining Route Assignment with Process Flexibility (Q5058032) (← links)
- Combinatorial Heuristics for Inventory Routing Problems (Q5084657) (← links)
- Dynamical Systems Theory and Algorithms for NP-hard Problems (Q5131680) (← links)
- Mobile Sensor Networks (Q5178095) (← links)
- Client-side Computational Optimization (Q5237432) (← links)
- New Bounds for the Traveling Salesman Constant (Q5246169) (← links)
- Minimization and maximization versions of the quadratic travelling salesman problem (Q5277951) (← links)
- Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems (Q5326795) (← links)
- Reordering Strategy for Blocking Optimization in Sparse Linear Solvers (Q5346752) (← links)
- Semi-supervised learning using autodidactic interpolation on sparse representation-based multiple one-dimensional embedding (Q5379794) (← links)
- Constraint Integer Programming: A New Approach to Integrate CP and MIP (Q5387617) (← links)
- (Q5392121) (← links)
- Strong Formulations for 2-Node-Connected Steiner Network Problems (Q5505657) (← links)
