A Lagrangian relaxation on relaxed decision diagrams, with nodes merged only on exact state variables, yields very tight lower bounds and some first optimality proofs for classic single-machine scheduling benchmarks.
Computers and Operations Research 28, 787–801 (2001)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Improved Job sequencing Bounds from Decision Diagrams
A Lagrangian relaxation on relaxed decision diagrams, with nodes merged only on exact state variables, yields very tight lower bounds and some first optimality proofs for classic single-machine scheduling benchmarks.