Dual coordinate step methods for linear network flow problems
Mathematical Programming: Series A and B
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
Linear network optimization: algorithms and codes
Linear network optimization: algorithms and codes
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Interior point algorithms for network flow problems
Advances in linear and integer programming
An efficient implementation of a scaling minimum-cost flow algorithm
Journal of Algorithms
Vehicle scheduling in public transit and Lagrangean pricing
Management Science
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
INFORMS Journal on Computing
Prim-based support-graph preconditioners for min-cost flow problems
Computational Optimization and Applications
Experiments with a hybrid interior point/combinatorial approach for network flow problems
Optimization Methods & Software
Evacuation Route Planning Algorithm: Longer Route Preferential
ISNN '09 Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks
Updating Network Flows Given Multiple, Heterogeneous Arc Attribute Changes
Journal of Mathematical Modelling and Algorithms
Early P/G grid voltage integrity verification
Proceedings of the International Conference on Computer-Aided Design
A theory and algorithms for combinatorial reoptimization
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Bisimulation Metrics for Continuous Markov Decision Processes
SIAM Journal on Computing
| Hi-index | 0.00 |
In the last two decades, a number of algorithms for the linear single-commodity min-cost flow (MCF) problem have been proposed, and several efficient codes are available that implement different variants of the algorithms. The practical significance of the algorithms has been tested by comparing the time required by their implementations for solving from-scratch instances of MCF, of different classes, as the size of the problem (number of nodes and arcs) increases. However, in many applications several closely related instances of MCF have to be sequentially solved, so that reoptimization techniques can be used to speed up computations, and the most attractive algorithm is the one that minimizes the total time required to solve all the instances in the sequence. In this paper we compare the performances of four different efficient implementations of algorithms for MCF under cost reoptimization in the context of decomposition algorithms for the multicommodity min-cost flow (MMCF) problem, showing that for some classes of instances the relative performances of the codes doing from-scratch optimization do not accurately predict the relative performances when reoptimization is used. Because the best solver depends both on the class and on the size of the instance, this work also shows the usefulness of a standard interface for MCF problem solvers that we have proposed and implemented.