LAD models, trees, and an analog of the fundamental theorem of arithmetic

DOI10.1016/j.dam.2012.12.004zbMath1318.92019OpenAlexW2077677946MaRDI QIDQ1949097

Louis-Philippe Kronek, Frédéric Meunier, Sylvain Gravier, Nadia Brauner

Publication date: 25 April 2013

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2012.12.004

zbMATH Keywords

lexicographic orderdecomposition theoremlogical analysis of dataproduct of sequences

Mathematics Subject Classification ID

Applications of graph theory (05C90) Medical applications (general) (92C50)

Related Items

Integrated optimization model and algorithm for pattern generation and selection in logical analysis of data, Recent advances in the theory and practice of logical analysis of data

Cites Work

• Logical analysis of data -- an overview: from combinatorial optimization to medical applications
• Partially ordered knapsack and applications to scheduling
• An analog of the fundamental theorem of arithmetic in ordered groupoids
• Combinatorial optimization models for production scheduling in automated manufacturing systems
• On the approximability of average completion time scheduling under precedence constraints.
• The quadratic 0-1 knapsack problem with series-parallel support
• Quadratic knapsack problems
• Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
• Worst-case performance of approximation algorithms for tool management problems
• Optimal Linear Ordering
• Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties