Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
From MaRDI portal
Recommendations
Cited in
(12)- Optimization problems with color-induced budget constraints
- On a class of branching problems in broadcasting and distribution
- Locating tree-shaped facilities using the ordered median objective
- Local search algorithms for the \(k\)-cardinality tree problem.
- Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree.
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints
- An O(pn^ 2) algorithm for the p-median and related problems on tree graphs
- Optimization problems with color-induced budget constraints
- Optimizing mining complexes with multiple processing and transportation alternatives: an uncertainty-based approach
- scientific article; zbMATH DE number 3934404 (Why is no real title available?)
- Choosing Subsets with Maximum Weighted Average
- Minimizing the number of tardy jobs with precedence constraints and agreeable due dates
This page was built for publication: Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4319758)
