This article considers the error induced when the nodes of a large convex-cost network problem are aggregated to form a smaller problem.

This article considers the error induced when the nodes of a large convex-cost network problem are aggregated to form a smaller problem.

Aggregation, disaggregation and decomposition methods in traffic assignment: historical perspectives and new trends. 2020, Transportation Research Part B ...

Aggregation-disaggregation techniques provide a number of methods for handling large optimization problems by: a) combining data, b) using auxiliary (aggregated) ...

We develop an a posteriori error bound on error induced by aggregating subsets of sources or sinks in generalized transportation problems.

These bounds may be useful in nodes evaluation in a Branch and Bound algorithm to find the optimal solution of large-scale integer linear programming problems.

We study mixed-integer programming formulations, based upon variable disag- gregation, for generic multi-commodity network flow problems with non-convex.

disaggregation problems are pure network problems, and this also speeds up the overall solution time. 4.2.1 Example ProblemN. Aggregation by mode applied to ...

In this paper we provide a recursive procedure to solve such problems. The method differs from classical optimization algorithms of convex programming in that ...

aggregation and disaggregation is proposed and ana- lyzed for box-constrained minimization problems. In a variation of the distributed computation model ...