Localization of the optimal solution and a posteriori bounds for aggregation

DOI10.1016/S0305-0548(99)00027-1zbMATH Open0940.90061OpenAlexW1989313155MaRDI QIDQ1304491FDOQ1304491

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

Recommendations

• A posteriori error bounds in linear programming aggregation
• scientific article; zbMATH DE number 4087417
• Bounds on the suboptimalization of aggregation in convex programming
• Aggregation and Disaggregation in Integer Programming Problems

zbMATH Keywords

aggregationlocalizationoptimal solutionposteriori bounds

Mathematics Subject Classification ID

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

Cited In (9)

• A global convergence theorem for aggregation algorithms
• Optimized packing multidimensional hyperspheres: a unified approach
• Title not available (Why is that?)
• Using error bounds to compare aggregated generalized transportation models
• Packing convex polygons in minimum-perimeter convex hulls
• Iterative variable aggregation and disaggregation in IP: an application
• Digital model of natural cores using geometric design
• A Lagrangian bound for many-to-many assignment problems
• Bounds on the suboptimalization of aggregation in convex programming

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

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