Clique-based facets for the precedence constrained knapsack problem
From MaRDI portal
Publication:431007
DOI10.1007/s10107-010-0438-7zbMath1259.90071OpenAlexW2141422661WikidataQ59139576 ScholiaQ59139576MaRDI QIDQ431007
Renata Sotirov, Gary Froyland, Christopher Fricke, Andreas Bley, Natashia Boland
Publication date: 26 June 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0438-7
Related Items (9)
Subset sum problems with digraph constraints ⋮ Primal-Dual Algorithms for Precedence Constrained Covering Problems ⋮ Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Primal-dual algorithms for precedence constrained covering problems ⋮ The knapsack problem with neighbour constraints ⋮ The precedence constrained knapsack problem: separating maximally violated inequalities ⋮ A strengthened formulation and cutting planes for the open pit mine production scheduling problem ⋮ A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts ⋮ Capacitated multi-layer network design with unsplittable demands: polyhedra and branch-and-cut
Uses Software
Cites Work
- Lifting cover inequalities for the precedence-constrained knapsack problem
- Polyhedral results for the precedence-constrained knapsack problem
- An application of branch and cut to open pit mine scheduling
- Lifting valid inequalities for the precedence constrained knapsack problem
- A strengthened formulation and cutting planes for the open pit mine production scheduling problem
- Conflict analysis in mixed integer programming
- Approximation Algorithms for Certain Scheduling Problems
- Disjunctive Programming
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Routing and Capacity Optimization for IP Networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Clique-based facets for the precedence constrained knapsack problem
