Pages that link to "Item:Q1396812"
From MaRDI portal
The following pages link to Multistars, partial multistars and the capacitated vehicle routing problem (Q1396812):
Displayed 33 items.
- Optimal capacitated ring trees (Q286687) (← links)
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
- A branch-and-cut algorithm for the hub location and routing problem (Q337094) (← links)
- Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
- Recent advances in vehicle routing exact algorithms (Q926561) (← links)
- An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
- Combined route capacity and route length models for unit demand vehicle routing problems (Q951110) (← links)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
- The periodic vehicle routing problem with driver consistency (Q1622811) (← links)
- Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
- The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)
- Minimum makespan vehicle routing problem with compatibility constraints (Q2011596) (← links)
- Capacitated ring arborescence problems with profits (Q2284638) (← links)
- A branch-and-cut algorithm for the capacitated profitable tour problem (Q2339836) (← links)
- Polynomial-time separation of enhanced reverse multistar inequalities (Q2450623) (← links)
- Formulations and valid inequalities for the heterogeneous vehicle routing problem (Q2490341) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741) (← links)
- Projection results for vehicle routing (Q2583125) (← links)
- New techniques for cost sharing in combinatorial optimization games (Q2638367) (← links)
- (Q2861522) (← links)
- New Families of Valid Inequalities for the Two-Echelon Vehicle Routing Problem (Q2883630) (← links)
- A branch-and-cut algorithm for the preemptive swapping problem (Q2913951) (← links)
- Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs (Q3057117) (← links)
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems (Q3564362) (← links)
- Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem (Q4599322) (← links)
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
- A branch‐and‐cut algorithm for the nonpreemptive swapping problem (Q5187945) (← links)
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route (Q5326796) (← links)
- New pricing strategies and an effective exact solution framework for profit-oriented ring arborescence problems (Q6109802) (← links)
- Valid inequalities and extended formulations for lot-sizing and scheduling problem with sequence-dependent setups (Q6113320) (← links)