Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632)
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: Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets |
scientific article; zbMATH DE number 7283456
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets |
scientific article; zbMATH DE number 7283456 |
Statements
Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (English)
0 references
9 December 2020
0 references
bi-objective branch-and-cut
0 references
bi-objective optimization
0 references
combinatorial optimization
0 references
branch-and-cut
0 references
0 references
0 references
0 references
0 references
0 references
