Pages that link to "Item:Q1881569"

The following pages link to A new branch-and-cut algorithm for the capacitated vehicle routing problem (Q1881569):

Displaying 50 items.

• CVRPSP (Q25361) (← links)
• Efficient elementary and restricted non-elementary route pricing (Q297071) (← links)
• The discrete time window assignment vehicle routing problem (Q319363) (← links)
• Stronger multi-commodity flow formulations of the capacitated vehicle routing problem (Q319445) (← links)
• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
• A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands (Q337090) (← links)
• The production routing problem: a review of formulations and solution algorithms (Q337418) (← links)
• Battery swap station location-routing problem with capacitated electric vehicles (Q337428) (← links)
• Modeling and solving profitable location and distribution problems (Q375987) (← links)
• Branch-cut-and-price for the vehicle routing problem with simultaneous pickup and delivery (Q376001) (← links)
• The coastal seaspace patrol sector design and allocation problem (Q395695) (← links)
• Partial-route inequalities for the multi-vehicle routing problem with stochastic demands (Q406333) (← links)
• Branch-and-cut with lazy separation for the vehicle routing problem with simultaneous pickup and delivery (Q408394) (← links)
• Single vehicle routing problems with a predefined customer sequence, compartmentalized load and stochastic demands (Q439377) (← links)
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
• DVRP: a hard dynamic combinatorial optimisation problem tackled by an evolutionary hyper-heuristic (Q604947) (← links)
• Routing problems with loading constraints (Q610992) (← links)
• A Branch-and-Cut method for the Capacitated Location-Routing Problem (Q622138) (← links)
• Heuristic and exact algorithms for the multi-pile vehicle routing problem (Q657060) (← links)
• A general heuristic for vehicle routing problems (Q869003) (← links)
• Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics (Q926347) (← links)
• Recent advances in vehicle routing exact algorithms (Q926561) (← links)
• Solving the capacitated location-routing problem. Abstract of Thesis (Q926566) (← 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)
• EVE-OPT: a hybrid algorithm for the capacitated vehicle routing problem (Q953302) (← links)
• Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
• An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
• Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413) (← links)
• Balanced vehicle routing: polyhedral analysis and branch-and-cut algorithm (Q1622797) (← links)
• Managing platelet supply through improved routing of blood collection vehicles (Q1651648) (← links)
• An exact algorithm for a vehicle-and-driver scheduling problem (Q1652246) (← links)
• A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines (Q1652346) (← links)
• A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456) (← links)
• Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems (Q1694814) (← links)
• Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem (Q1703462) (← links)
• A genetic algorithm for a green vehicle routing problem (Q1742204) (← links)
• BPPLIB: a library for bin packing and cutting stock problems (Q1746064) (← links)
• The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
• On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)
• Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
• The value of integrating loading and routing (Q1752774) (← links)
• New benchmark instances for the capacitated vehicle routing problem (Q1752871) (← links)
• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q1759849) (← links)
• A computational comparison of flow formulations for the capacitated location-routing problem (Q1799384) (← links)
• The close-open mixed vehicle routing problem (Q1926744) (← links)
• Improved lower bounds and exact algorithm for the capacitated arc routing problem (Q1942278) (← links)
• The capacitated vehicle routing problem: stronger bounds in pseudo-polynomial time (Q1991101) (← links)