Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
type: Item
instance of: scholarly article
title: Coefficient reduction for knapsack-like constraints in 0-1 programs with variable upper bounds
zbMATH Open document ID: 0701.90063
DOI: 10.1016/0167-6377(90)90034-3
published in: Operations Research Letters
publication date: 1990-01-01T00:00:00Z
review text: The authors consider a 0-1 programming problem with two types of variables, selection variables and bounding ones. The first variables describe the content of the problem and the second ones describe resource restrictions. The authors propose two heuristic methods for reducing the values of the bounding variables which is not permitted in previously known methods. The two methods are based on a solution of a special subset sum problem.
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90-08
zbMATH DE Number: 4149890
zbMATH Keywords: two types of variables
zbMATH Keywords: heuristic
zbMATH Keywords: subset sum problem
author: Brenda L. Dietrich
author: Laureano F. Escudero Bueno
reviewed by: M. A. Frumkin
MaRDI profile type: Publication
full work available at URL: 0167-6377(90)90034-3
OpenAlex ID: W2082335375
cites work: Solving Large-Scale Zero-One Linear Programming Problems
cites work: New Procedures For Preprocessing 0–1 Models With Knapsack-Like Constraints And Conjunctive And/Or Disjunctive Variable Upper Bounds
cites work: S3 sets. An extension of the Beale-Tomlin special ordered sets
cites work: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models
cites work: A Mixture of Dynamic Programming and Branch-and-Bound for the Subset-Sum Problem
description: scientific article; zbMATH DE number 4149890