On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs

DOI10.1007/BF02568605zbMath0855.90091OpenAlexW1982517620MaRDI QIDQ1814812

Gloria Pérez, María Araceli Garín, Laureano Fernando Escudero Bueno

Publication date: 24 November 1996

Published in: Top (Search for Journal in Brave)

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

zbMATH Keywords

infeasibility0-1 mixed integer programsknapsack constraint redundancy

Mathematics Subject Classification ID

Mixed integer programming (90C11) Boolean programming (90C09)

Related Items

Identifying redundancy in multi-dimensional knapsack constraints based on surrogate constraints, On identifying dominant cliques.

Uses Software

• MINTO

Cites Work

• Unnamed Item
• Strong formulations for mixed integer programming: A survey
• On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
• MINTO, a Mixed INTeger Optimizer
• 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
• A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
• Solving Large-Scale Zero-One Linear Programming Problems
• Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
• Technical Note—A Note on Zero-One Programming
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems