Polyhedral results for the precedence-constrained knapsack problem
From MaRDI portal
Publication:1208480
DOI10.1016/0166-218X(90)90053-FzbMath0780.90069MaRDI QIDQ1208480
Publication date: 16 May 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10)
Related Items (22)
Large-scale multi-period precedence constrained knapsack problem: A mining application ⋮ Knapsack polytopes: a survey ⋮ A pegging approach to the precedence-constrained knapsack problem ⋮ Primal-Dual Algorithms for Precedence Constrained Covering Problems ⋮ Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems ⋮ Optimizing constrained subtrees of trees ⋮ On discrete optimization with ordering ⋮ Primal-dual algorithms for precedence constrained covering problems ⋮ Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems ⋮ Clique-based facets for the precedence constrained knapsack problem ⋮ Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem ⋮ Production Scheduling for Strategic Open Pit Mine Planning: A Mixed-Integer Programming Approach ⋮ The precedence constrained knapsack problem: separating maximally violated inequalities ⋮ Lifting cover inequalities for the precedence-constrained knapsack problem ⋮ Algorithms for the bounded set-up knapsack problem ⋮ The cardinality and precedence constrained maximum value sub-hypergraph problem and its applications ⋮ An integer programming algorithm for routing optimization in IP networks ⋮ A strengthened formulation and cutting planes for the open pit mine production scheduling problem ⋮ A solution approach for optimizing long- and short-term production scheduling at LKAB's kiruna mine ⋮ Optimization algorithms for the disjunctively constrained knapsack problem ⋮ Integer programming approach to the printed circuit board grouping problem ⋮ Stage-\(t\) scenario dominance for risk-averse multi-stage stochastic mixed-integer programs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The complexity of lifted inequalities for the knapsack problem
- Valid inequalities and facets of the capacitated plant location problem
- The capacitated plant location problem
- The simple plant location problem: Survey and synthesis
- Easily Computable Facets of the Knapsack Polytope
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- Solving Large-Scale Zero-One Linear Programming Problems
- Some facets of the simple plant location polytope
- Selected Applications of Minimum Cuts in Networks
- Technical Note—A Note on Zero-One Programming
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets of the knapsack polytope
- Facets of the Knapsack Polytope From Minimal Covers
- Approximation Algorithms for Certain Scheduling Problems
- Covering, Packing and Knapsack Problems
- On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees
- Properties of vertex packing and independence system polyhedra
- On the facial structure of set packing polyhedra
This page was built for publication: Polyhedral results for the precedence-constrained knapsack problem
