Pages that link to "Item:Q3694981"
From MaRDI portal
The following pages link to Optimal Routing under Capacity and Distance Restrictions (Q3694981):
Displayed 50 items.
- An exact algorithm and a metaheuristic for the generalized vehicle routing problem with flexible fleet size (Q336876) (← links)
- A bi-objective model for the used oil location-routing problem (Q337643) (← links)
- Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
- Polyhedral study of the capacitated vehicle routing problem (Q688914) (← links)
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- Integer linear programming formulation for a vehicle routing problem (Q804473) (← links)
- A note on ``Coordination of production and distribution planning'' by P. Chandra and M. L. Fisher (Q856257) (← 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)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- Models and exact solutions for a class of stochastic location-routing problems (Q1123112) (← links)
- A result on projection for the vehicle routing problem (Q1127162) (← links)
- Polyhedral results for a vehicle routing problem (Q1176821) (← links)
- The vehicle routing problem: An overview of exact and approximate algorithms (Q1198313) (← links)
- A new subtour elimination constraint for the vehicle routing problem (Q1278251) (← links)
- Planning models for freight transportation (Q1278638) (← links)
- Vehicle routing with split deliveries (Q1327209) (← links)
- A heuristic solution to the warehouse location-routing problem (Q1331555) (← links)
- A branch-and-cut algorithm for vehicle routing problems (Q1339118) (← links)
- Optimization of multi-feeder (depot) printed circuit board manufacturing with error guarantees. (Q1405236) (← links)
- Resource planning and a depot location model for electric power restoration. (Q1428043) (← links)
- Optimization of printed circuit board manufacturing: Integrated modeling and algorithms (Q1577779) (← links)
- Planning models for long-haul operations of postal and express shipment companies (Q1582188) (← links)
- A real delivery problem dealt with Monte Carlo techniques (Q1592629) (← links)
- Separating capacity constraints in the CVRP using tabu search (Q1609917) (← 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)
- A genetic algorithm for a green vehicle routing problem (Q1742204) (← links)
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations (Q1908292) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The close-open mixed vehicle routing problem (Q1926744) (← links)
- Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints (Q1926986) (← links)
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes (Q2031089) (← links)
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168) (← links)
- Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account (Q2171276) (← links)
- A branch-and-cut algorithm for the soft-clustered vehicle-routing problem (Q2208364) (← links)
- The inventory routing problem with demand moves (Q2226502) (← links)
- Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints (Q2256169) (← links)
- Improvements and extensions to Miller-Tucker-Zemlin subtour elimination constraints (Q2276891) (← links)
- A branch-and-cut algorithm for an assembly routing problem (Q2286876) (← links)
- A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem (Q2367016) (← links)
- Distance-constrained capacitated vehicle routing problems with flexible assignment of start and end depots (Q2427108) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem (Q2489310) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
- Projection results for vehicle routing (Q2583125) (← links)
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem (Q2664007) (← links)