3016 search results - page 19 / 604 » The Online Transportation Problem |
COMBINATORICA
2006
13 years 7 months ago
2006
We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of any m
MFCS
1994
Springer
13 years 11 months ago
1994
Springer
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
ORL
2007
13 years 7 months ago
2007
We analyze a simple and natural on-line algorithm (dispatch policy) for a dynamic multiperiod uncapacitated routing problem, in which at the beginning of each time period a set of...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
IPMI
2003
Springer
14 years 8 months ago
2003
Springer
Abstract. We propose a learning method which introduces explicit knowledge to the object correspondence problem. Our approach uses an a priori learning set to compute a dense corre...