An enumerative procedure for identifying maximal covers

DOI10.15517/RMTA.V10I1-2.233MaRDI QIDQ6974455zbMATH OpenFDO

Authors S. Muñoz

Publication date 6 June 2025

Published in Revista de Matemática: Teoría y Aplicaciones (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15517/RMTA.V10I1-2.233

zbMATH Keywords

dominated inequalitiesknapsack constraintsmaximal coverstighter formulations

Mathematics Subject Classification ID

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

Cites work

• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
• A correction of the justification of the Dietrich-Escudero-Garín-Pérez O(n) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
• scientific article; zbMATH DE number 1102774 (Why is no real title available?)
• scientific article; zbMATH DE number 2108946 (Why is no real title available?)
• scientific article; zbMATH DE number 274399 (Why is no real title available?)
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition

This page was built for publication: An enumerative procedure for identifying maximal covers

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