The shortest-path problem with resource constraints and k-cycle elimination for k 3

DOI10.1287/IJOC.1040.0117zbMATH Open1241.90161OpenAlexW2059816321MaRDI QIDQ2892297FDOQ2892297

Authors: Stefan Irnich, Daniel Villeneuve 

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

Recommendations

• Shortest Path Problems with Resource Constraints
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• A polyhedral study of the elementary shortest path problem with resource constraints
• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
• New dynamic programming algorithms for the resource constrained elementary shortest path problem

zbMATH Keywords

shortest pathscolumn generationvehicle routingcycle elimination

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80)

Cited In (76)

• Column Generation Algorithms for the Capacitated m-Ring-Star Problem
• Vehicle routing with soft time windows and stochastic travel times: a column generation and branch-and-price solution approach
• The orienteering problem with time windows applied to robotic melon harvesting
• A column generation approach for a multi-attribute vehicle routing problem
• Shortest Path Problems with Resource Constraints
• Improving Column Generation for Vehicle Routing Problems via Random Coloring and Parallelization
• A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows
• A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
• Multi-objective and multi-constrained non-additive shortest path problems
• Asymmetry matters: dynamic half-way points in bidirectional labeling for solving shortest path problems with resource constraints faster
• Exact solution of the soft-clustered vehicle-routing problem
• Pessimistic evasive flow capturing problems
• Exploiting sparsity in pricing routines for the capacitated arc routing problem
• A general heuristic for vehicle routing problems
• A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows
• Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
• Reformulations and branch-and-price algorithm for the minimum cost hop-and-root constrained forest problem
• Optimal routing with failure-independent path protection
• Improved branch-cut-and-price for capacitated vehicle routing
• Efficient elementary and restricted non-elementary route pricing
• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
• Pricing routines for vehicle routing with time windows on road networks
• Routing a mix of conventional, plug-in hybrid, and electric vehicles
• Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
• A rollout algorithm for the resource constrained elementary shortest path problem
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• The manpower allocation problem with time windows and job-teaming constraints: A branch-and-price approach
• The discrete time window assignment vehicle routing problem
• The nuclear medicine production and delivery problem
• Algorithms for non-linear and stochastic resource constrained shortest path
• 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
• The electric fleet size and mix vehicle routing problem with time windows and recharging stations
• Exact algorithms for the double vehicle routing problem with multiple stacks
• Lifted and local reachability cuts for the vehicle routing problem with time windows
• A tutorial on column generation and branch-and-price for vehicle routing problems
• Real-time vehicle rerouting problems with time windows
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
• The time dependent traveling salesman problem: polyhedra and algorithm
• An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs
• The vehicle routing problem with service level constraints
• Exact approaches to the robust vehicle routing problem with time windows and multiple deliverymen
• Solving the team orienteering arc routing problem with a column generation approach
• A polyhedral study of the elementary shortest path problem with resource constraints
• A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
• Exact algorithms for the traveling salesman problem with draft limits
• A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem
• Combined location and routing problems for drug distribution
• Formulations and exact algorithms for the vehicle routing problem with time windows
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem
• Chvàtal-Gomory rank-1 cuts used in a Dantzig-Wolfe decomposition of the vehicle routing problem with time windows
• A survey of resource constrained shortest path problems: exact solution approaches
• Clique Inequalities Applied to the Vehicle Routing Problem with Time Windows
• An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
• A branch-and-price algorithm for a vehicle routing with demand allocation problem
• Robust Team Orienteering Problem with Decreasing Profits
• Route relaxations on GPU for vehicle routing problems
• Numerically safe lower bounds for the capacitated vehicle routing problem
• The distance constrained multiple vehicle traveling purchaser problem
• Projection results for vehicle routing
• Solving capacitated arc routing problems using a transformation to the CVRP
• Column generation based heuristic for tactical planning in multi-period vehicle routing
• A compact transformation of arc routing problems into node routing problems
• Solving elementary shortest-path problems as mixed-integer programs
• Analytic centre stabilization of column generation algorithm for the capacitated vehicle routing problem
• Selective arc‐ng pricing for vehicle routing
• Solving stochastic ship fleet routing problems with inventory management using branch and price
• PathWyse: a flexible, open-source library for the resource constrained shortest path problem
• Cut-First Branch-and-Price Second for the Capacitated Arc-Routing Problem
• A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
• A branch-cut-and-price algorithm for the traveling salesperson problem with hotel selection
• Branch-and-price approaches for real-time vehicle routing with picking, loading, and soft time windows
• The fixed-charge shortest-path problem
• Selective routing problem with synchronization
• Partial dominance in branch-price-and-cut algorithms for vehicle routing and scheduling problems with a single-segment tradeoff
• Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows

This page was built for publication: The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2892297)