Pages that link to "Item:Q3629465"
From MaRDI portal
The following pages link to The Windy General Routing Polyhedron: A Global View of Many Known Arc Routing Polyhedra (Q3629465):
Displaying 20 items.
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
- Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
- A metaheuristic for the min-max windy rural postman problem with K vehicles (Q993701) (← links)
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
- The general routing polyhedron: A unifying framework (Q1806888) (← links)
- Integer programming formulation and polyhedral results for windy collaborative arc routing problem (Q2146988) (← links)
- Search games on a network with travelling and search costs (Q2349413) (← links)
- New results on the windy postman problem (Q2429464) (← links)
- Solution of real-world postman problems (Q2482818) (← links)
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems (Q2494509) (← links)
- A branch-price-and-cut algorithm for the min-max \(k\)-vehicle windy rural postman problem (Q2811322) (← links)
- Min-Max <i>K</i> -vehicles windy rural postman problem (Q3057121) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- New facets and an enhanced branch-and-cut for the min-max <i>K</i> -vehicles windy rural postman problem (Q3113511) (← links)
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
- On path-bridge inequalities for the orienteering arc routing problems (Q5151530) (← links)
- A branch & cut algorithm for the windy general routing problem and special cases (Q5295483) (← links)
- Search games on networks with travelling and search costs and with arbitrary searcher starting points (Q5326807) (← links)
- A branch-and-cut algorithm for the windy profitable location rural postman problem (Q6644370) (← links)
