Pages that link to "Item:Q2196312"

The following pages link to A generic exact solver for vehicle routing and related problems (Q2196312):

Displaying 44 items.

• Nested branch-and-price-and-cut for vehicle routing problems with multiple resource interdependencies (Q666967) (← links)
• An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts (Q948965) (← links)
• An exact solution framework for a broad class of vehicle routing problems (Q993700) (← links)
• A remark on ``Integer linear programming formulation for a vehicle routing problem'' by N. R. Achutan and L. Caccetta, or how to use the Clark \(\&\) Wright savings to write such integer linear programming formulations (Q1333529) (← links)
• An open source spreadsheet solver for vehicle routing problems (Q1652315) (← links)
• An efficient transformation of the generalized vehicle routing problem (Q1971986) (← links)
• Mixed-integer linear optimization for full truckload pickup and delivery (Q2047182) (← links)
• New exact techniques applied to a class of network flow formulations (Q2061874) (← links)
• Two-echelon vehicle routing problems: a literature review (Q2079391) (← links)
• An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
• Robust vehicle routing under uncertainty via branch-price-and-cut (Q2101653) (← links)
• Using VRPSolver to efficiently solve the \textsc{differential harvest problem} (Q2108125) (← links)
• Generalized relax-and-fix heuristic (Q2108128) (← links)
• A unified exact approach for clustered and generalized vehicle routing problems (Q2108132) (← links)
• The vehicle allocation problem: alternative formulation and branch-and-price method (Q2147070) (← links)
• The arc-item-load and related formulations for the cumulative vehicle routing problem (Q2172084) (← links)
• A POPMUSIC matheuristic for the capacitated vehicle routing problem (Q2669570) (← links)
• Guidelines for the computational testing of machine learning approaches to vehicle routing problems (Q2670511) (← links)
• Multi-shuttle crane scheduling in automated storage and retrieval systems (Q2672114) (← links)
• Adjusting the order crossover operator for capacitated vehicle routing problems (Q2676389) (← links)
• A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem (Q2688881) (← links)
• Constant-factor approximation algorithms for a series of combinatorial routing problems based on the reduction to the asymmetric traveling salesman problem (Q2689288) (← links)
• Exact solution of network flow models with strong relaxations (Q2689828) (← links)
• Bin Packing Problem with Time Lags (Q5106420) (← links)
• Approximating the chance-constrained capacitated vehicle routing problem with robust optimization (Q6054019) (← links)
• Column elimination for capacitated vehicle routing problems (Q6057244) (← links)
• Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem (Q6085887) (← links)
• The multi‐depot family traveling salesman problem and clustered variants: Mathematical formulations and branch‐&‐cut based methods (Q6085888) (← links)
• Estimating the marginal cost to deliver to individual customers (Q6088526) (← links)
• Research trends in combinatorial optimization (Q6091419) (← links)
• Integer programming column generation: accelerating branch-and-price using a novel pricing scheme for finding high-quality solutions in set covering, packing, and partitioning problems (Q6095737) (← links)
• Hybrid branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with time windows (Q6106578) (← links)
• The transportation problem with packing constraints (Q6106585) (← links)
• Budget-balanced and strategy-proof auctions for ridesharing (Q6109306) (← links)
• Planning robust drone-truck delivery routes under road traffic uncertainty (Q6112843) (← links)
• Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows (Q6113315) (← links)
• The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands (Q6161273) (← links)
• Solution validator and visualizer for (combined) vehicle routing and container loading problems (Q6165407) (← links)
• Solving vehicle routing problems with intermediate stops using VRPSolver models (Q6179690) (← links)
• Learning to repeatedly solve routing problems (Q6196890) (← links)
• On the exact solution of the multi-depot open vehicle routing problem (Q6492461) (← links)
• A unified exact approach for a broad class of vehicle routing problems with simultaneous pickup and delivery (Q6551059) (← links)
• Vehicle routing for connected service areas -- a versatile approach covering single, hierarchical, and bi-criteria objectives (Q6555172) (← links)
• PathWyse: a flexible, open-source library for the resource constrained shortest path problem (Q6586912) (← links)