Nodal aggregation of resource constraints in a shortest path problem

DOI10.1016/j.ejor.2004.09.052zbMath1168.90637OpenAlexW1972583698MaRDI QIDQ2490165

Anass 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

zbMATH Keywords

Lagrangian relaxationDynamic programmingColumn generationShortest pathResource constraintsSurrogate relaxationResource aggregation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items (2)

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

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The shortest path problem with two objective functions
• A reoptimization algorithm for the shortest path problem with time windows
• A lower bound for the shortest Hamiltonean path in directed graphs
• Multiple Cuts in the Analytic Center Cutting Plane Method
• The Shortest Path Problem with Time Windows and Linear Waiting Costs
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Plus court chemin avec contraintes d'horaires
• Algorithms for finding paths with multiple constraints
• Shortest chain subject to side constraints
• Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
• Vehicle Routing with Time Windows
• A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows
• Dynamic Programming State-Space Relaxation for Single-Machine Scheduling
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints

This page was built for publication: Nodal aggregation of resource constraints in a shortest path problem