Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (Q339612)
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: Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case |
scientific article; zbMATH DE number 6651753
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case |
scientific article; zbMATH DE number 6651753 |
Statements
Multiple objective branch and bound for mixed 0-1 linear programming: corrections and improvements for the biobjective case (English)
0 references
11 November 2016
0 references
multi-objective mixed integer programming
0 references
nondominated set
0 references
dominance filtering
0 references
multi-objective linear programming
0 references
branch and bound
0 references
0 references
0 references
0 references
0 references
0 references
0.8419003486633301
0 references
0.8372278213500977
0 references
0.8271763324737549
0 references
0.8182485103607178
0 references
0.7850475311279297
0 references
