SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems (Q828878)
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: SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems |
scientific article; zbMATH DE number 7344090
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems |
scientific article; zbMATH DE number 7344090 |
Statements
SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems (English)
0 references
5 May 2021
0 references
tri-objective programming
0 references
mixed-integer linear programming
0 references
non-dominated points
0 references
lexicographic optimization
0 references
exact method
0 references
non-dominated faces
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
