Cutting plane algorithms for 0-1 programming based on cardinality cuts

DOI10.1016/J.EJOR.2010.01.006zbMATH Open1188.90173OpenAlexW2137740214MaRDI QIDQ976440FDOQ976440

Osman Oguz

Publication date: 11 June 2010

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.01.006

Recommendations

• Cutting planes in integer and mixed integer programming
• scientific article; zbMATH DE number 1953199
• Solving \(0/1\) integer programs with enumeration cutting planes
• On cutting planes for cardinality-constrained linear programs
• scientific article; zbMATH DE number 1094766

zbMATH Keywords

cutting planesvalid inequalities\(0-1\) integer programming

Mathematics Subject Classification ID

Boolean programming (90C09)

Cites Work

• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Outline of an algorithm for integer solutions to linear programs
• Solving Large-Scale Zero-One Linear Programming Problems
• Title not available (Why is that?)
• Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
• A Class of Hard Small 0-1 Programs
• Solving Multiple Knapsack Problems by Cutting Planes

Cited In (3)

• Spherical cuts for integer programming problems
• Solving \(0/1\) integer programs with enumeration cutting planes
• Title not available (Why is that?)

Uses Software

• OR-Library

This page was built for publication: Cutting plane algorithms for \(0-1\) programming based on cardinality cuts

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