Journal: Oper. Res. Lett.

Volume 51, Issue 6

541 -- 547Qian Li, Liang Wang, Lirong Xia, Wenxun Zheng, Yuxuan Zhou. A practical multi-objective auction design and optimization framework for sponsored search
548 -- 554Hongyi Jiang, Samitha Samaranayake, Qing Zhao. Online learning for route planning with on-time arrival reliability
555 -- 559Miquel Oliu-Barton, Guillaume Vigeral. Absorbing games with irrational values
560 -- 567Yinbin Han, Zizhuo Wang 0001. Optimal switching policy for batch servers
568 -- 574François-Michel Boire, R. Mark Reesor, Lars Stentoft. Lower bounds for American option prices with control variates
575 -- 582Zeyu Zhang, Chao Zhang, Qiao-Chu He, Pinghui Wang. Robust integrated planning for LEO satellite network design and service operations
583 -- 590Jirí Sgall, Gerhard J. Woeginger. Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms
591 -- 594Bala Kalyanasundaram, Kirk Pruhs, Clifford Stein 0001. A randomized algorithm for online metric b-matching
595 -- 598Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn. Reducibility bounds of objective functions over the integers
599 -- 600Sheldon M. Ross. On the duration of a gambler's ruin problem
601 -- 604Robert E. Kooij, Massimo A. Achterberg. Minimizing the effective graph resistance by adding links is NP-hard
605 -- 611Fernando Miguelez, Urtzi Ayesta, Josu Doncel. Price of Anarchy with multiple information sources under competition
612 -- 617Tomás Lagos, Oleg A. Prokopyev. On complexity of finding strong-weak solutions in bilevel linear programming
618 -- 622Christoph Buchheim. Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations
623 -- 627Rajkaran Kori, Abhyendra Prasad, Ashish K. Upadhyay. Reciprocal degree distance and Hamiltonian properties of graphs
628 -- 631Zhongqi Deng, Xuecheng Fan, Tingfan Gao. A blessing in disguise: Collusion equivalent phenomenon under environmental regulation
632 -- 637Ilan Doron Arad, Ariel Kulik, Hadas Shachnai. An FPTAS for budgeted laminar matroid independent set
638 -- 642Yajing Chen, Zhenhua Jiao, Wen Qin, Jinghong Shan. Fairness and efficiency of the random serial dictatorship on preference domains with a tier structure
643 -- 650Attila Tasnádi. Mixed-strategy equilibrium of the symmetric production in advance game: The missing case
651 -- 658Laura Sprenkels, Zümbül Atan, Ivo Adan. Multi-product pricing: A discrete choice model based on Markov Chain Choice Model combined with reservation prices
659 -- 665Xiaohui Yu 0005, Qiang Zhang, Yingying Gao, Chenglin Wang. Coalition structure value considering the outside alignment option of priori coalition
666 -- 672Meng Li, Paul Grigas, Alper Atamtürk. On the softplus penalty for large-scale convex optimization
673 -- 679H. Galindo, José Manuel Gallardo, Andrés Jiménez-Losada. A random arrival rule for airport problems with fuzzy costs
680 -- 686Saeed Marzban, Erick Delage, Jonathan Yu-Meng Li, Jeremie Desgagne-Bouchard, Carl Dussault. WaveCorr: Deep reinforcement learning with permutation invariant convolutional policy networks for portfolio management
687 -- 694Weinan Zhang, Pingping Zeng, Yue Kuen Kwok. Efficient recursion-quadrature algorithms for pricing Asian options and variance derivatives under stochastic volatility and Lévy jumps
695 -- 701Sarah Kelly, Yuyuan Ouyang, Boshi Yang. Semidefinite representable reformulations for two variants of the trust-region subproblem
702 -- 708Renan Spencer Trindade, Claudia D'Ambrosio, Antonio Frangioni, Claudio Gentile. Comparing perspective reformulations for piecewise-convex optimization
709 -- 716Yu Su 0001, Shai Vardi, Xiaoqi Ren, Adam Wierman. Communication-aware scheduling of precedence-constrained tasks on related machines
717 -- 722James P. Bailey. On the dimension of the set of yolk centers
723 -- 727Tao Liu, Wenrong Lyu, Xun-Feng Hu, Erfang Shan. Corrigendum to "A new axiomatization of the Shapley-solidarity value for games with a coalition structure" [Oper. Res. Lett. 46 (2018) 163-167]

