A Class of Hard Small 0-1 Programs

DOI10.1287/IJOC.11.2.205MaRDI QIDQ4427377zbMATH OpenOpenAlexFDO

Authors Gérard Cornuéjols, Milind 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

Mathematics Subject Classification ID

Boolean programming (90C09)

Cited in

(15)

• MILP models for the selection of a small set of well-distributed points
• Column basis reduction and decomposable knapsack problems
• Cutting plane algorithms for \(0-1\) programming based on cardinality cuts
• Lattice based extended formulations for integer linear equality systems
• Theoretical challenges towards cutting-plane selection
• Solving market split problems with heuristical lattice reduction
• A study of lattice reformulations for integer programming
• A mathematical programming approach to the computation of the omega invariant of a numerical semigroup
• Modelling either-or relations in integer programming
• On the structure of reduced kernel lattice bases
• Aggregation-based cutting-planes for packing and covering integer programs
• Sparse recovery with integrality constraints
• Counting Solutions of Knapsack Constraints
• Decision Diagram Decomposition for Quadratically Constrained Binary Optimization
• On the consistent path problem

This page was built for publication: A Class of Hard Small 0-1 Programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4427377)