Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902)
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: Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming |
scientific article; zbMATH DE number 6859035
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming |
scientific article; zbMATH DE number 6859035 |
Statements
Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (English)
0 references
12 April 2018
0 references
basic step
0 references
disjunctive programming
0 references
\(K\)-means clustering
0 references
Lagrangian decomposition
0 references
mixed-integer conic quadratic optimization
0 references
0 references
0 references
0 references
0.86299527
0 references
0.8542765
0 references
0.8540163
0 references
0.8535704
0 references
0.8488511
0 references
0.8464204
0 references
0.8435616
0 references
