A branch-and-cut technique to solve multiobjective integer quadratic programming problems (Q1615968)
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 6969599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-and-cut technique to solve multiobjective integer quadratic programming problems |
scientific article; zbMATH DE number 6969599 |
Statements
A branch-and-cut technique to solve multiobjective integer quadratic programming problems (English)
0 references
31 October 2018
0 references
multiobjective optimization
0 references
quadratic programming
0 references
branch and bound
0 references
efficient cuts
0 references
multiobjective quadratic integer programming
0 references
0 references
0.8352178335189819
0 references
0.8316201567649841
0 references
0.828795850276947
0 references
0.8248695135116577
0 references
0.8200564384460449
0 references
