A penalty function heuristic for the resource constrained shortest path problem
type: Item
instance of: scholarly article
title: A penalty function heuristic for the resource constrained shortest path problem
zbMATH Open document ID: 1082.90572
DOI: 10.1016/S0377-2217(02)00262-X
published in: European Journal of Operational Research
publication date: 2002-11-20T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 1832927
zbMATH Keywords: Constrained shortest path
zbMATH Keywords: Penalty function heuristic
author: Pasquale Avella
author: Maurizio Boccia
author: Antonio Sforza
describes a project that uses: XPRESS
MaRDI profile type: Publication
cites work: Shortest chain subject to side constraints
cites work: An algorithm for the resource constrained shortest path problem
cites work: A note on two problems in connexion with graphs
cites work: Two engineering applications of a constrained shortest-path model
cites work: Approximate max-flow min-(multi)cut theorems and their applications
cites work: Q3840370
cites work: Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
cites work: An exponential‐function reduction method for block‐angular convex programs
cites work: Approximate minimum-cost multicommodity flows in \(\widetilde O(\varepsilon^{-2}KNM)\) time
cites work: Algorithms for finding paths with multiple constraints
cites work: The shortest route problem with constraints
cites work: Implementation of algorithms forK shortest loopless paths
cites work: Q4234047
cites work: Finding the K Shortest Loopless Paths in a Network
full work available at URL: s0377-2217(02)00262-x
OpenAlex ID: W2017597147
description: scientific article; zbMATH DE number 1832927