Dong X. Shaw

According to our database, Dong X. Shaw authored at least 8 papers between 1994 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2008

Lagrangian relaxation procedure for cardinality-constrained portfolio optimization.

Dong X. Shaw, Shucheng Liu, Leonid Kopman

Optim. Methods Softw., 2008

1999

A unified limited column generation approach for facility location problems ontrees.

Dong X. Shaw

Ann. Oper. Res., 1999

1998

The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem.

Dong X. Shaw, Geon Cho

Networks, 1998

1997

A depth-first dynamic programming procedure for the extended tree knapsack problem in local access network design.

Dong X. Shaw, Geon Cho, Hsuliang Chang

Telecommun. Syst., 1997

A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem.

Geon Cho, Dong X. Shaw

INFORMS J. Comput., 1997

An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks.

Geon Cho, Dong X. Shaw, Seong-Lyun Kim

Comput. Oper. Res., 1997

1995

On the Complexity of a Class of Projective Interior Point Methods.

Donald Goldfarb, Dong X. Shaw

Math. Oper. Res., 1995

1994

A Path-Following Projective Interior Point Method for Linear Programming.

Dong X. Shaw, Donald Goldfarb

SIAM J. Optim., 1994