Sciweavers

Share
ORL
2008
87views more  ORL 2008»
9 years 6 months ago
On-line scheduling with non-crossing constraints
We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristi...
Lele Zhang, Kwanniti Khammuang, Andrew Wirth
ORL
2008
106views more  ORL 2008»
9 years 7 months ago
Computing shortest heterochromatic monotone routes
José Miguel Díaz-Báñez...
ORL
2008
115views more  ORL 2008»
9 years 7 months ago
On the convergence of stochastic dual dynamic programming and related methods
We discuss the almost-sure convergence of a broad class of sampling algorithms for multi-stage stochastic linear programs. We provide a convergence proof based on the finiteness o...
Andrew B. Philpott, Z. Guan
ORL
2008
86views more  ORL 2008»
9 years 7 months ago
Searching the k-change neighborhood for TSP is W[1]-hard
We show that searching the k-change neighborhood is W[1]-hard for metric TSP, which means that finding the best tour in the k-change neighborhood essentially requires complete sea...
Dániel Marx
ORL
2008
108views more  ORL 2008»
9 years 8 months ago
Mechanism design for a multicommodity flow game in service network alliances
We study a collaborative multicommodity flow game where individual players own capacity on the edges of the network and share this capacity to deliver commodities. We present memb...
Richa Agarwal, Özlem Ergun
ORL
2008
91views more  ORL 2008»
9 years 8 months ago
On the integrality ratio for tree augmentation
We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches 3 2 . This refutes a conjec...
Joseph Cheriyan, Howard J. Karloff, Rohit Khandeka...
ORL
2008
68views more  ORL 2008»
9 years 8 months ago
On polynomial cases of the unichain classification problem for Markov Decision Processes
The unichain classification problem detects whether a finite state and action MDP is unichain under all deterministic policies. This problem is NP-hard [11]. This paper provides p...
Eugene A. Feinberg, Fenghsu Yang
ORL
2008
115views more  ORL 2008»
9 years 8 months ago
Maximum algebraic connectivity augmentation is NP-hard
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
Damon Mosk-Aoyama
ORL
2008
86views more  ORL 2008»
9 years 8 months ago
A redundant Klee-Minty construction with all the redundant constraints touching the feasible region
By introducing some redundant Klee-Minty constructions, we have previously shown that the central path may visit every vertex of the Klee-Minty cube having 2n - 2 "sharp"...
Eissa Nematollahi, Tamás Terlaky
ORL
2008
71views more  ORL 2008»
9 years 8 months ago
A note on polling models with renewal arrivals and nonzero switch-over times
We consider polling systems with general service times and switch-over times, gated service at all queues and with general renewal arrival processes. We derive closed-form express...
Robert D. van der Mei, Erik M. M. Winands
books