Pages that link to "Item:Q2892297"

The following pages link to The Shortest-Path Problem with Resource Constraints and <i>k</i>-Cycle Elimination for <i>k</i> ≥ 3 (Q2892297):

Displaying 50 items.

• The orienteering problem with time windows applied to robotic melon harvesting (Q255095) (← links)
• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774) (← links)
• Efficient elementary and restricted non-elementary route pricing (Q297071) (← links)
• The discrete time window assignment vehicle routing problem (Q319363) (← links)
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations (Q323018) (← links)
• Lifted and local reachability cuts for the vehicle routing problem with time windows (Q336427) (← links)
• Pricing routines for vehicle routing with time windows on road networks (Q337163) (← links)
• Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints (Q439444) (← links)
• Multi-objective and multi-constrained non-additive shortest path problems (Q609807) (← links)
• A tutorial on column generation and branch-and-price for vehicle routing problems (Q633483) (← links)
• A general heuristic for vehicle routing problems (Q869003) (← links)
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times (Q955327) (← links)
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach (Q958447) (← links)
• Real-time vehicle rerouting problems with time windows (Q958553) (← links)
• Exploiting sparsity in pricing routines for the capacitated arc routing problem (Q1013413) (← links)
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows (Q1040973) (← links)
• Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem (Q1651640) (← links)
• A branch-and-price algorithm for the minimum latency problem (Q1652580) (← links)
• A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine (Q1653363) (← links)
• The vehicle routing problem with service level constraints (Q1681277) (← links)
• Route relaxations on GPU for vehicle routing problems (Q1751660) (← links)
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster (Q1753599) (← links)
• Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q1759849) (← links)
• The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
• Routing a mix of conventional, plug-in hybrid, and electric vehicles (Q1991124) (← links)
• A branch-and-price algorithm for a vehicle routing with demand allocation problem (Q1991157) (← links)
• Pessimistic evasive flow capturing problems (Q2030509) (← links)
• Exact algorithms for the traveling salesman problem with draft limits (Q2256207) (← links)
• The distance constrained multiple vehicle traveling purchaser problem (Q2256245) (← links)
• Exact solution of the soft-clustered vehicle-routing problem (Q2272311) (← links)
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints (Q2339816) (← links)
• A compact transformation of arc routing problems into node routing problems (Q2341211) (← links)
• The nuclear medicine production and delivery problem (Q2356256) (← links)
• Improved branch-cut-and-price for capacitated vehicle routing (Q2398107) (← links)
• Algorithms for non-linear and stochastic resource constrained shortest path (Q2417959) (← links)
• Combined location and routing problems for drug distribution (Q2448896) (← links)
• Solving elementary shortest-path problems as mixed-integer programs (Q2454365) (← links)
• Formulations and exact algorithms for the vehicle routing problem with time windows (Q2468488) (← links)
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
• Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach (Q2514731) (← links)
• Solving capacitated arc routing problems using a transformation to the CVRP (Q2581620) (← links)
• Projection results for vehicle routing (Q2583125) (← links)
• A column generation approach for a multi-attribute vehicle routing problem (Q2629734) (← links)
• Column generation based heuristic for tactical planning in multi-period vehicle routing (Q2643933) (← links)
• A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection (Q2664333) (← links)
• Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen (Q2664412) (← links)
• Selective routing problem with synchronization (Q2669549) (← links)
• An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs (Q2670556) (← links)