Pages that link to "Item:Q3048580"

The following pages link to On the symmetric travelling salesman problem I: Inequalities (Q3048580):

Displaying 18 items.

• Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
• Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← links)
• A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
• Facet Generating Techniques (Q2971603) (← links)
• On the Chvátal-Gomory Closure of a Compact Convex Set (Q3009756) (← links)
• On the symmetric travelling salesman problem II: Lifting theorems and facets (Q3048581) (← links)
• The traveling salesman problem on a graph and some related integer polyhedra (Q3675933) (← links)
• A continuous linear optimization model for the exact solution of travelling-salesman-problems in connexion with expansion planning of ring networks (Q3743069) (← links)
• Polyhedral Combinatorics in Combinatorial Optimization (Q3763906) (← links)
• Some facets of the simple plant location polytope (Q3945954) (← links)
• A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program (Q4305487) (← links)
• On the Circuit Diameter of Some Combinatorial Polytopes (Q4644426) (← links)
• Separating maximally violated comb inequalities in planar graphs (Q4645943) (← links)
• Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
• Minimum‐weight subgraphs with unicyclic components and a lower‐bounded girth (Q5326798) (← links)
• Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
• A new integer programming formulation of the graphical traveling salesman problem (Q5925646) (← links)
• The solution of some 100-city travelling salesman problems (Q6169991) (← links)