N-extendible posets, and how to minimize total weighted completion time
From MaRDI portal
Publication:1962041
DOI10.1016/S0166-218X(99)00131-6zbMATH Open0954.05045MaRDI QIDQ1962041FDOQ1962041
Publication date: 14 November 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
- The Complexity of the Extendibility Problem for Finite Posets
- Minimizing the sum cost in linear extensions of a poset
- Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine
- scientific article; zbMATH DE number 1759433
- NP-partitions over posets with an application to reducing the set of solutions of NP problems
- On the extension complexity of combinatorial polytopes
- On the extension complexity of combinatorial polytopes
- scientific article; zbMATH DE number 7759298
- Minimizing the sum of weighted completion times with unrestricted weights
- Minimizing the maximum bump cost in linear extensions of a poset
Cites Work
- Title not available (Why is that?)
- On a unique tree representation for \(P_ 4\)-extendible graphs
- A tree representation for \(P_ 4\)-sparse graphs
- Sequencing Jobs to Minimize Total Weighted Completion Time Subject to Precedence Constraints
- Decomposition Algorithms for Single-Machine Sequencing with Precedence Relations and Deferral Costs
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- Title not available (Why is that?)
- Optimal Sequencing by Modular Decomposition: Polynomial Algorithms
- On the \(p\)-connectedness of graphs---a survey
- Interval orders without odd crowns are defect optimal
- The permutahedron of \(N\)-sparse posets
Cited In (1)
This page was built for publication: \(N\)-extendible posets, and how to minimize total weighted completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962041)
