Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables
From MaRDI portal
Publication:3899820
DOI10.1287/opre.29.1.49zbMath0452.90044OpenAlexW2025061866MaRDI 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
algorithmslarge scale problemslogical reduction methodsminimal preferred variableszero- one enumeration code
Related Items
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, A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities, Binary integer programs with two variables per inequality, Some properties of cliques in 0-1 mixed integer programs, \(O(n \log n)\) procedures for tightening cover inequalities, A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems, Progress in presolving for mixed integer programming, Domain reduction techniques for global NLP and MINLP optimization, BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs., Two-row and two-column mixed-integer presolve using hashing-based pairing methods, The multidimensional 0-1 knapsack problem: an overview., Conflict graphs in solving integer programming problems, A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem, Mixed integer programming: A historical perspective with Xpress-MP, An homage to Joseph-Louis Lagrange and Pierre Huard, IP over 40+ years at IBM scientific centers and marketing, Mixed Integer Linear Programming Formulation Techniques, 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., Presolve Reductions in Mixed Integer Programming, On using clique overlapping for detecting knapsack constraint redundancy and infeasibility in 0-1 mixed integer programs, Computational aspects of infeasibility analysis in mixed integer programming, Uniquely solvable quadratic Boolean equations, 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
