Sciweavers

ORL
2008
70views more  ORL 2008»
14 years 12 days ago
Efficiently packing unequal disks in a circle
Bernardetta Addis, Marco Locatelli, Fabio Schoen
ORL
2008
73views more  ORL 2008»
14 years 12 days ago
Solving operational statistics via a Bayesian analysis
Leon Yang Chu, J. George Shanthikumar, Zuo-Jun Max...
ORL
2008
160views more  ORL 2008»
14 years 12 days ago
Efficient nested pricing in the simplex algorithm
We report a remarkable success of nested pricing rules over major pivot rules commonly used in practice, such as Dantzig's original rule as well as the steepest-edge rule and ...
Ping-Qi Pan
ORL
2008
55views more  ORL 2008»
14 years 12 days ago
Policies utilizing tactical inventory for service-differentiated customers
We consider a manufacturer serving two customer classes where one wants the item immediately and the second receives a discount to accept a delay. We show that a (S, R, B) base st...
Serhan Duran, Tieming Liu, David Simchi-Levi, Juli...
ORL
2008
111views more  ORL 2008»
14 years 12 days ago
New formulations and valid inequalities for a bilevel pricing problem
Consider the problem of maximizing the toll revenue collected on a multi-commodity transportation network. This fits a bilevel framework where a leader sets tolls, while users res...
Sophie Dewez, Martine Labbé, Patrice Marcot...
ORL
2008
112views more  ORL 2008»
14 years 12 days ago
A monotone approximation algorithm for scheduling with precedence constraints
We provide a monotone O(m2/3 )-approximation algorithm for scheduling related machines with precedence constraints.
Sven Oliver Krumke, Anne Schwahn, Rob van Stee, St...
ORL
2008
63views more  ORL 2008»
14 years 12 days ago
The inequality-satisfiability problem
We define a generalized variant of the satisfiability problem (SAT) where each "clause" is an or-list of inequalities in n variables. The inequality satisfiability probl...
Dorit S. Hochbaum, Erick Moreno-Centeno
ORL
2008
72views more  ORL 2008»
14 years 12 days ago
Stochastic 0-1 linear programming under limited distributional information
We consider the problem minX{0,1}n {c x : aj x bj , j = 1, . . . , m}, where the aj are random vectors with unknown distributions. The only information we are given regarding the ...
Michael R. Wagner
ORL
2008
66views more  ORL 2008»
14 years 12 days ago
Profit-based latency problems on the line
We consider a latency problem with a profit pi for each client. When serving a client, a revenue of pi -t is collected. The goal is to find routes for the servers such that total ...
Sofie Coene, Frits C. R. Spieksma