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

DOI10.1080/0020739890200418zbMath0679.90044OpenAlexW2074971537MaRDI QIDQ4729613

Denis C. Onyekwelu

Publication date: 1989

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020739890200418

zbMATH Keywords

aggregationcomputational resultsset partitioningproblem size estimation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cites Work

• Technical Note—Computational Viability of a Constraint Aggregation Scheme for Integer Linear Programming Problems
• Technical Note—Solving Integer Programming Problems by Aggregating Constraints

This page was built for publication: 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