A Class of Hard Small 0-1 Programs
From MaRDI portal
Publication:4427377
DOI10.1287/ijoc.11.2.205zbMath1040.90534OpenAlexW2156485162MaRDI QIDQ4427377
Cornuéjols, Gérard, Milind W. Dawande
Publication date: 1999
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.11.2.205
Related Items
Column basis reduction and decomposable knapsack problems, Lattice based extended formulations for integer linear equality systems, Theoretical challenges towards cutting-plane selection, A study of lattice reformulations for integer programming, Sparse recovery with integrality constraints, A mathematical programming approach to the computation of the omega invariant of a numerical semigroup, Counting Solutions of Knapsack Constraints, MILP models for the selection of a small set of well-distributed points, On the Consistent Path Problem, Solving market split problems with heuristical lattice reduction, Cutting plane algorithms for \(0-1\) programming based on cardinality cuts, Aggregation-based cutting-planes for packing and covering integer programs, Modelling either-or relations in integer programming, On the Structure of Reduced Kernel Lattice Bases, Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
