Aggregation in large-scale optimization
From MaRDI portal
Publication:1412415
zbMath1029.90042MaRDI QIDQ1412415
Vladimir I. Tsurkov, Igor S. Litvinchev
Publication date: 25 November 2003
Published in: Applied Optimization (Search for Journal in Brave)
Large-scale problems in mathematical programming (90C06) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (11)
Using error bounds to compare aggregated generalized transportation models ⋮ Convex aggregative modelling of infinite memory nonlinear systems ⋮ An aggregate and iterative disaggregate algorithm with proven optimality in machine learning ⋮ Adaptive Partition-Based Level Decomposition Methods for Solving Two-Stage Stochastic Programs with Fixed Recourse ⋮ Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting ⋮ LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity ⋮ A Lagrangian bound for many-to-many assignment problems ⋮ A computational tool for optimizing the urban public transport: A real application ⋮ On the asymptotic aggregation of high dimensional systems ⋮ Solving network design problems via iterative aggregation ⋮ Optimization for L1-Norm Error Fitting via Data Aggregation
This page was built for publication: Aggregation in large-scale optimization