An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming (Q3468895)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4135728
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming |
scientific article; zbMATH DE number 4135728 |
Statements
An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming (English)
0 references
1990
0 references
interactive multiple objective decision making
0 references
interactive algorithms
0 references
interactive branch-and-bound algorithm
0 references
bicriterion nonconvex programming
0 references
0 references
0.8685783743858337
0 references
0.8682045340538025
0 references
0.8294393420219421
0 references
0.8288828134536743
0 references
