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 this page instead for the normal view: A branch-and-cut technique to solve multiobjective integer quadratic programming problems |
scientific article; zbMATH DE number 6969599
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
