Some properties of cliques in 0-1 mixed integer programs

DOI10.1007/BF02568509zbMath0887.90137OpenAlexW1965264455MaRDI QIDQ1367871

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

Publication date: 6 May 1998

Published in: Top (Search for Journal in Brave)

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

zbMATH Keywords

redundancycliquesconstraintsknapsackpreprocessing

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Uses Software

• MINTO

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Degree-two Inequalities, Clique Facets, and Biperfect Graphs
• Solving Large-Scale Zero-One Linear Programming Problems
• Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Preprocessing and Probing Techniques for Mixed Integer Programming Problems
• On the facial structure of set packing polyhedra