Heuristics and reduction methods for multiple constraints 0-1 linear programming problems (Q1067997)
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 3928720
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Heuristics and reduction methods for multiple constraints 0-1 linear programming problems |
scientific article; zbMATH DE number 3928720 |
Statements
Heuristics and reduction methods for multiple constraints 0-1 linear programming problems (English)
0 references
1986
0 references
multiple inequality constraints 0-1 linear programming
0 references
greedy algorithms
0 references
lower bound
0 references
surrogate relaxations
0 references
comparative study
0 references
heuristic methods
0 references
reduction
0 references
computational results
0 references
0.8197792172431946
0 references
0.8068552017211914
0 references
0.8037475347518921
0 references
0.7965907454490662
0 references
