A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints (Q2368115)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 279411
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints |
scientific article; zbMATH DE number 279411 |
Statements
A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints (English)
0 references
23 August 1993
0 references
linear side-constraints
0 references
Lagrangian relaxation
0 references
parametric programming
0 references
subgradient method
0 references
0 references
0.9380969
0 references
0.8828728
0 references
0.87818587
0 references
0.8775871
0 references
0.8722137
0 references
0.86832964
0 references
