Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method. (Q5928425)
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: Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method. |
scientific article; zbMATH DE number 1582632
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method. |
scientific article; zbMATH DE number 1582632 |
Statements
Success guarantee of dual search in integer programming: \(p\)-th power Lagrangian method. (English)
0 references
2000
0 references
0.8910426
0 references
0.85988855
0 references
0 references
0.8460429
0 references
0.8458983
0 references
0.8458078
0 references
0.84372234
0 references
