A penalty function heuristic for the resource constrained shortest path problem

European Journal of Operational Research

Volumn 142, Issue 2, 2002, Pages 221-230

  Avella, Pasquale ^a   Boccia, Maurizio ^b   Sforza, Antonio ^b  

^a UNIVERSITY OF SANNIO   (Italy)

^b UNIVERSITY OF NAPLES FEDERICO II   (Italy)

Author keywords

Constrained shortest path; Penalty function heuristic

Indexed keywords

COMPUTATIONAL METHODS; CONSTRAINT THEORY; HEURISTIC METHODS; ITERATIVE METHODS; LINEAR PROGRAMMING; PROBLEM SOLVING;

RESOURCE CONSTRAINED SHORTEST PATH PROBLEM (RCSP);

OPERATIONS RESEARCH;

EID: 0037120694     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(02)00262-X     Document Type: Conference Paper

References (23)

1. Shortest chain subject to side conditions
2. An algorithm for the resource constrained shortest path problem
3. A note on two problems in connection with graphs
4. Two engineering applications of a constrained shortest-path model
5. Approximate max-flow min-(multi)cut theorems and their applications
6. Fast approximate schemes for convex programs with many blocks and coupling constraints
7. An exponential-function reduction method for block-angular convex programs
8. -2KNM) time
9. A dual, algorithm for the constrained shortest path problem
10. Algorithms for finding paths with multiple constraints
11. A constrained shortest path algorithm
12. The shortest route problem with constraints
13. Fast approximation algorithms for multicommodities flow problems
14. Implementation of algorithms for k-shortest loopless paths
15. Adding multiple cost constraints to combinatorial optimization problems
16. Most profitable routing before maintenance
17. Finding the k-shortest, loopless paths in a network