Volume 51, Issue 5

469 -- 472Stephen E. Wright. Direct solution of the normal equations in interior point methods for convex transportation problems
473 -- 476Jun Wu, Yongxi Cheng, Zhen Yang, Feng Chu 0001. A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints
477 -- 482Sang Won Bae. An optimal algorithm for the minimum-width cubic shell problem
483 -- 487Steven J. M. den Hartog, Han Hoogeveen, Tom C. van der Zanden. On the complexity of Nurse Rostering problems
488 -- 493Alexey B. Piunovskiy, Yi Zhang 0027. On the structure of optimal solutions in a mathematical programming problem in a convex space
494 -- 500Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger. Recognising permuted Demidenko matrices
501 -- 506Zéphirin Nganmeni, Craig A. Tovey. The finagle point is close to the yolk
507 -- 514Khaled Elbassioni. A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
515 -- 520Hassan Mohammad. Solving nonlinear equations with the convex combination of two positive spectral coefficients
521 -- 527Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks, Tamás Terlaky, Luis F. Zuluaga. k-cut problem formulations
528 -- 532Roel Lambers, Jop Briët, Viresh Patel, Frits C. R. Spieksma, Mehmet Akif Yildiz. Orthogonal schedules in single round robin tournaments
533 -- 539Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder. Online cardinality constrained scheduling

Volume 51, Issue 4

379 -- 384Ganchen Xing, Jian Gu, Xiantao Xiao. Convergence analysis of a subsampled Levenberg-Marquardt algorithm
385 -- 392Davide Castellano, Liberatina Carmela Santillo. Stochastic joint replenishment problem under a fill rate constraint with controllable lead times and shared cost allocation
393 -- 400Vincent Guigues, Alexander Shapiro 0001, Yi Cheng. Risk-averse stochastic optimal control: An efficiently computable statistical upper bound
401 -- 407Karen I. Aardal, Lara Scavuzzo, Laurence A. Wolsey. A study of lattice reformulations for integer programming
408 -- 413Jie Chen, Lingfei Li. Data-driven hedging of stock index options via deep learning
414 -- 420Rachael M. Alfant, Temitayo Ajayi, Andrew J. Schaefer. Evaluating mixed-integer programming models over multiple right-hand sides
421 -- 424Bo Chen 0002, Vitaly A. Strusevich. An FPTAS for scheduling with resource constraints
425 -- 431Cor A. J. Hurkens. Truly tight bounds for TSP heuristics
432 -- 438Yuxiang Zhang, Weijun Zhong, Shu-e Mei. Supply chain coordination by manufacturer reward contract
439 -- 445Didier Chételat, Andrea Lodi 0001. Continuous cutting plane algorithms in integer programming
446 -- 452René van Bevern, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko. On data reduction for dynamic vector bin packing
453 -- 455Tomohiko Kawamori. Complete rent dissipation in contest with power technologies
456 -- 460Salomon Bendayan, Joseph Cheriyan, Kevin K. H. Cheung. Unconstrained traveling tournament problem is APX-complete
461 -- 467Selena Li, Rajan Udwani. The non-Markovian nature of nested logit choice
468 -- 473Weimin Dai, Jian-Qiang Hu, Chenbo Zhu. S) policies

Volume 51, Issue 3

