Pages that link to "Item:Q1198736"
From MaRDI portal
The following pages link to A cutting plane algorithm for the windy postman problem (Q1198736):
Displaying 18 items.
- On the windy postman problem (Q800837) (← links)
- Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- A cutting plane algorithm for the windy postman problem (Q1198736) (← links)
- A GRASP heuristic for the mixed Chinese postman problem (Q1847247) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- OAR lib: an open source arc routing library (Q2293658) (← links)
- An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← links)
- New heuristic algorithms for the windy rural postman problem (Q2387296) (← links)
- New results on the windy postman problem (Q2429464) (← links)
- Series-parallel graphs are windy postman perfect (Q2476276) (← links)
- Zigzag inequalities: a new class of facet-inducing inequalities for arc routing problems (Q2494509) (← links)
- A comparison of two different formulations for arc routing problems on mixed graphs (Q2496040) (← links)
- The time-dependent rural postman problem: polyhedral results (Q2867412) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Constructing of OE-Postman Path for a Planar Graph (Q3451892) (← links)
- A branch-and-price algorithm for the windy rural postman problem (Q5388154) (← links)
- Plowing with precedence in polynomial time (Q6092637) (← links)