Pages that link to "Item:Q1126862"
From MaRDI portal
The following pages link to On the solution of traveling salesman problems (Q1126862):
Displayed 27 items.
- A set partitioning reformulation of a school bus scheduling problem (Q657252) (← links)
- Small spectral gap in the combinatorial Laplacian implies Hamiltonian (Q659809) (← links)
- A survey of very large-scale neighborhood search techniques (Q697563) (← links)
- The dragon war (Q876681) (← links)
- On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
- An interactive simulation and analysis software for solving TSP using ant colony optimization algorithms (Q1008897) (← links)
- Transformations of generalized ATSP into ATSP. (Q1400345) (← links)
- Nagging: A scalable fault-tolerant paradigm for distributed search (Q1614863) (← links)
- Polynomial inequalities representing polyhedra (Q1777221) (← links)
- Information-based branching schemes for binary linear mixed integer problems (Q2267352) (← links)
- Theoretical analysis of singleton arc consistency and its extensions (Q2389615) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- Expanding neighborhood GRASP for the traveling salesman problem (Q2490365) (← links)
- Multilocus consensus genetic maps (MCGM): Formulation, algorithms, and results (Q2490509) (← links)
- Cuts for mixed 0-1 conic programming (Q2571004) (← links)
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems (Q2643947) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut (Q3430946) (← links)
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem (Q3643507) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)
- Dynamic programming method in the generalized traveling salesman problem: the influence of inexact calculations. (Q5936764) (← links)
- On 0-1 polytopes with many facets (Q5945246) (← links)
- Statistical mechanics methods and phase transitions in optimization problems (Q5958800) (← links)