LAD models, trees, and an analog of the fundamental theorem of arithmetic
type: Item
instance of: scholarly article
title: LAD models, trees, and an analog of the fundamental theorem of arithmetic
zbMATH Open document ID: 1318.92019
author: Nadia Brauner
author: Sylvain Gravier
author: Louis-Philippe Kronek
author: Frédéric Meunier
published in: Discrete Applied Mathematics
publication date: 2013-04-25T00:00:00Z
Mathematics Subject Classification ID: 92C50
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 6157654
zbMATH Keywords: decomposition theorem
zbMATH Keywords: lexicographic order
zbMATH Keywords: logical analysis of data
zbMATH Keywords: product of sequences
MaRDI profile type: Publication
full work available at URL: j.dam.2012.12.004
OpenAlex ID: W2077677946
cites work: Optimal Linear Ordering
cites work: Combinatorial optimization models for production scheduling in automated manufacturing systems
cites work: Worst-case performance of approximation algorithms for tool management problems
cites work: Quadratic knapsack problems
cites work: Logical analysis of data -- an overview: from combinatorial optimization to medical applications
cites work: Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
cites work: Partially ordered knapsack and applications to scheduling
cites work: Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
cites work: The quadratic 0-1 knapsack problem with series-parallel support
cites work: An analog of the fundamental theorem of arithmetic in ordered groupoids
cites work: On the approximability of average completion time scheduling under precedence constraints.
DOI: 10.1016/J.DAM.2012.12.004
description: scientific article; zbMATH DE number 6157654