197 -- 200Qiao Wang, Cheng Lu 0007, Zhibin Deng, Jichang Dong. A simplified completely positive reformulation for binary quadratic programs
201 -- 205Lukasz Kruk. Instability of LRTF multiclass queueing networks
206 -- 211Jun Deng, Hua Zong, Yun Wang. Static replication of impermanent loss for concentrated liquidity provision in decentralised markets
212 -- 219Pieter Jacob Storm, Sem C. Borst. Diffusion-level universality of many-server systems with concurrent service
220 -- 225Marten Maack. Online load balancing on uniform machines with limited migration
226 -- 233Zhi Chen, Daniel Kuhn, Wolfram Wiesemann. On approximations of data-driven chance constrained programs over Wasserstein balls
234 -- 241Maxence Delorme, David F. Manlove, Tom Smeets. Half-cycle: A new formulation for modelling kidney exchange problems
242 -- 247Matteo Lapucci, Pierluigi Mansueto. Improved front steepest descent for multi-objective optimization
248 -- 254Özden Engin Çakici, Itir Z. Karaesmen. Bidding to procure supply in newsvendor networks
255 -- 258Martin Skutella. A note on the quickest minimum cost transshipment problem
259 -- 265Francesco Giordano. A note on social learning in non-atomic routing games
266 -- 269Alexandros A. Voudouris. Tight distortion bounds for distributed metric voting on a line
270 -- 277Victor Cohen, Axel Parmentier. Future memories are not needed for large classes of POMDPs
278 -- 284Rubono Setiawan, Salmah, Irwan Endrayanto, Indarsih. n-person noncooperative supermodular multiobjective games
285 -- 288Dirk Briskorn, Gerhard J. Woeginger. Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations
289 -- 295Logan Grout, Joseph Cheriyan, Bundit Laekhanukit. On a partition LP relaxation for min-cost 2-node connected spanning subgraphs
296 -- 303Qingwei Jin, Yi Wu, Yinlian Zeng, Lianmin Zhang. Population monotonic allocation schemes for the two-period economic lot-sizing games
304 -- 307Homa Hosseinzadeh Ranjbar, Mehdi Feizi. Random assignments with uniform preferences: An impossibility result
308 -- 311Yiwei Wang, Nian Yang. Asymptotics for the survival probability of time-inhomogeneous diffusion processes
312 -- 314Tinghan Ye, David B. Shmoys. A min-max theorem for the minimum fleet-size problem
315 -- 321Tian Xia, Jia Liu, Abdel Lisser. Distributionally robust chance constrained games under Wasserstein ball
322 -- 325Lonnie Turpin. Service staffing with delay probabilities
326 -- 331David Van Bulck, Dries R. Goossens. First-break-heuristically-schedule: Constructing highly-constrained sports timetables
332 -- 337Bernardo Freitas Paulo da Costa, Vincent Leclère. Dual SDDP for risk-averse multistage stochastic programs
338 -- 345Sripad K. Devalkar, Ganesh Janakiraman, Sridhar Seshadri. Dual sourcing systems: An asymptotic result for the cost of optimal tailored base-surge (TBS) policy
346 -- 352Dan Pirjol, Lingjiong Zhu. Asymptotics for the Laplace transform of the time integral of the geometric Brownian motion
353 -- 356Orestes Bueno, John Edwin Cotrina, Yboon García. Generalized ordinal Nash games: Variational approach
357 -- 363Jong Gwang Kim. A new Lagrangian-based first-order method for nonconvex constrained optimization
364 -- 369Katsuhisa Ouchi, Hiroyuki Masuyama. A geometric convergence formula for the level-increment-truncation approximation of M/G/1-type Markov chains
370 -- 377Shimai Su, Elena M. Parilina. Can partial cooperation between developed and developing countries be stable?

Volume 51, Issue 2

