On the facets of the mixed-integer knapsack polyhedron
From MaRDI portal
Publication:1424283
DOI10.1007/s10107-003-0400-zzbMath1082.90073OpenAlexW1549174816MaRDI QIDQ1424283
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0400-z
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Knapsack polytopes: a survey, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, DASH: dynamic approach for switching heuristics, Binary extended formulations of polyhedral mixed-integer sets, Theoretical challenges towards cutting-plane selection, Lifting two-integer knapsack inequalities, A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation, Lifting for conic mixed-integer programming, Chance-constrained optimization under limited distributional information: a review of reformulations based on sampling and distributional robustness, \(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, The splittable flow arc set with capacity and minimum load constraints, Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable, Approximate and exact merging of knapsack constraints with cover inequalities, On the strength of Gomory mixed-integer cuts as group cuts, How tight is the corner relaxation?, Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem, Supermodular covering knapsack polytope, Facets for continuous multi-mixing set with general coefficients and bounded integer variables, Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets, Mingling: mixed-integer rounding with bounds, On the exact separation of mixed integer knapsack cuts, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, SCIP: solving constraint integer programs, Lifting convex inequalities for bipartite bilinear programs, Lifting convex inequalities for bipartite bilinear programs, On cut-based inequalities for capacitated network design polyhedra, Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable, Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs, A directed cycle-based column-and-cut generation method for capacitated survivable network design, The submodular knapsack polytope, Cover and pack inequalities for (mixed) integer programming, Integer-programming software systems, Continuous knapsack sets with divisible capacities
Uses Software
