Pages that link to "Item:Q1296789"
From MaRDI portal
The following pages link to The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra (Q1296789):
Displaying 15 items.
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
- Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
- Heuristics for a dynamic rural postman problem (Q883291) (← links)
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- Solving the prize-collecting rural postman problem (Q1041930) (← links)
- New inequalities for the general routing problem (Q1278493) (← links)
- The rural postman problem with deadline classes (Q1291753) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
- Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem (Q2162526) (← links)
- Multi-depot rural postman problems (Q2408522) (← links)
- On the general routing polytope (Q2473035) (← links)
- Computing finest mincut partitions of a graph and application to routing problems (Q2473036) (← links)
- Modeling and Solving the Intersection Inspection Rural Postman Problem (Q5085490) (← links)
