The equity constrained shortest path problem (Q910348)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The equity constrained shortest path problem |
scientific article; zbMATH DE number 4139522
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The equity constrained shortest path problem |
scientific article; zbMATH DE number 4139522 |
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
0.8612577
0 references
0.86106837
0 references
0.85513747
0 references
0.85319686
0 references
0.8496418
0 references
0 references
0.84666264
0 references
0.8464304
0 references
0.84625167
0 references
