Send-and-split method for minimum-concave-cost network flows

Quartic Barriers

Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part I

A branch-and-price algorithm for the Steiner tree packing problem

Computers and Operations Research

A Pseudo-Polynomial Primal-Dual Algorithm for Globally Solving aProduction-Transportation Problem

Journal of Global Optimization

Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks

Journal of Global Optimization

Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation

Multicast Routing by Multiple Tree Routes

QoS-IP '01 Proceedings of the International Workshop on Quality of Service in Multiservice IP Networks

Selecting Problems for Algorithm Evaluation

WAE '99 Proceedings of the 3rd International Workshop on Algorithm Engineering

A polynomial-time approximation scheme for Steiner tree in planar graphs

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms

An O(n log n) approximation scheme for Steiner tree in planar graphs

ACM Transactions on Algorithms (TALG)

Minimal-cost network flow problems with variable lower bounds on arc flows

Computers and Operations Research

Dealing with large hidden constants: engineering a planar steiner tree PTAS

Journal of Experimental Algorithmics (JEA)

Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth

Journal of the ACM (JACM)

Faster algorithm for optimum Steiner trees

Information Processing Letters

A polynomial-time approximation scheme for planar multiway cut

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

A simplex algorithm for a class of leontief flow problems

Mathematical and Computer Modelling: An International Journal

The complexity of welfare maximization in congestion games

Networks

Steiner trees with n terminals among n + 1 nodes

Operations Research Letters

On finding two-connected subgraphs in planar graphs

Operations Research Letters

k-edge connected polyhedra on series-parallel graphs

Operations Research Letters

Improved Steiner tree algorithms for bounded treewidth

Journal of Discrete Algorithms

Steiner tree in planar graphs: an O(n log n) approximation scheme with singly-exponential dependence on epsilon

WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures

A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing

Annals of Mathematics and Artificial Intelligence