Pages that link to "Item:Q2496043"
From MaRDI portal
The following pages link to A constraint programming approach to the Chinese postman problem with time windows (Q2496043):
Displaying 16 items.
- Counting feasible solutions of the traveling salesman problem with pickups and deliveries is \#\(P\)-complete (Q967292) (← links)
- Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows (Q975995) (← 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)
- The windy rural postman problem with a time-dependent zigzag option (Q1751757) (← links)
- On the flexibility of constraint programming models: From single to multiple time windows for the traveling salesman problem (Q1847167) (← links)
- Time-constrained Chinese postman problems (Q1886476) (← links)
- Shortest path problems with left-side time windows (Q1926637) (← links)
- An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← links)
- Solving the Chinese postman problem on time varying networks with timed automata (Q2917150) (← links)
- Recent results on Arc Routing Problems: An annotated bibliography (Q3057167) (← links)
- Solving the time varying postman problems with timed automata (Q3458818) (← links)
- Combinatorial optimization and green logistics (Q5900891) (← links)
- Combinatorial optimization and green logistics (Q5925286) (← links)
- Arc routing problems: A review of the past, present, and future (Q6087068) (← links)
- The mixed capacitated general routing problem with <scp>time‐dependent</scp> demands (Q6092639) (← links)
