Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds

DOI10.1016/0167-6377(90)90034-3MaRDI QIDQ914548zbMATH OpenOpenAlexFDO

Authors Brenda L. Dietrich, Laureano F. 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

zbMATH Keywords

heuristicsubset sum problemtwo types of variables

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09)

Recommendations

• Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
• On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems
• Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
• Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
• Linear programming for the \(0-1\) quadratic knapsack problem

Cites work

• A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
• Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
• New Procedures For Preprocessing 0–1 Models With Knapsack-Like Constraints And Conjunctive And/Or Disjunctive Variable Upper Bounds
• S3 sets. An extension of the Beale-Tomlin special ordered sets
• Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
• Solving Large-Scale Zero-One Linear Programming Problems

Cited in

(13)

• Some of my favorite integer programming applications at IBM
• 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
• Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts
• Efficient reformulation for 0-1 programs -- methods and computational results
• scientific article; zbMATH DE number 4185395 (Why is no real title available?)
• Heuristics and reduction methods for multiple constraints 0-1 linear programming problems
• Covering linear programming with violations
• New Procedures For Preprocessing 0–1 Models With Knapsack-Like Constraints And Conjunctive And/Or Disjunctive Variable Upper Bounds
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Supernode processing of mixed-integer models
• A conditional logic approach for strengthening mixed 0-1 linear programs

This page was built for publication: Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds

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