Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
From MaRDI portal
Publication:3686428
DOI10.1287/OPRE.33.4.803zbMath0569.90056OpenAlexW2103263531MaRDI QIDQ3686428
Uwe H. Suhl, Ellis L. Johnson, Michael M. Kostreva
Publication date: 1985
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/3869fb76dbecf249a1a794b49b103aaf8a73706c
Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Boolean programming (90C09)
Related Items (41)
An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem ⋮ Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts ⋮ Representability in mixed integer programming. I: Characterization results ⋮ Supernode processing of mixed-integer models ⋮ Generalized resolution for 0--1 linear inequalities ⋮ S3 sets. An extension of the Beale-Tomlin special ordered sets ⋮ Strategies for LP-based solving a general class of scheduling problems ⋮ A binary integer linear program with multi-criteria and multi-constraint levels ⋮ A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems ⋮ Solving mixed integer programming production planning problems with setups by shadow price information. ⋮ A solution procedure for general knapsack problems with a few constraints ⋮ The generalized assignment problem: Valid inequalities and facets ⋮ Facet defining inequalities for the dichotomous knapsack problem ⋮ Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds ⋮ A production planning problem in FMS ⋮ Modeling and integer programming techniques applied to propositional calculus ⋮ Generating cuts in integer programming with families of special ordered sets ⋮ Measuring the impact of primal heuristics ⋮ Generalized cover facet inequalities for the generalized assignment problem ⋮ On tightening cover induced inequalities ⋮ Polylithic modeling and solution approaches using algebraic modeling systems ⋮ My experiences as a student and researcher in OR during the 1960's and 70's ⋮ IP over 40+ years at IBM scientific centers and marketing ⋮ Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem ⋮ Combinatorial optimization in Nash games ⋮ 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 ⋮ Using cutting planes in an interactive reference point approach for multiobjective integer linear programming problems ⋮ Valid inequalities and facets of the capacitated plant location problem ⋮ A Branch-and-Cut Approach for the Minimum-Energy Broadcasting Problem in Wireless Networks ⋮ Large-scale 0-1 linear programming on distributed workstations ⋮ Facets and algorithms for capacitated lot sizing ⋮ Optimal scrap combination for steel production ⋮ Cutting planes for mixed-integer knapsack polyhedra ⋮ A note on modeling multiple choice requirements for simple mixed integer programming solvers ⋮ Strong bounds for resource constrained project scheduling: preprocessing and cutting planes ⋮ Solving large-scale mixed-integer programs with fixed charge variables ⋮ A technique for speeding up the solution of the Lagrangean dual ⋮ A facet generation and relaxation technique applied to an assignment problem with side constraints ⋮ A conditional logic approach for strengthening mixed 0-1 linear programs ⋮ Logical processing for integer programming
This page was built for publication: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
