Pages that link to "Item:Q4319758"
From MaRDI portal
The following pages link to Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints (Q4319758):
Displaying 10 items.
- Optimizing mining complexes with multiple processing and transportation alternatives: an uncertainty-based approach (Q319952) (← links)
- Optimization problems with color-induced budget constraints (Q1631646) (← links)
- On a class of branching problems in broadcasting and distribution (Q1761092) (← links)
- Locating tree-shaped facilities using the ordered median objective (Q1771313) (← links)
- Local search algorithms for the \(k\)-cardinality tree problem. (Q1811129) (← links)
- Output-polynomial enumeration of all fixed-cardinality ideals of a poset, respectively all fixed-cardinality subtrees of a tree. (Q2454050) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs (Q2564302) (← links)
- Optimization Problems with Color-Induced Budget Constraints (Q2835676) (← links)
- Minimizing the number of tardy jobs with precedence constraints and agreeable due dates (Q5961612) (← links)
