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/0020739890200418zbMATH Open0679.90044OpenAlexW2074971537MaRDI QIDQ4729613FDOQ4729613

Authors: 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

Recommendations

• A sequential aggregation algorithm for the set partitioning problem
• Optimal Set Partitioning
• A Multiplier Adjustment Approach for the Set Partitioning Problem
• scientific article; zbMATH DE number 1559404
• scientific article; zbMATH DE number 3989105

zbMATH Keywords

aggregationset partitioningcomputational resultsproblem size estimation

Mathematics Subject Classification ID

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

Cites Work

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

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

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