Solving nonlinear multicommodity flow problems by the analytic center cutting plane method

On Improvements to the Analytic Center Cutting Plane Method

Computational Optimization and Applications

Parallel Implementation of a Central Decomposition Method for Solving Large-Scale Planning Problems

Computational Optimization and Applications

A Computational Study of the Homogeneous Algorithm for Large-scale Convex Optimization

Computational Optimization and Applications

Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM

Operations Research

Enhancing the behavior of interior-point methods via identification of variables

Optimization Methods & Software

Using ACCPM in a simplicial decomposition algorithm for the traffic assignment problem

Computational Optimization and Applications

A bundle-type algorithm for routing in telecommunication data networks

Computational Optimization and Applications

An interior point cutting plane heuristic for mixed integer programming

Computers and Operations Research

Chebyshev center based column generation

Discrete Applied Mathematics

Specialized fast algorithms for IQC feasibility and optimization problems

Automatica (Journal of IFAC)

Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints

Operations Research Letters

Probability based dynamic-alternate routing and the corresponding converter placement algorithm in all-optical WDM networks

Computer Networks: The International Journal of Computer and Telecommunications Networking