Pages that link to "Item:Q1611004"
From MaRDI portal
The following pages link to Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation (Q1611004):
Displaying 15 items.
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Branch-and-cut algorithms for the undirected \(m\)-Peripatetic Salesman Problem (Q704117) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- On the domino-parity inequalities for the STSP (Q985309) (← links)
- Optimization of a peer-to-peer system for efficient content replication (Q1027520) (← 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)
- On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms (Q2241575) (← links)
- The undirected \(m\)-capacitated peripatetic salesman problem (Q2253380) (← links)
- A note on the separation of subtour elimination constraints in elementary shortest path problems (Q2355890) (← links)
- The 2-edge-connected subgraph polyhedron (Q2576774) (← links)
- Exact algorithms for a selective vehicle routing problem where the longest route is minimized (Q2840529) (← links)
- A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
- A branch‐and‐cut algorithm for the nonpreemptive swapping problem (Q5187945) (← links)
