Lifting valid inequalities for the precedence constrained knapsack problem

DOI10.1007/S101070050084MaRDI QIDQ1806031zbMATH OpenOpenAlexFDO

Authors J. J. van de Klundert, Robert L. M. J. van de Leensel, Stan Van Hoesel

Publication date 1999

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://cris.maastrichtuniversity.nl/en/publications/8d8063fa-d46c-4b0d-866e-18911f26a21a

zbMATH Keywords

complexityknapsack problemLP-relaxationcombinatorial problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05)

Recommendations

• Lifting cover inequalities for the precedence-constrained knapsack problem
• Polyhedral results for the precedence-constrained knapsack problem
• The complexity of lifted inequalities for the knapsack problem

Cited in

(16)

• Polyhedral results for the precedence-constrained knapsack problem
• Primal-dual algorithms for precedence constrained covering problems
• Production planning and scheduling in mining scenarios under IPCC mining systems
• Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
• The complexity of lifted inequalities for the knapsack problem
• An integer programming algorithm for routing optimization in IP networks
• An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope.
• Knapsack polytopes: a survey
• Primal-dual algorithms for precedence constrained covering problems
• Clique-based facets for the precedence constrained knapsack problem
• Large-scale multi-period precedence constrained knapsack problem: a mining application
• Approximations for the two-machine cross-docking flow shop problem
• Cutting planes in integer and mixed integer programming
• The precedence constrained knapsack problem: separating maximally violated inequalities
• A strengthened formulation and cutting planes for the open pit mine production scheduling problem
• Vehicle routing problem with time windows and a limited number of vehicles.

This page was built for publication: Lifting valid inequalities for the precedence constrained knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1806031)