Improved preprocessing, labeling and scaling algorithms for the Weight-Constrained Shortest Path Problem
From MaRDI portal
Publication:4432762
DOI10.1002/net.10090zbMath1031.68144OpenAlexW2036900823MaRDI QIDQ4432762
Natashia Boland, Irina Dumitrescu
Publication date: 29 October 2003
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.10090
Related Items
Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context ⋮ Network Design with Service Requirements: Scaling-up the Size of Solvable Problems ⋮ The constrained shortest path problem with stochastic correlated link travel times ⋮ Modeling and solving the rooted distance-constrained minimum spanning tree problem ⋮ An integrated scenario-based approach for robust aircraft routing, crew pairing and re-timing ⋮ A penalty search algorithm for the obstacle neutralization problem ⋮ A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs ⋮ On an exact method for the constrained shortest path problem ⋮ Implementation of a three-stage approach for the dynamic resource-constrained shortest-path sub-problem in branch-and-price ⋮ Solving resource constrained shortest path problems with LP-based methods ⋮ An efficient approach for searching optimal multi-keywords coverage routes ⋮ The network design problem with relays ⋮ An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem ⋮ Stabilizing branch‐and‐price for constrained tree problems ⋮ An Efficient Label-Correcting Algorithm for the Multiobjective Shortest Path Problem ⋮ Optimal placement of UV-based communications relay nodes ⋮ The last-mile delivery process with trucks and drones under uncertain energy consumption ⋮ Multi-objective and multi-constrained non-additive shortest path problems ⋮ Algorithms for non-linear and stochastic resource constrained shortest path ⋮ Trajectory planning for unmanned aerial vehicles: a network optimization approach ⋮ 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 ⋮ A computational study of solution approaches for the resource constrained elementary shortest path problem ⋮ A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization ⋮ Acceleration strategies for the weight constrained shortest path problem with replenishment ⋮ Lagrangian relaxation and enumeration for solving constrained shortest-path problems ⋮ LS(graph): a constraint-based local search for constraint optimization on trees and paths ⋮ Some observations about the extreme points of the generalized cardinality-constrained shortest path problem polytope ⋮ The resource constrained shortest path problem with uncertain data: a robust formulation and optimal solution approach ⋮ Branch and price for covering shipments in a logistic distribution network with a fleet of aircraft ⋮ Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints ⋮ Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming ⋮ 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 ⋮ Robust scheduling on a single machine to minimize total flow time ⋮ Path optimization for the resource-constrained searcher ⋮ Range-constrained traffic assignment with multi-modal recharge for electric vehicles ⋮ Dynamic programming approaches to solve the shortest path problem with forbidden paths ⋮ Solving the constrained shortest path problem using random search strategy ⋮ A branch-and-price algorithm for the long-term home care scheduling problem ⋮ Effective Algorithms for a Class of Discrete Valued Optimal Control Problems ⋮ Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem ⋮ Optimal routing with failure-independent path protection ⋮ A column generation-based diving heuristic to solve the multi-project personnel staffing problem with calendar constraints and resource sharing ⋮ A column generation heuristic for a dynamic generalized assignment problem ⋮ A survey of resource constrained shortest path problems: Exact solution approaches ⋮ Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem ⋮ Bicriteria Data Compression ⋮ On Accuracy of Approximation for the Resource Constrained Shortest Path Problem ⋮ Efficient Large-Scale Multi-Drone Delivery using Transit Networks ⋮ A branch-and-cut algorithm for the capacitated profitable tour problem ⋮ Branch-and-price for staff rostering: an efficient implementation using generic programming and nested column generation ⋮ Solving the shortest path tour problem
Cites Work
