Detecting constraint redundancy in 0-1 linear programming problems
type: Item
instance of: scholarly article
title: Detecting constraint redundancy in 0-1 linear programming problems
author: S. Muñoz
published in: Revista de Matemática: Teoría y Aplicaciones
publication date: 2024-09-03T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 7905634
zbMATH Keywords: redundant constraints
zbMATH Keywords: packings
zbMATH Keywords: coverings
zbMATH Keywords: special ordered sets
zbMATH Keywords: admissible families
MaRDI profile type: Publication
cites work: Conflict graphs in solving integer programming problems
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
cites work: On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
cites work: Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
cites work: Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
cites work: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
cites work: Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
cites work: 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
cites work: Q4040221
cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems
DOI: 10.15517/RMTA.V8I1.193
description: scientific article; zbMATH DE number 7905634