Pages that link to "Item:Q4887738"
From MaRDI portal
The following pages link to An optimal algorithm for the mixed Chinese postman problem (Q4887738):
Displayed 14 items.
- Approximation algorithms for solving the constrained arc routing problem in mixed graphs (Q297063) (← links)
- Two-phase branch-and-cut for the mixed capacitated general routing problem (Q319006) (← links)
- Uncertain multi-objective Chinese postman problem (Q780142) (← links)
- Lower bounds for the mixed capacitated arc routing problem (Q1040970) (← links)
- Modeling and solving several classes of arc routing problems as traveling salesman problems (Q1374032) (← links)
- A GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← 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)
- Approximation algorithms for multi-vehicle stacker crane problems (Q2687683) (← links)
- The time-dependent rural postman problem: polyhedral results (Q2867412) (← links)
- Arc routing problems: A review of the past, present, and future (Q6087068) (← links)