Sciweavers

98 search results - page 11 / 20
» orl 2006
Sort
View
ORL
1998
137views more  ORL 1998»
14 years 10 months ago
Calculation of stability radii for combinatorial optimization problems
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
Nilotpal Chakravarti, Albert P. M. Wagelmans
ORL
2008
86views more  ORL 2008»
14 years 10 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
115views more  ORL 2008»
14 years 10 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
87views more  ORL 2008»
14 years 9 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
2007
97views more  ORL 2007»
14 years 10 months ago
Analysis on the forward market equilibrium model
We establish the existence results for the Allaz–Vila [B. Allaz, J.-L. Vila, Cournot competition, forward markets and efficiency, J. Econ. Theory 59 (1993) 1–16] forward mark...
Che-Lin Su