Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables

DOI10.1287/OPRE.29.1.49MaRDI QIDQ3899820zbMATH OpenOpenAlexFDO

Authors Monique Guignard, Kurt Spielberg

Publication date 1981

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.29.1.49

zbMATH Keywords

algorithmslarge scale problemslogical reduction methodsminimal preferred variableszero- one enumeration code

Mathematics Subject Classification ID

Boolean programming (90C09)

Cited in

(32)

• On identifying dominant cliques.
• An homage to Joseph-Louis Lagrange and Pierre Huard
• IP over 40+ years at IBM scientific centers and marketing
• Mixed integer programming: A historical perspective with Xpress-MP
• Uniquely solvable quadratic Boolean equations
• A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
• Progress in presolving for mixed integer programming
• Computational aspects of infeasibility analysis in mixed integer programming
• Two-row and two-column mixed-integer presolve using hashing-based pairing methods
• Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
• Integer-programming software systems
• BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
• \(O(n \log n)\) procedures for tightening cover inequalities
• Generalized resolution for 0--1 linear inequalities
• Efficient reformulation for 0-1 programs -- methods and computational results
• Model tightening for integrated timber harvest and transportation planning
• Detecting constraint redundancy in 0-1 linear programming problems
• \(O(n)\) procedures for identifying maximal cliques and non-dominated extensions of consecutive minimal covers and alternates
• A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
• Mixed integer linear programming formulation techniques
• Conflict graphs in solving integer programming problems
• Binary integer programs with two variables per inequality
• Presolve Reductions in Mixed Integer Programming
• The multidimensional 0-1 knapsack problem: an overview.
• On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
• Supernode processing of mixed-integer models
• Domain reduction techniques for global NLP and MINLP optimization
• Some properties of cliques in 0-1 mixed integer programs
• Logical processing for integer programming
• Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem

This page was built for publication: Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables

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