Journal: Oper. Res. Lett.

Volume 46, Issue 3

273 -- 277Shuige Liu. Directed graphical structure, Nash equilibrium, and potential games
278 -- 281Stasys Jukna. Incremental versus non-incremental dynamic programming
282 -- 285Emin Karagözoglu, Elif Özcan Tok. Iterated egalitarian compromise solution to bargaining problems and midpoint domination
286 -- 290Martin Groß 0001, Marc E. Pfetsch, Martin Skutella. On the complexity of instationary gas flows
291 -- 294Mousaab Bouafia, Djamel Benterki, Adnan Yassine. A new efficient short-step projective interior point method for linear programming
295 -- 299Gabriel Haeser. Some theoretical limitations of second-order algorithms for smooth constrained optimization
300 -- 305Merve Merakli, Simge Küçükyavuz. Vector-valued multivariate conditional value-at-risk
306 -- 311Zhenyu Cui, Qi Feng, Ruimeng Hu, Bin Zou. Systemic risk and optimal fee for central clearing counterparty under partial netting
312 -- 317Tammy Drezner, Zvi Drezner, Dawit Zerom. Competitive facility location with random attractiveness
318 -- 323Tobias Widmer, Jörg Leukel. Electronic service matching: Failure of incentive compatibility in Vickrey auctions
324 -- 328László Á. Kóczy, Balázs Sziklai. Bounds on Malapportionment
329 -- 334Karl Michael Ortmann. Preservation of risk in capital markets
335 -- 338Walid Ben-Ameur, Mohamed Didi Biha. A note on the problem of r disjoint (s, t)-cuts and some related issues
339 -- 344Kimia Ghobadi, Taewoo Lee, Houra Mahmoudzadeh, Daria Terekhov. Robust inverse optimization
345 -- 351Chenhao Du, William L. Cooper, Zizhuo Wang. Optimal worst-case pricing for a logit demand model with network effects
352 -- 355Kaveh Khoshkhah, Dirk Oliver Theis. On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope
356 -- 361Benjamin Legros. Waiting time based routing policies to parallel queues with percentiles objectives
362 -- 366Kishor Patil, Dieter Fiems. The value of information in energy harvesting sensor networks
367 -- 372Oguzhan Vicil, Peter Jackson. Stock optimization for service differentiated demands with fill rate and waiting time requirements