A survey of resource constrained shortest path problems: Exact solution approaches
From MaRDI portal
Publication:2811308
DOI10.1002/net.21511zbMath1338.90432OpenAlexW1995415305WikidataQ58921139 ScholiaQ58921139MaRDI QIDQ2811308
Luigi Di Puglia Pugliese, Francesca Guerriero
Publication date: 10 June 2016
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21511
Related Items
Efficient elementary and restricted non-elementary route pricing, Modelling the mobile target covering problem using flying drones, A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs, A profit-maximization location-routing-pricing problem: a branch-and-price algorithm, Solving resource constrained shortest path problems with LP-based methods, Congestion avoiding heuristic path generation for the proactive route guidance, An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem, The arc-item-load and related formulations for the cumulative vehicle routing problem, Exact Approaches for Single Machine Total Weighted Tardiness Batch Scheduling, Two-phase algorithm for solving the preference-based multicriteria optimal path problem with reference points, The last-mile delivery process with trucks and drones under uncertain energy consumption, The transit time constrained fixed charge multi-commodity network design problem, The rainbow Steiner tree problem, Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings, The structural complexity landscape of finding balance-fair shortest paths, Estimating the marginal cost to deliver to individual customers, An exact bidirectional pulse algorithm for the constrained shortest path, The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm, Limited memory rank-1 cuts for vehicle routing problems, The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach, Perspectives on integer programming for time-dependent models, A rollout algorithm for the resource constrained elementary shortest path problem, Shortest path tour problem with time windows, An auction-based approach for the re-optimization shortest path tree problem, A branch and price algorithm to solve the quickest multicommodity \(k\)-splittable flow problem, On the shortest path problem with negative cost cycles, A dynamic programming algorithm for solving the \(k\)-color shortest path problem, Lagrangian relaxation for the multiple constrained robust shortest path problem, An efficient exact approach for the constrained shortest path tour problem, A generalized shortest path tour problem with time windows, The Constrained Reliable Shortest Path Problem in Stochastic Time-Dependent Networks, Delay-constrained shortest paths: approximation algorithms and second-order cone models, Robust vehicle routing under uncertainty via branch-price-and-cut, An exact reduction technique for the k-colour shortest path problem, A heuristic for cumulative vehicle routing using column generation
Cites Work
- Unnamed Item
- A note on two problems in connexion with graphs
- The shortest path problem with forbidden paths
- A column generation algorithm for the vehicle routing problem with soft time windows
- The orienteering problem: a survey
- Minimum cost path problems with relays
- An algorithm for ranking paths that may contain cycles
- The network design problem with relays
- Arc routing problems with time-dependent service costs
- Labeling algorithm for the shortest path problem with turn prohibitions with application to large-scale road networks
- Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming
- A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
- A heuristic approach to hard constrained shortest path problems
- A reoptimization algorithm for the shortest path problem with time windows
- The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
- A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation
- Solving shortest path problems with a weight constraint and replenishment arcs
- A penalty function heuristic for the resource constrained shortest path problem
- A computational study of solution approaches for the resource constrained elementary shortest path problem
- Branch and price for the vehicle routing problem with discrete Split deliveries and time windows
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
- A decision-theoretic approach to robust optimization in multivalued graphs
- Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
- A model to optimize placement operations on dual-head placement machines
- Resource extension functions: properties, inversion, and generalization to segments
- Vehicle routing problem with elementary shortest path based column generation
- Shortest path problem with forbidden paths: the elementary version
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- Flight String Models for Aircraft Fleeting and Routing
- New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
- A Multicommodity Network-Flow Problem with Side Constraints on Paths Solved by Column Generation
- The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k ≥ 3
- Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem
- The Cutting-Plane Method for Solving Convex Programs
- Plus court chemin avec contraintes d'horaires
- Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows
- New dynamic programming algorithms for the resource constrained elementary shortest path problem
- Lagrangian relaxation and enumeration for solving constrained shortest-path problems
- Shortest chain subject to side constraints
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- A Column Generation Approach to the Urban Transit Crew Scheduling Problem
- An algorithm for the resource constrained shortest path problem
- A dual algorithm for the constrained shortest path problem
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- Efficient string matching
- Shortest-Route Methods: 1. Reaching, Pruning, and Buckets
- Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
- An Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangian Relaxation
- Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
- A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
- A Set Partitioning Approach to the Crew Scheduling Problem
- An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems
- Shortest path with time constraints on movement and parking
- Dynamic programming approaches to solve the shortest path problem with forbidden paths
- Shortest Path Problems with Resource Constraints
- Searching for the Multiplier in One-Constraint Optimization Problems
