Lifting valid inequalities for the precedence constrained knapsack problem
DOI10.1007/S101070050084zbMATH Open1015.90072OpenAlexW3127252491MaRDI QIDQ1806031FDOQ1806031
J. J. van de Klundert, Stan Van Hoesel, Robert L. M. J. van de Leensel
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
Combinatorial optimization (90C27) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Inventory, storage, reservoirs (90B05)
Cited In (15)
- Primal-dual algorithms for precedence constrained covering problems
- Polyhedral results for the precedence-constrained knapsack problem
- 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
- Knapsack polytopes: a survey
- 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
- Primal-Dual Algorithms for Precedence Constrained Covering Problems
- 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)
