Pages that link to "Item:Q5322095"
From MaRDI portal
The following pages link to New Results on the Mixed General Routing Problem (Q5322095):
Displaying 14 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)
- The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
- City-courier routing and scheduling problems (Q2253369) (← links)
- Profitable mixed capacitated arc routing and related problems (Q2343077) (← links)
- An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← links)
- Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm (Q2414451) (← 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)
- 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)
- A two-phase hybrid algorithm for the periodic rural postman problem with irregular services on mixed graphs (Q6106965) (← links)
