A Facet Generation Procedure for Solving 0/1 Integer Programs

DOI10.1287/opre.47.5.789zbMath0980.90053OpenAlexW2107754789MaRDI QIDQ4950825

Wilbert E. Wilhelm, Gyana R. Parija, Radu Gadidov

Publication date: 15 July 2001

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bfddf864e350679de233cecb0c795cadc0fb515f

zbMATH Keywords

0/1 integer programsfacet generation procedurepolyhedral cutting plane methods

Mathematics Subject Classification ID

Boolean programming (90C09)

Related Items (2)

Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem ⋮ Partial convexification cuts for 0--1 mixed-integer programs

Uses Software

• MIPLIB

This page was built for publication: A Facet Generation Procedure for Solving 0/1 Integer Programs