The 0-1 knapsack problem with a single continuous variable
From MaRDI portal
Publication:1295954
DOI10.1007/s101070050044zbMath0956.90021OpenAlexW1990585107MaRDI QIDQ1295954
Hugues Marchand, Laurence A. Wolsey
Publication date: 28 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050044
Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items
Knapsack polytopes: a survey, Sequence Independent Lifting for the Set of Submodular Maximization Problem, A cutting plane algorithm for the capacitated facility location problem, Using cuts for mixed integer knapsack sets to generate cuts for mixed integer polyhedral conic sets, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Theoretical challenges towards cutting-plane selection, Lifting two-integer knapsack inequalities, Valid inequalities for mixed-integer programmes with fixed charges on sets of variables, A computational analysis of lower bounds for big bucket production planning problems, Lifting for the integer knapsack cover polyhedron, Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems, \(n\)-step mingling inequalities: new facets for the mixed-integer knapsack set, A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting, An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable, A Noncompact Formulation for Job-Shop Scheduling Problems in Traffic Management, Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable, The multi-item capacitated lot-sizing problem with setup times and shortage costs, On the relative strength of different generalizations of split cuts, Multi-commodity variable upper bound flow models, Facets for continuous multi-mixing set with general coefficients and bounded integer variables, Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets, Polyhedral properties for the intersection of two knapsacks, Mingling: mixed-integer rounding with bounds, Cutting planes in integer and mixed integer programming, Maximizing a class of submodular utility functions, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Flow pack facets of the single node fixed-charge flow polytope, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, The newsvendor problem with capacitated suppliers and quantity discounts, Description of 2-integer continuous knapsack polyhedra, Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable, Least-Cost Influence Maximization on Social Networks, Models and methods for capacitated lot-sizing problems, On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra, Sequence independent lifting for a set of submodular maximization problems, Sequence independent lifting for mixed integer programs with variable upper bounds, Lifting for mixed integer programs with variable upper bounds, A polyhedral approach to least cost influence maximization in social networks, Cover and pack inequalities for (mixed) integer programming, Continuous knapsack sets with divisible capacities
