Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
From MaRDI portal
Publication:3899820
DOI10.1287/opre.29.1.49zbMath0452.90044MaRDI QIDQ3899820
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
algorithms; large scale problems; logical reduction methods; minimal preferred variables; zero- one enumeration code
90C09: Boolean programming
Related Items
The multidimensional 0-1 knapsack problem -- bounds and computational aspects, Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem, Integer-programming software systems, Logical processing for integer programming, Uniquely solvable quadratic Boolean equations, \(O(n \log n)\) procedures for tightening cover inequalities, Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts, Supernode processing of mixed-integer models, Generalized resolution for 0--1 linear inequalities, Binary integer programs with two variables per inequality, Some properties of cliques in 0-1 mixed integer programs, BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs., The multidimensional 0-1 knapsack problem: an overview., 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, Model tightening for integrated timber harvest and transportation planning, On identifying dominant cliques., On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs, Conflict graphs in solving integer programming problems, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
