Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem (Q4285173)
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 527618
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem |
scientific article; zbMATH DE number 527618 |
Statements
Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem (English)
0 references
13 March 1994
0 references
implicit enumeration procedure
0 references
pure integer 0/1 minimax problems
0 references
Benders decomposition
0 references
location of facilities
0 references
0.8112398386001587
0 references
0.7667384743690491
0 references
0.7614142298698425
0 references
0.7593269348144531
0 references
0.7583826780319214
0 references
