The equity constrained shortest path problem (Q910348): Difference between revisions
From MaRDI portal
Revision as of 13:52, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equity constrained shortest path problem |
scientific article |
Statements
The equity constrained shortest path problem (English)
0 references
1990
0 references
The shortest path problem with equality constraints is examined. A subgradient algorithm is developed to solve the Lagrangean dual, and a labeling procedure is used to close any remaining duality gap. The authors present a heuristic procedure and report some computational experience with the model.
0 references
Lagrangean relaxation
0 references
shortest path
0 references
equality constraints
0 references
subgradient algorithm
0 references
Lagrangean dual
0 references
labeling
0 references
heuristic
0 references
