Pages that link to "Item:Q3875699"
From MaRDI portal
The following pages link to On the symmetric travelling salesman problem: Solution of a 120-city problem (Q3875699):
Displayed 23 items.
- A branch and bound algorithm for the capacitated vehicle routing problem (Q585095) (← links)
- Distance conserving reductions for nonoriented networks (Q594774) (← links)
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- Recent trends in combinatorial optimization (Q788638) (← links)
- Optimizing over the subtour polytope of the travelling salesman problem (Q803048) (← links)
- A cutting plane procedure for the travelling salesman problem on road networks (Q1072449) (← links)
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut (Q1089267) (← links)
- A new class of cutting planes for the symmetric travelling salesman problem (Q1107441) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees (Q1170119) (← links)
- The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities (Q1181903) (← links)
- Travelling salesman problem tools for microcomputers (Q1184464) (← links)
- A cutting-plane approach to the edge-weighted maximal clique problem (Q1309944) (← links)
- A polyhedral approach to the rural postman problem (Q1342042) (← links)
- Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies (Q1919186) (← links)
- The trouble with the second quantifier (Q2044549) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- Point-to-point and multi-goal path planning for industrial robots (Q2745507) (← links)
- Separating maximally violated comb inequalities in planar graphs (Q4645943) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- Branch and cut methods for network optimization (Q5936762) (← links)