LAD models, trees, and an analog of the fundamental theorem of arithmetic
From MaRDI portal
(Redirected from Publication:1949097)
Recommendations
Cites work
- An analog of the fundamental theorem of arithmetic in ordered groupoids
- Combinatorial optimization models for production scheduling in automated manufacturing systems
- Logical analysis of data -- an overview: from combinatorial optimization to medical applications
- On the approximability of average completion time scheduling under precedence constraints.
- Optimal Linear Ordering
- Partially ordered knapsack and applications to scheduling
- Quadratic knapsack problems
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Single-Machine Job Sequencing with Treelike Precedence Ordering and Linear Delay Penalties
- The quadratic 0-1 knapsack problem with series-parallel support
- Worst-case performance of approximation algorithms for tool management problems
Cited in
(2)
This page was built for publication: LAD models, trees, and an analog of the fundamental theorem of arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1949097)