Pages that link to "Item:Q2757646"
From MaRDI portal
The following pages link to Separating a superclass of comb inequalities in planar graphs (Q2757646):
Displaying 13 items.
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- On the domino-parity inequalities for the STSP (Q985309) (← links)
- Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
- Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation (Q1611004) (← links)
- Efficient separation routines for the symmetric traveling salesman problem. II: Separating multi handle inequalities. (Q1611005) (← links)
- A note on the polytope of bipartite TSP (Q1682883) (← links)
- On the separation of maximally violated mod-\(k\) cuts (Q1970294) (← links)
- Computing in combinatorial optimization (Q2075761) (← links)
- Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs (Q2282284) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- Good triangulations yield good tours (Q2384914) (← links)
- Separating maximally violated comb inequalities in planar graphs (Q2757587) (← links)
- Polynomial-Time Separation of a Superclass of Simple Comb Inequalities (Q5388004) (← links)