Localization of the optimal solution and a posteriori bounds for aggregation

DOI10.1016/S0305-0548(99)00027-1zbMath0940.90061OpenAlexW1989313155MaRDI QIDQ1304491

Igor S. Litvinchev, Socorro Rangel

Publication date: 27 July 2000

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(99)00027-1

zbMATH Keywords

aggregationlocalizationoptimal solutionposteriori bounds

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Operations research and management science (90B99)

Related Items (6)

Iterative variable aggregation and disaggregation in IP: an application ⋮ Using error bounds to compare aggregated generalized transportation models ⋮ Packing convex polygons in minimum-perimeter convex hulls ⋮ Digital model of natural cores using geometric design ⋮ Optimized packing multidimensional hyperspheres: a unified approach ⋮ A Lagrangian bound for many-to-many assignment problems

This page was built for publication: Localization of the optimal solution and a posteriori bounds for aggregation