Pages that link to "Item:Q1806888"
From MaRDI portal
The following pages link to The general routing polyhedron: A unifying framework (Q1806888):
Displaying 13 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)
- The generalized packet routing problem (Q580964) (← links)
- Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra (Q1296789) (← links)
- The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
- Routing in polygonal domains (Q2173455) (← links)
- The common face of some 0/1-polytopes with NP-complete nonadjacency relation (Q2259297) (← links)
- On the general routing polytope (Q2473035) (← links)
- Computing finest mincut partitions of a graph and application to routing problems (Q2473036) (← links)
- Generalized network design polyhedra (Q3100692) (← links)
- Exact solution of the generalized routing problem through graph transformations (Q4661094) (← links)
- (Q5290824) (← links)