Pages that link to "Item:Q1820685"
From MaRDI portal
The following pages link to Transforming arc routing into node routing problems (Q1820685):
Displaying 32 items.
- Improved bounds for large scale capacitated arc routing problem (Q336459) (← links)
- Location-arc routing problem: heuristic approaches and test instances (Q336937) (← links)
- Modeling and solving the mixed capacitated general routing problem (Q375984) (← links)
- Arc routing problems with time-dependent service costs (Q872235) (← links)
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows (Q975995) (← links)
- Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413) (← links)
- Lower bounds for the mixed capacitated arc routing problem (Q1040970) (← links)
- A branch-and-bound algorithm for the time-dependent rural postman problem (Q1628130) (← links)
- A hybrid heuristic procedure for the windy rural postman problem with zigzag time windows (Q1651548) (← links)
- Solving large-scale time capacitated arc routing problems: from real-time heuristics to metaheuristics (Q1730649) (← links)
- Evolutionary algorithms for periodic arc routing problems (Q1772855) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Workload equity in vehicle routing: the impact of alternative workload resources (Q2002854) (← links)
- Augment-insert algorithms for the capacitated arc routing problem (Q2276892) (← links)
- Exact approaches for the cutting path determination problem (Q2329729) (← links)
- A compact transformation of arc routing problems into node routing problems (Q2341211) (← links)
- An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← links)
- A constraint programming approach to the Chinese postman problem with time windows (Q2496043) (← links)
- New lower bound for the capacitated arc routing problem (Q2496046) (← links)
- Arc routing in a node routing environment (Q2571193) (← links)
- Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
- Arc routing under uncertainty: introduction and literature review (Q2669541) (← links)
- The time-dependent rural postman problem: polyhedral results (Q2867412) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Exact methods based on node-routing formulations for undirected arc-routing problems (Q3376660) (← links)
- Solving the time varying postman problems with timed automata (Q3458818) (← links)
- A Decade of Capacitated Arc Routing (Q3564348) (← links)
- New lower bounds for the Capacitated Arc Routing Problem (Q3802908) (← links)
- Transformations of node‐balanced routing problems (Q4632892) (← links)
- Approximate solutions for the maximum benefit chinese postman problem (Q5426612) (← links)
- Combinatorial optimization and green logistics (Q5900891) (← links)
- Combinatorial optimization and green logistics (Q5925286) (← links)