Journal: Oper. Res. Lett.

Volume 41, Issue 2

121 -- 125James M. Davis, Rajiv Gandhi, Vijay H. Kothari. Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine
126 -- 133Paolo Serafini. Combinatorial optimization problems with normal random costs
134 -- 137Retsef Levi, Liron Yedidsion. NP-hardness proof for the assembly problem with stationary setup and additive holding costs
138 -- 141Hongyu Liang. p-hub center problem
142 -- 146Gérard Cornuéjols, Tamás Kis, Marco Molinaro. Lifting Gomory cuts with bounded variables
147 -- 149Yanfang Zhang, Shue Mei, Weijun Zhong. Should R&D risk always be preferable?
150 -- 152Vyacheslav M. Abramov. n queues
153 -- 158Igor Vasilyev, Xenia Klimentova, Maurizio Boccia. Polyhedral study of simple plant location problem with order
159 -- 163Anand Paul, Arda Yenipazarli. A note on lateral transshipment under point-process driven demand
164 -- 171Helin Wu. g-expectation with constraints
172 -- 179Xi Chen, Saif Benjaafar, Adel Elomri. The carbon-constrained EOQ
180 -- 187Yang Shen, Tak Kuen Siu. Pricing variance swaps under a stochastic interest rate and volatility model with regime-switching
188 -- 190Natalia Chernova, Sergey Foss, Bara Kim. A polling system whose stability region depends on the whole distribution of service times
191 -- 196Vineet Goyal, R. Ravi. An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set
197 -- 200Milan Stanojevic, Mirko Vujosevic, Bogdana Stanojevic. On the cardinality of the nondominated set of multi-objective combinatorial optimization problems
201 -- 206Tal Ben-Zvi, Abraham Grosfeld-Nir. Partially observed Markov decision processes with binomial observations
207 -- 209Shouwei Guo, Liying Kang. Online scheduling of parallel jobs with preemption on two identical machines