Pages that link to "Item:Q4408696"
From MaRDI portal
The following pages link to A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows (Q4408696):
Displaying 32 items.
- Branch-and-price algorithms for the solution of the multi-trip vehicle routing problem with time windows (Q320995) (← links)
- Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
- A pure proactive scheduling algorithm for multiple Earth observation satellites under uncertainties of clouds (Q342441) (← links)
- Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework (Q363544) (← links)
- Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW (Q439557) (← links)
- A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
- Arcs-states models for the vehicle routing problem with time windows and related problems (Q856684) (← links)
- A goal programming approach to vehicle routing problems with soft time windows (Q857306) (← links)
- A branch and cut algorithm for resource-constrained project scheduling problem subject to nonrenewable resources with pre-scheduled procurement (Q900590) (← links)
- Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
- A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen (Q1617109) (← links)
- A branch-and-cut algorithm for the time window assignment vehicle routing problem (Q1652456) (← links)
- Branch-price-and-cut for the mixed capacitated general routing problem with time windows (Q1754228) (← links)
- An improved LNS algorithm for real-time vehicle routing problem with time windows (Q1761960) (← links)
- Optimizing the planning of the observation of a catalog of objects by a mobile observer, taking the implicated limitations into account (Q2171276) (← links)
- Polyhedral results and exact algorithms for the asymmetric travelling salesman problem with replenishment arcs (Q2384394) (← links)
- A branch-and-price-and-check model for the vehicle routing problem with location congestion (Q2398439) (← links)
- Reachability cuts for the vehicle routing problem with time windows (Q2432846) (← links)
- New cutting-planes for the time- and/or precedence-constrained ATSP and directed VRP (Q2466786) (← links)
- Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
- Exact and heuristic algorithms for the vehicle routing problem with multiple interdependent time windows (Q2475859) (← links)
- A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems (Q2488912) (← links)
- Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs (Q2494811) (← links)
- Lagrangian duality applied to the vehicle routing problem with time windows (Q2496037) (← links)
- A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows (Q2506187) (← links)
- Routing and scheduling field service operation by P-graph (Q2669568) (← links)
- 2-path cuts for the vehicle routing problem with time windows (Q2783836) (← links)
- Solution of a min-max vehicle routing problem (Q2884530) (← links)
- Vehicle Routing with Time Windows (Q3777788) (← links)
- AN ASP-BASED MODEL EMPLOYING A TABU SEARCH METHOD FOR MAKING e-LOGISTICS DECISIONS (Q5405793) (← links)
- A solution approach for multi‐trip vehicle routing problems with time windows, fleet sizing, and depot location (Q6065845) (← links)
- A multi‐vehicle covering tour problem with speed optimization (Q6065856) (← links)
