A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems (Q3762072)
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: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems |
scientific article; zbMATH DE number 4012315
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems |
scientific article; zbMATH DE number 4012315 |
Statements
A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems (English)
0 references
1986
0 references
linearization techniques
0 references
zero-one quadratic programming
0 references
mixed-integer linear programming problem
0 references
Lagrangian relaxation
0 references
implicit enumeration
0 references
Benders' cutting planes
0 references
0.8504963517189026
0 references
0.8381890654563904
0 references
0.832333505153656
0 references
0.8320956826210022
0 references
0.8299936652183533
0 references
