Pages that link to "Item:Q1374032"
From MaRDI portal
The following pages link to Modeling and solving several classes of arc routing problems as traveling salesman problems (Q1374032):
Displayed 17 items.
- Approaches for solving the container stacking problem with route distance minimization and stack rearrangement considerations (Q337182) (← links)
- An ILP-refined tabu search for the directed profitable rural postman problem (Q406489) (← links)
- A survey of models and algorithms for winter road maintenance. IV: Vehicle routing and fleet sizing for plowing and snow disposal (Q850322) (← links)
- Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
- Heuristics for a dynamic rural postman problem (Q883291) (← links)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
- The traveling salesman puts-on a hard hat -- tower crane scheduling in construction projects (Q2030576) (← links)
- An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← links)
- The aircraft maintenance base location problem (Q2356276) (← links)
- Solving an urban waste collection problem using ants heuristics (Q2475858) (← links)
- An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754) (← links)
- The time-dependent rural postman problem: polyhedral results (Q2867412) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Solving the time varying postman problems with timed automata (Q3458818) (← links)
- Efficient preprocessing methods for tabu search: an application on asymmetric travelling salesman problem (Q5881498) (← links)
- The Rural Postman Problem on mixed graphs with turn penalties (Q5959378) (← links)
- The parking warden tour problem (Q6092645) (← links)