Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: SSCFLPsolver / rank | |||
Normal rank | |||
Revision as of 21:06, 28 February 2024
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
