ORL 2007 - PDF Preprint Papers

ORL 2007

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ORL-2007 Paper

click to vote

ORL
2007

112views more ORL 2007»

Competitive analysis of a dispatch policy for a dynamic multi-period routing problem

12 years 2 months ago

Download www2.isye.gatech.edu

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...

Enrico Angelelli, Martin W. P. Savelsbergh, Maria ...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	112	Competitive analysis of a dispatch policy for a dynamic multi-period routing problem	claim
2	108	Convergence properties of the cross-entropy method for discrete optimization	claim
3	102	Using critical sets to solve the maximum independent set problem	claim
4	97	Analysis on the forward market equilibrium model	claim
5	96	A note on scenario reduction for two-stage stochastic programs	claim
6	86	Complexity of two dual criteria scheduling problems	claim
7	84	The price of anarchy in an exponential multi-server	claim
8	83	Large deviations bounds for estimating conditional value-at-risk	claim
9	82	The path partition problem and related problems in bipartite graphs	claim
10	81	An improved probability bound for the Approximate S-Lemma	claim
11	80	Explicit formulas for the variance of conditioned sojourn times in M/D/1-PS	claim
12	75	Approximation algorithms for scheduling problems with a modified total weighted tardiness objective	claim
13	72	Colorings of k-balanced matrices and integer decomposition property of related polyhedra	claim
14	70	Linear dependence of stationary distributions in ergodic Markov decision processes	claim
15	66	Linear programming with online learning	claim
16	66	On polling systems with large setups	claim
17	64	Robust portfolio selection with uncertain exit time using worst-case VaR strategy	claim
18	62	A constructive characterization of the split closure of a mixed integer linear program	claim
19	61	Exact solutions to linear programming problems	claim
20	54	A new lower bound for the non-oriented two-dimensional bin-packing problem	claim
21	54	Stationary remaining service time conditional on queue length	claim
22	52	Locality of reference and the use of sojourn time variance for measuring queue unfairness	claim
23	51	An exact algorithm for MAX-CUT in sparse graphs	claim
24	50	NP-Hardness of checking the unichain condition in average cost MDPs	claim
25	49	Lot sizing with inventory gains	claim
26	48	Remarks on the remaining service time upon reaching a target level in the M/G/1 queue	claim
27	47	A simpler and better derandomization of an approximation algorithm for single source rent-or-buy	claim
28	47	A new exact method for the two-dimensional bin-packing problem with fixed orientation	claim
29	46	Duality in option pricing based on prices of other derivatives	claim
30	46	Global bounds for the distance to solutions of co-coercive variational inequalities	claim
31	41	A note on scheduling to meet two min-sum objectives	claim
32	40	Exact solution to a Lindley-type equation on a bounded support	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers