Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
From MaRDI portal
Publication:914548
DOI10.1016/0167-6377(90)90034-3zbMath0701.90063OpenAlexW2082335375MaRDI QIDQ914548
Brenda L. Dietrich, Laureano Fernando Escudero Bueno
Publication date: 1990
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(90)90034-3
Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (10)
Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts ⋮ Supernode processing of mixed-integer models ⋮ Covering Linear Programming with Violations ⋮ On some extended mixed integer optimization models of the Eisenberg–Noe model in systemic risk management ⋮ Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds ⋮ On tightening cover induced inequalities ⋮ Some of my favorite integer programming applications at IBM ⋮ Efficient reformulation for 0-1 programs -- methods and computational results ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects ⋮ A conditional logic approach for strengthening mixed 0-1 linear programs
Cites Work
- Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
- S3 sets. An extension of the Beale-Tomlin special ordered sets
- New Procedures For Preprocessing 0–1 Models With Knapsack-Like Constraints And Conjunctive And/Or Disjunctive Variable Upper Bounds
- A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
- Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
- Solving Large-Scale Zero-One Linear Programming Problems
This page was built for publication: Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
