Login / Signup

Decorous combinatorial lower bounds for row layout problems.

Mirko DahlbeckAnja FischerFrank Fischer
Published in: Eur. J. Oper. Res. (2020)
Keyphrases
  • lower bound
  • upper bound
  • objective function
  • decision problems
  • np complete
  • data sets
  • search algorithm
  • np hard
  • error bounds
  • mathematical programming
  • problems involving