Sciweavers

ORL
2008
67views more  ORL 2008»
14 years 12 days ago
Bounds on the performance of back-to-front airplane boarding policies
We provide bounds on the performance of back-to-front airplane boarding policies. In particular, we show that no back-to-front policy can be more than 20% better than the policy w...
Eitan Bachmat, Michael Elkin
ORL
2008
124views more  ORL 2008»
14 years 12 days ago
Sample average approximation of expected value constrained stochastic programs
We propose a sample average approximation (SAA) method for stochastic programming problems involving an expected value constraint. Such problems arise, for example, in portfolio s...
Wei Wang, Shabbir Ahmed
ORL
2008
82views more  ORL 2008»
14 years 12 days ago
On test sets for nonlinear integer maximization
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results ...
Jon Lee, Shmuel Onn, Robert Weismantel
ORL
2008
120views more  ORL 2008»
14 years 12 days ago
Composition of stable set polyhedra
Barahona and Mahjoub found a defining system of the stable set polytope for a graph with a cut-set of cardinality 2. We extend this result to cut-sets composed of a complete graph...
Benjamin McClosky, Illya V. Hicks
ORL
2008
82views more  ORL 2008»
14 years 12 days ago
An approximation algorithm for the wireless gathering problem
Vincenzo Bonifaci, Peter Korteweg, Alberto Marchet...
ORL
2008
52views more  ORL 2008»
14 years 12 days ago
Supplier diversification under binomial yield
Mehmet Murat Fadiloglu, Emre Berk, Mustafa Ç...
ORL
2008
116views more  ORL 2008»
14 years 12 days ago
Explicit gradient information in multiobjective optimization
This paper presents an algorithm that converges to points that satisfy a first order necessary condition of weakly Pareto solutions of multiobjective optimization problems. Hints ...
Ubaldo M. García-Palomares, Juan C. Burguil...
ORL
2008
93views more  ORL 2008»
14 years 12 days ago
Polymatroids and mean-risk minimization in discrete optimization
We study discrete optimization problems with a submodular mean-risk minimization objective. For 0-1 problems a linear characterization of the convex lower envelope is given. For mi...
Alper Atamtürk, Vishnu Narayanan
ORL
2008
70views more  ORL 2008»
14 years 12 days ago
Finding a bounded mixed-integer solution to a system of dual network inequalities
We show that using max-algebraic techniques it is possible to generate the set of all solutions to a system of inequalities xi xj bij; i; j = 1; :::; n using n generators. This e
Peter Butkovic
ORL
2008
90views more  ORL 2008»
14 years 12 days ago
Optimal bundle pricing with monotonicity constraint
We consider the problem to sell items to a set of bidders. Bidders bid on bundles of items, and each item's availability is unbounded, like for digital goods. We need to dete...
Alexander Grigoriev, Joyce van Loon, Maxim Sviride...