123 -- 127Ismail Saglam. Two-player bargaining problems with unilateral pre-donation
128 -- 132Kenjiro Takazawa. An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
133 -- 136Milos Kopa, Martin Smíd. Contractivity of Bellman operator in risk averse dynamic programming with infinite horizon
137 -- 141Marin Bougeret, Artur Alves Pessoa, Michael Poss. Single machine robust scheduling with budgeted uncertainty
142 -- 145Maurizio D'Andrea. Playing against no-regret players
146 -- 152Aida Khajavirad. On the strength of recursive McCormick relaxations for binary polynomial optimization
153 -- 158David Bartl, Miklós Pintér. On balanced games with infinitely many players: Revisiting Schmeidler's result
159 -- 162Qianqian Kong, Hans Peters. Scoring indices, top-truncated preferences, and splitting invariance
163 -- 170Laurens Deprez, Katrien Antonio, Joachim Arts, Robert N. Boute. Data-driven preventive maintenance for a heterogeneous machine portfolio
171 -- 175Avinash Bhardwaj, Manjesh K. Hanawal, Purushottam Parthasarathy. Almost exact risk budgeting with return forecasts for portfolio allocation
176 -- 178Mahmoud Affouf, Jiantian Wang. Answer to an open problem about stochastic comparison of parallel systems with geometric components
179 -- 186Tim Engels, Ivo Adan, Onno J. Boxma, Jacques Resing. Exact results for the order picking time distribution under return routing
187 -- 189Jan Karel Lenstra, Nodari Vakhania. On the complexity of scheduling unrelated parallel machines with limited preemptions
190 -- 196Shanshan Guo, Jiayuan Han, Wenbin Wang. Business models for public emission reduction projects
197 -- 203Annabella Astorino, Antonio Frangioni, Enrico Gorgone, Benedetto Manca. Ellipsoidal classification via semidefinite programming

Volume 51, Issue 1

1 -- 2Jan Karel Lenstra, Vitaly A. Strusevich, Milan Vlach. A historical note on the complexity of scheduling problems
3 -- 10Johannes O. Royset. On robustness in nonconvex optimization with application to defense planning
11 -- 16Ricardo Fukasawa, Joshua Gunter. The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands
17 -- 20H. W. Lenstra. Powers of commutators
21 -- 25Shuang Yang, Shi-Liang Wu. A modified Barzilai-Borwein algorithm for the generalized absolute value equation
26 -- 32Renbo Zhao. Convergence rate analysis of the multiplicative gradient method for PET-type problems
33 -- 39Frédéric Babonneau, Alain Haurie, Marc Vielle. Reaching Paris Agreement goal through carbon dioxide removal development: A compact OR model
40 -- 46Annabella Astorino, Matteo Avolio, Annamaria Canino, Teresa Crupi, Antonio Fuduli. Partitional clustering via successive transportation problems
47 -- 53Abhinav Anand, Souvik Dutta, Prithwiraj Mukherjee. Platform exploitation in the sharing economy
54 -- 59Lixiang Li 0005, Min Li, Hailun Zhang, Lianmin Zhang. Price optimization under the extended nested logit model
60 -- 66Awi Federgruen, Zhe Liu 0035, Jiaqi Lu. Combined pricing and inventory control with multiple unreliable suppliers
67 -- 71Manoel B. Campêlo, Jhonata A. S. Matias. A strongly polynomial algorithm for the minimum maximum flow degree problem
72 -- 78Adam Jozefiak, F. Bruce Shepherd, Noah Weninger. A knapsack intersection hierarchy
79 -- 83Andrew Butler, Roy H. Kwon. Gradient boosting for convex cone predict and optimize problems
84 -- 91Floriane Mefo Kue, Stephan Dempe. A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming
92 -- 98Man Yiu Tsang, Karmel S. Shehadeh, Frank E. Curtis. An inexact column-and-constraint generation method to solve two-stage robust optimization problems
99 -- 104Woo-Hyung Cho, David B. Shmoys, Shane G. Henderson. SPT optimality (mostly) via linear programming
105 -- 110Yann Braouezec, Keyvan Kiani. A generalized Nash equilibrium problem arising in banking regulation: An existence result with Tarski's theorem
111 -- 115Gambheer Singh, Vatsalkumar N. Mer, Promila Kumar, S. K. Neogy. Q-matrix
116 -- 122Karthik Natarajan, Arjun Ramachandra, Colin Tan. n - 1)-wise independence