Pages that link to "Item:Q297071"
From MaRDI portal
The following pages link to Efficient elementary and restricted non-elementary route pricing (Q297071):
Displaying 24 items.
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- A branch-and-price approach for a multi-period vehicle routing problem (Q337422) (← links)
- A branch-and-price algorithm for the multi-depot heterogeneous-fleet pickup and delivery problem with soft time windows (Q892384) (← links)
- Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem (Q1651640) (← links)
- A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
- The vehicle routing problem with service level constraints (Q1681277) (← links)
- Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
- A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
- The conditional \(p\)-dispersion problem (Q2046325) (← links)
- Industrial and tramp ship routing problems: closing the gap for real-scale instances (Q2294636) (← links)
- Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
- Vehicle routing problem with elementary shortest path based column generation (Q2489135) (← links)
- A column generation approach for a multi-attribute vehicle routing problem (Q2629734) (← links)
- The joint network vehicle routing game with optional customers (Q2668799) (← links)
- An exact solution approach for the inventory routing problem with time windows (Q2669489) (← links)
- Selective routing problem with synchronization (Q2669549) (← links)
- New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows (Q4599317) (← links)
- Selective arc‐ng pricing for vehicle routing (Q6092607) (← links)
- Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows (Q6092647) (← links)
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)
- PathWyse: a flexible, open-source library for the resource constrained shortest path problem (Q6586912) (← links)