The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
From MaRDI portal
Publication:2892297
DOI10.1287/ijoc.1040.0117zbMath1241.90161OpenAlexW2059816321MaRDI QIDQ2892297
Daniel Villeneuve, Stefan Irnich
Publication date: 18 June 2012
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.1040.0117
Related Items
The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem, Efficient elementary and restricted non-elementary route pricing, A column generation approach for a multi-attribute vehicle routing problem, The discrete time window assignment vehicle routing problem, Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem, Robust Team Orienteering Problem with Decreasing Profits, The electric fleet size and mix vehicle routing problem with time windows and recharging stations, Lifted and local reachability cuts for the vehicle routing problem with time windows, Column generation based heuristic for tactical planning in multi-period vehicle routing, Pricing routines for vehicle routing with time windows on road networks, Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem, A branch-and-price algorithm for the minimum latency problem, A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine, Exact algorithms for the double vehicle routing problem with multiple stacks, Improved branch-cut-and-price for capacitated vehicle routing, A general heuristic for vehicle routing problems, Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization, A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection, Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen, Multi-objective and multi-constrained non-additive shortest path problems, Selective routing problem with synchronization, An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs, The vehicle routing problem with service level constraints, Algorithms for non-linear and stochastic resource constrained shortest path, Selective arc‐ng pricing for vehicle routing, Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows, Branch-and-Price Approaches for Real-Time Vehicle Routing with Picking, Loading, and Soft Time Windows, Solving Stochastic Ship Fleet Routing Problems with Inventory Management Using Branch and Price, Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem, Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows, Column Generation Algorithms for the Capacitated m-Ring-Star Problem, A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows, A tutorial on column generation and branch-and-price for vehicle routing problems, The time dependent traveling salesman problem: polyhedra and algorithm, Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints, Combined location and routing problems for drug distribution, Solving elementary shortest-path problems as mixed-integer programs, Formulations and exact algorithms for the vehicle routing problem with time windows, Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems, Chvátal-Gomory Rank-1 Cuts Used in a Dantzig-Wolfe Decomposition of the Vehicle Routing Problem with Time Windows, Routing a mix of conventional, plug-in hybrid, and electric vehicles, A branch-and-price algorithm for a vehicle routing with demand allocation problem, The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times, Route relaxations on GPU for vehicle routing problems, Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster, Solving the team orienteering arc routing problem with a column generation approach, The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach, Real-time vehicle rerouting problems with time windows, A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem, Exact algorithms for the traveling salesman problem with draft limits, The distance constrained multiple vehicle traveling purchaser problem, Robust branch-and-cut-and-price for the capacitated vehicle routing problem, Exact solution of the soft-clustered vehicle-routing problem, A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem, A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows, Optimal routing with failure-independent path protection, A rollout algorithm for the resource constrained elementary shortest path problem, Pessimistic evasive flow capturing problems, Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation, Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach, Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem, A survey of resource constrained shortest path problems: Exact solution approaches, Exploiting sparsity in pricing routines for the capacitated arc routing problem, The Fixed-Charge Shortest-Path Problem, A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows, A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints, A compact transformation of arc routing problems into node routing problems, Solving capacitated arc routing problems using a transformation to the CVRP, Projection results for vehicle routing, The orienteering problem with time windows applied to robotic melon harvesting, The nuclear medicine production and delivery problem
