The precedence constrained knapsack problem: separating maximally violated inequalities
DOI10.1016/J.DAM.2015.05.020zbMATH Open1330.90091OpenAlexW2137984373WikidataQ57707457 ScholiaQ57707457MaRDI QIDQ494425FDOQ494425
Authors: Marcos Goycoolea, Eduardo Moreno, Daniel G. Espinoza 
Publication date: 1 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.020
Recommendations
- Lifting cover inequalities for the precedence-constrained knapsack problem
- Lifting valid inequalities for the precedence constrained knapsack problem
- Polyhedral results for the precedence-constrained knapsack problem
- A pegging approach to the precedence-constrained knapsack problem
- On the exact separation of cover inequalities of maximum-depth
liftingshrinkingseparation probleminduced clique inequalityinduced cover inequalityprecedence-constrained knapsack problem
Cites Work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Faces for a linear inequality in 0–1 variables
- Canonical Cuts on the Unit Hypercube
- Solving LP relaxations of large-scale precedence constrained problems
- A strengthened formulation and cutting planes for the open pit mine production scheduling problem
- A new algorithm for the open-pit mine production scheduling problem
- A sliding time window heuristic for open pit mine block sequencing
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Polyhedral results for the precedence-constrained knapsack problem
- (1,k)-configurations and facets for packing problems
- Lifting valid inequalities for the precedence constrained knapsack problem
- Clique-based facets for the precedence constrained knapsack problem
- Lifting cover inequalities for the precedence-constrained knapsack problem
- Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
- Single-Machine Scheduling with Precedence Constraints
- Computing with domino-parity inequalities for the traveling salesman problem (TSP)
- Technical Note—Facets and Strong Valid Inequalities for Integer Programs
- Lifting, tilting and fractional programming revisited
Cited In (6)
- Polyhedral results for the precedence-constrained knapsack problem
- On the exact separation of cover inequalities of maximum-depth
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Production scheduling for strategic open pit mine planning: a mixed-integer programming approach
- Precedence-constrained covering problems with multiplicity constraints
- Precedence-constrained covering problems with multiplicity constraints
Uses Software
This page was built for publication: The precedence constrained knapsack problem: separating maximally violated inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q494425)
