Pages that link to "Item:Q1396827"
From MaRDI portal
The following pages link to The mixed general routing polyhedron (Q1396827):
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 for the mixed capacitated arc routing problem (Q1040970) (← links)
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
- On the distance-constrained close enough arc routing problem (Q2029943) (← links)
- Polyhedral analysis and a new algorithm for the length constrained \(K\)-drones rural postman problem (Q2162526) (← links)
- An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← links)
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems (Q2494509) (← links)
- Lower and upper bounds for the mixed capacitated arc routing problem (Q2496039) (← links)
- A comparison of two different formulations for arc routing problems on mixed graphs (Q2496040) (← links)
- The mixed capacitated general routing problem under uncertainty (Q2629641) (← links)
- The time-dependent rural postman problem: polyhedral results (Q2867412) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- On path-bridge inequalities for the orienteering arc routing problems (Q5151530) (← links)
