Using error bounds to compare aggregated generalized transportation models

DOI10.1007/s10479-006-0051-6zbMath1106.90015OpenAlexW2021744948MaRDI QIDQ863575

Socorro Rangel, Igor S. Litvinchev

Publication date: 5 February 2007

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-006-0051-6

zbMATH Keywords

clusteringapproximation algorithmsnetwork models

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (1)

A computational tool for optimizing the urban public transport: A real application

Uses Software

• NETGEN

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving large-scale linear programs by aggregation
• Solving large scale generalized assignment problems. --- An aggregation/disaggregation approach
• Localization of the optimal solution and a posteriori bounds for aggregation
• Error bound comparisons for aggregation/disaggregation techniques applied to the transportation problem
• A posteriori error bounds in linear programming aggregation
• Aggregation in large-scale optimization
• Aggregation and Disaggregation Techniques and Methodology in Optimization
• Bounds on the Effect of Aggregating Variables in Linear Programs
• Bounds for aggregating nodes in network problems
• Technical Note—Improved Bounds for Aggregated Linear Programs
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems

This page was built for publication: Using error bounds to compare aggregated generalized transportation models