Pages that link to "Item:Q2398439"
From MaRDI portal
The following pages link to A branch-and-price-and-check model for the vehicle routing problem with location congestion (Q2398439):
Displayed 8 items.
- Constraint programming and operations research (Q1616390) (← links)
- Strengthening of feasibility cuts in logic-based benders decomposition (Q2117199) (← links)
- Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168) (← links)
- Nutmeg: a MIP and CP hybrid solver using branch-and-check (Q2226478) (← links)
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem (Q2669775) (← links)
- Exact Branch-Price-and-Cut for a Hospital Therapist Scheduling Problem with Flexible Service Locations and Time-Dependent Location Capacity (Q5086014) (← links)
- Computational evaluation of cut-strengthening techniques in logic-based Benders' decomposition (Q6081826) (← links)
- The vehicle routing problem with time windows and flexible delivery locations (Q6112699) (← links)