Pages that link to "Item:Q1384095"
From MaRDI portal
The following pages link to The capacitated arc routing problem: Valid inequalities and facets (Q1384095):
Displaying 38 items.
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- The mixed capacitated arc routing problem with non-overlapping routes (Q319378) (← links)
- A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
- On the collaboration uncapacitated arc routing problem (Q342264) (← links)
- Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
- New upper bounds for the multi-depot capacitated arc routing problem (Q537994) (← links)
- A parallel insert method for the capacitated arc routing problem (Q794931) (← links)
- A variable neighborhood search for the capacitated arc routing problem with intermediate facilities (Q953311) (← links)
- Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413) (← links)
- Lower bounds for the mixed capacitated arc routing problem (Q1040970) (← links)
- Solving the prize-collecting rural postman problem (Q1041930) (← links)
- The general routing problem polyhedron: Facets from the RPP and GTSP polyhedra (Q1296789) (← links)
- A polyhedral approach to the rural postman problem (Q1342042) (← links)
- Multistars, partial multistars and the capacitated vehicle routing problem (Q1396812) (← links)
- Optimally solving the joint order batching and picker routing problem (Q1683118) (← links)
- The generalized arc routing problem (Q1688441) (← links)
- The periodic rural postman problem with irregular services on mixed graphs (Q1734335) (← links)
- An optimization-based heuristic for the multi-objective undirected capacitated arc routing problem (Q1761166) (← links)
- A cutting plane algorithm for the capacitated arc routing problem (Q1870825) (← links)
- A guided local search heuristic for the capacitated arc routing problem (Q1873009) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
- The Steiner traveling salesman problem and its extensions (Q1999396) (← links)
- A generic exact solver for vehicle routing and related problems (Q2196312) (← links)
- Multi-depot rural postman problems (Q2408522) (← links)
- Solving an urban waste collection problem using ants heuristics (Q2475858) (← links)
- A survey of models and algorithms for winter road maintenance. I: System design for spreading and plowing (Q2565778) (← links)
- A scatter search for the periodic capacitated arc routing problem (Q2570158) (← links)
- Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
- The capacitated arc routing problem with refill points (Q2643817) (← links)
- The capacitated arc routing problem with intermediate facilities (Q2719845) (← links)
- Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem (Q2806992) (← links)
- Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- A Decade of Capacitated Arc Routing (Q3564348) (← links)
- New lower bounds for the Capacitated Arc Routing Problem (Q3802908) (← links)
- Effects of update frequencies in a dynamic capacitated arc routing problem (Q6092644) (← links)
- A Survey of the Generalized Assignment Problem and Its Applications (Q6102818) (← links)