Nodal aggregation of resource constraints in a shortest path problem
DOI10.1016/J.EJOR.2004.09.052zbMATH Open1168.90637OpenAlexW1972583698MaRDI QIDQ2490165FDOQ2490165
Authors: A. Nagih, François Soumis 
Publication date: 28 April 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.09.052
Recommendations
- Shorter Path Constraints for the Resource Constrained Shortest Path Problem
- Shortest Path Problems with Resource Constraints
- A polyhedral study of the elementary shortest path problem with resource constraints
- scientific article; zbMATH DE number 1670670
- scientific article; zbMATH DE number 1445588
- A survey of resource constrained shortest path problems: exact solution approaches
- Multi-criteria approximation schemes for the resource constrained shortest path problem
- Solving resource constrained shortest path problems with LP-based methods
- An algorithm for the resource constrained shortest path problem
Lagrangian relaxationColumn generationDynamic programmingShortest pathResource constraintsSurrogate relaxationResource aggregation
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)
Cites Work
- A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
- Title not available (Why is that?)
- A reoptimization algorithm for the shortest path problem with time windows
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Algorithms for finding paths with multiple constraints
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
- Shortest chain subject to side constraints
- The shortest path problem with two objective functions
- Vehicle Routing with Time Windows
- Title not available (Why is that?)
- Title not available (Why is that?)
- The shortest path problem with time windows and linear waiting costs
- Multiple cuts in the analytic center cutting plane method
- Plus court chemin avec contraintes d'horaires
- A lower bound for the shortest Hamiltonean path in directed graphs
Cited In (4)
- A multiphase dynamic programming algorithm for the shortest path problem with resource constraints
- Hybrid column generation for large-size covering integer programs: application to transportation planning
- Performances improvement of the column generation algorithm: application to vehicle routing problems
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context
Uses Software
This page was built for publication: Nodal aggregation of resource constraints in a shortest path problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2490165)
