Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems (Q3722274)
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 3952502
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems |
scientific article; zbMATH DE number 3952502 |
Statements
Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems (English)
0 references
1985
0 references
convexification of discrete optimization problems
0 references
approximations to the convex hull of the feasible set
0 references
disjunctive programming
0 references
unions of polyhedra
0 references
relaxations
0 references
critical path problems
0 references
network synthesis
0 references
fixed charge network flow problems
0 references
machine sequencing
0 references
0 references
0.9462183
0 references
0.9333025
0 references
0.9306881
0 references
0.92627496
0 references
0.9110937
0 references
0.9110803
0 references
0.9108669
0 references
0.90362656
0 references
