Shaw Dong X.

Dong X. Shaw

Information about the author Dong X. Shaw will soon be added to the site.
Found 5 papers in total
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
1998
The tree knapsack problem (TKP) is a generalized 0–1 knapsack problem where all...
A unified limited column generation approach for facility location problems on trees
A unified limited column generation approach for facility location problems on trees
1999
In this paper, we show that several well-known facility location problems on trees,...
An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
An algorithm for single-item capacitated economic lot sizing with piecewise linear production costs and general holding costs
1998
We consider the Capacitated Economic Lot Size Problem with piecewise linear production...
A depth-first dynamic programming algorithm for the Tree Knapsack Problem
A depth-first dynamic programming algorithm for the Tree Knapsack Problem
1997
The Tree Knapsack Problem (TKP) can be regarded as a 0–1 knapsack problem on a...
An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks
1997
Given a rooted tree T with node profits and node demands, the capacitated subtree of a...
Papers per page: