A note for tightening 0-1 models

DOI10.1007/BF02628561zbMath0984.90024OpenAlexW2008146407MaRDI QIDQ5937145

Susana Muñoz, Laureano Fernando Escudero Bueno

Publication date: 7 May 2002

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02628561

zbMATH Keywords

coversredundancycliquesequivalencyprogram model tighteningtighter formulations

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Boolean programming (90C09)

Cites Work

• On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
• Efficient reformulation for 0-1 programs -- methods and computational results
• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates

This page was built for publication: A note for tightening 0-1 models