Generalized networks: The theory of preprocessing and an empirical analysis

Generalized networks: The theory of preprocessing and an empirical analysis

0.00 Avg rating0 Votes
Article ID: iaor20063650
Country: United States
Volume: 16
Issue: 2
Start Page Number: 162
End Page Number: 173
Publication Date: Mar 2004
Journal: INFORMS Journal On Computing
Authors: ,
Abstract:

The idea of preprocessing a linear program with the goal of eliminating constraints or columns is well established. The default setting for CPLEX is to apply preprocessing prior to application of any of its four solvers. In this investigation, a set of preprocessing procedures is developed for the special case of a generalized network flow problem. Some procedures involve adding or replacing arcs to eliminate a node. These procedures all produce an optimal basic feasible solution and optimal dual solution to the original problem. In an empirical analysis, our generalized network preprocessor ran approximately seven times faster than the CPLEX 6.5.3 preprocessor, resulting in an overall solution time reduction of over 20%.

Reviews

Required fields are marked *. Your email address will not be published.