906 search results - page 4 / 182 » Chain Dominated Orders |
JCO
2008
14 years 9 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...
100
click to vote
FCS
2009
14 years 7 months ago
2009
A set S V is a dominating set of a graph G = (V; E) if each vertex in V is either in S or is adjacent to a vertex in S. A vertex is said to dominate itself and all its neighbors. ...
WSC
2007
14 years 11 months ago
2007
In this paper we study a decentralized distribution supply chain with one supplier and many newsvendor-type retailers that face exogenous end-customer demands. Using total supply ...
ORDER
2007
14 years 9 months ago
2007
On-line chain partitioning problem of on-line posets has been open for the past 20 years. The best known on-line algorithm uses 5w −1 4 chains to cover poset of width w. Felsner ...
EOR
2007
14 years 9 months ago
2007
One approach to supply chain coordination is early order commitment, whereby a retailer commits to purchase a fixedorder quantity at a fixed delivery time before demand uncertai...