Lifting valid inequalities for the precedence constrained knapsack problem
From MaRDI portal
Publication:1806031
DOI10.1007/s101070050084zbMath1015.90072OpenAlexW3127252491MaRDI QIDQ1806031
J. J. van de Klundert, Stan P. M. 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
Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Inventory, storage, reservoirs (90B05)
Related Items
Large-scale multi-period precedence constrained knapsack problem: A mining application ⋮ Knapsack polytopes: a survey ⋮ Primal-Dual Algorithms for Precedence Constrained Covering Problems ⋮ Primal-dual algorithms for precedence constrained covering 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 ⋮ Approximations for the two-machine cross-docking flow shop problem ⋮ The precedence constrained knapsack problem: separating maximally violated inequalities ⋮ Cutting planes in integer and mixed integer programming ⋮ An integer programming algorithm for routing optimization in IP networks ⋮ A strengthened formulation and cutting planes for the open pit mine production scheduling problem ⋮ Production planning and scheduling in mining scenarios under IPCC mining systems ⋮ 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
