Pages that link to "Item:Q3801320"
From MaRDI portal
The following pages link to Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows (Q3801320):
Displaying 16 items.
- Heuristics for the probabilistic traveling salesman problem with deadlines based on quasi-parallel Monte Carlo sampling (Q336343) (← links)
- A cluster-based optimization approach for the multi-depot heterogeneous fleet vehicle routing problem with time windows (Q853026) (← links)
- Industrial aspects and literature survey: fleet composition and routing (Q991360) (← links)
- An intelligent algorithm for mixed-integer programming models (Q1206379) (← links)
- Determining the optimal starting times in a cyclic schedule with a given route (Q1310046) (← links)
- Minimizing the fleet size with dependent time-window and single-track constraints (Q1317008) (← links)
- The discrete lot-sizing and scheduling problem with sequence-dependent setup costs (Q1331615) (← links)
- Shipping problems with body clock constraints. (Q1423446) (← links)
- School-bus routing for program scheduling (Q1823853) (← links)
- Lagrangean relaxation. (With comments and rejoinder). (Q1876461) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Integrated planning of loaded and empty container movements (Q1944871) (← links)
- On the computational complexity of the probabilistic traveling salesman problem with deadlines (Q2453174) (← links)
- A reactive MILP approach to the multidepot heterogeneous fleet vehicle routing problem with time windows (Q3422371) (← links)
- Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft (Q4638919) (← links)
- New integer linear programming formulation for the traveling salesman problem with time windows: minimizing tour duration with waiting times (Q5746675) (← links)
