Network Flows Heuristics for Complementary Cell Suppression: An Empirical Evaluation and Extensions
Inference Control in Statistical Databases, From Theory to Practice
A Parallel Implementation of an Interior-Point Algorithm for Multicommodity Network Flows
VECPAR '00 Selected Papers and Invited Talks from the 4th International Conference on Vector and Parallel Processing
An Augmented Lagrangian Algorithm for Large Scale Multicommodity Routing
Computational Optimization and Applications
Prim-based support-graph preconditioners for min-cost flow problems
Computational Optimization and Applications
A Computational Study of Cost Reoptimization for Min-Cost Flow Problems
INFORMS Journal on Computing
Computation of approximate α-points for large scale single machine scheduling problem
Computers and Operations Research
Experiments with a hybrid interior point/combinatorial approach for network flow problems
Optimization Methods & Software
Non-smoothness in classification problems
Optimization Methods & Software - THE JOINT EUROPT-OMS CONFERENCE ON OPTIMIZATION, 4-7 JULY, 2007, PRAGUE, CZECH REPUBLIC, PART I
Lower and upper bounds for a capacitated plant location problem with multicommodity flow
Computers and Operations Research
Computers and Operations Research
Optimal joint routing and link scheduling for real-time traffic in TDMA Wireless Mesh Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We present a Cost Decomposition approach for the linear Multicommodity Min-Cost Flow problem, where the mutual capacity constraints are dualized and the resulting Lagrangean Dual is solved with a dual-ascent algorithm belonging to the class of Bundle methods. Although decomposition approaches to block-structured Linear Programs have been reported not to be competitive with general-purpose software, our extensive computational comparison shows that, when carefully implemented, a decomposition algorithm can outperform several other approaches, especially on problems where the number of commodities is "large" with respect to the size of the graph. Our specialized Bundle algorithm is characterized by a new heuristic for the trust region parameter handling, and embeds a specialized Quadratic Program solver that allows the efficient implementation of strategies for reducing the number of active Lagrangean variables. We also exploit the structural properties of the single-commodity Min-Cost Flow subproblems to reduce the overall computational cost. The proposed approach can be easily extended to handle variants of the problem.