Technical Note—Solving Integer Programming Problems by Aggregating Constraints

DOI10.1287/OPRE.25.2.346MaRDI QIDQ4162970zbMATH OpenOpenAlexFDO

Authors Kenneth E. Kendall, Stanley Zionts

Publication date 1977

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.25.2.346

Mathematics Subject Classification ID

Integer programming (90C10)

Cited in

(13)

• On aggregating two linear diophantine equations
• A discrete variant of Farkas' lemma
• A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems
• A result in surrogate duality for certain integer programming problems
• Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming
• New results on equivalent integer programming formulations
• How effective is aggregation for solving 0-1 models?
• A recurrence relation for estimating the size of set partitioning problem that can be completely aggregated on a given computer, using Kendall and Zionts aggregation scheme
• Optimal constraints aggregation method for ILP
• Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations
• A solution method for a knapsack problem and its variant
• Aggregation of constraints in integer programming
• On the reduction method for integer linear programs. II

This page was built for publication: Technical Note—Solving Integer Programming Problems by Aggregating Constraints

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