R
search
search
reviewers
reviewers
feeds
feeds
assignments
assignments
settings
logout
Oper. Res. Lett.
1981
1995
2009
2023
1981
2023
Keyphrases
Publications
volume 51, number 4, 2023
Rachael M. Alfant
,
Temitayo Ajayi
,
Andrew J. Schaefer
Evaluating mixed-integer programming models over multiple right-hand sides.
Oper. Res. Lett.
51 (4) (2023)
Ganchen Xing
,
Jian Gu
,
Xiantao Xiao
Convergence analysis of a subsampled Levenberg-Marquardt algorithm.
Oper. Res. Lett.
51 (4) (2023)
Yuxiang Zhang
,
Weijun Zhong
,
Shu-e Mei
Supply chain coordination by manufacturer reward contract.
Oper. Res. Lett.
51 (4) (2023)
Didier Chételat
,
Andrea Lodi
Continuous cutting plane algorithms in integer programming.
Oper. Res. Lett.
51 (4) (2023)
Vincent Guigues
,
Alexander Shapiro
,
Yi Cheng
Risk-averse stochastic optimal control: An efficiently computable statistical upper bound.
Oper. Res. Lett.
51 (4) (2023)
Jie Chen
,
Lingfei Li
Data-driven hedging of stock index options via deep learning.
Oper. Res. Lett.
51 (4) (2023)
Bo Chen
,
Vitaly A. Strusevich
An FPTAS for scheduling with resource constraints.
Oper. Res. Lett.
51 (4) (2023)
Cor A. J. Hurkens
Truly tight bounds for TSP heuristics.
Oper. Res. Lett.
51 (4) (2023)
volume 51, number 5, 2023
Roel Lambers
,
Jop Briët
,
Viresh Patel
,
Frits C. R. Spieksma
,
Mehmet Akif Yildiz
Orthogonal schedules in single round robin tournaments.
Oper. Res. Lett.
51 (5) (2023)
Leah Epstein
,
Alexandra Lassota
,
Asaf Levin
,
Marten Maack
,
Lars Rohwedder
Online cardinality constrained scheduling.
Oper. Res. Lett.
51 (5) (2023)
Eranda Çela
,
Vladimir G. Deineko
,
Gerhard J. Woeginger
Recognising permuted Demidenko matrices.
Oper. Res. Lett.
51 (5) (2023)
Jun Wu
,
Yongxi Cheng
,
Zhen Yang
,
Feng Chu
A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints.
Oper. Res. Lett.
51 (5) (2023)
Steven J. M. den Hartog
,
Han Hoogeveen
,
Tom C. van der Zanden
On the complexity of Nurse Rostering problems.
Oper. Res. Lett.
51 (5) (2023)
Alexey B. Piunovskiy
,
Yi Zhang
On the structure of optimal solutions in a mathematical programming problem in a convex space.
Oper. Res. Lett.
51 (5) (2023)
Khaled Elbassioni
A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces.
Oper. Res. Lett.
51 (5) (2023)
Hassan Mohammad
Solving nonlinear equations with the convex combination of two positive spectral coefficients.
Oper. Res. Lett.
51 (5) (2023)
Ramin Fakhimi
,
Hamidreza Validi
,
Illya V. Hicks
,
Tamás Terlaky
,
Luis F. Zuluaga
-cut problem formulations.
Oper. Res. Lett.
51 (5) (2023)
Stephen E. Wright
Direct solution of the normal equations in interior point methods for convex transportation problems.
Oper. Res. Lett.
51 (5) (2023)
Zéphirin Nganmeni
,
Craig A. Tovey
The finagle point is close to the yolk.
Oper. Res. Lett.
51 (5) (2023)
Sang Won Bae
An optimal algorithm for the minimum-width cubic shell problem.
Oper. Res. Lett.
51 (5) (2023)
volume 51, number 6, 2023
Bala Kalyanasundaram
,
Kirk Pruhs
,
Clifford Stein
A randomized algorithm for online metric b-matching.
Oper. Res. Lett.
51 (6) (2023)
Miquel Oliu-Barton
,
Guillaume Vigeral
Absorbing games with irrational values.
Oper. Res. Lett.
51 (6) (2023)
Zeyu Zhang
,
Chao Zhang
,
Qiao-Chu He
,
Pinghui Wang
Robust integrated planning for LEO satellite network design and service operations.
Oper. Res. Lett.
51 (6) (2023)
François-Michel Boire
,
R. Mark Reesor
,
Lars Stentoft
Lower bounds for American option prices with control variates.
Oper. Res. Lett.
51 (6) (2023)
Laura Sprenkels
,
Zümbül Atan
,
Ivo Adan
Multi-product pricing: A discrete choice model based on Markov Chain Choice Model combined with reservation prices.
Oper. Res. Lett.
51 (6) (2023)
Rajkaran Kori
,
Abhyendra Prasad
,
Ashish K. Upadhyay
Reciprocal degree distance and Hamiltonian properties of graphs.
Oper. Res. Lett.
51 (6) (2023)
James P. Bailey
On the dimension of the set of yolk centers.
Oper. Res. Lett.
51 (6) (2023)
Yinbin Han
,
Zizhuo Wang
Optimal switching policy for batch servers.
Oper. Res. Lett.
51 (6) (2023)
Fernando Miguelez
,
Urtzi Ayesta
,
Josu Doncel
Price of Anarchy with multiple information sources under competition.
Oper. Res. Lett.
51 (6) (2023)
Sarah Kelly
,
Yuyuan Ouyang
,
Boshi Yang
Semidefinite representable reformulations for two variants of the trust-region subproblem.
Oper. Res. Lett.
51 (6) (2023)
Christoph Buchheim
Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations.
Oper. Res. Lett.
51 (6) (2023)
Attila Tasnádi
Mixed-strategy equilibrium of the symmetric production in advance game: The missing case.
Oper. Res. Lett.
51 (6) (2023)
Jirí Sgall
,
Gerhard J. Woeginger
Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms.
Oper. Res. Lett.
51 (6) (2023)
Xiaohui Yu
,
Qiang Zhang
,
Yingying Gao
,
Chenglin Wang
Coalition structure value considering the outside alignment option of priori coalition.
Oper. Res. Lett.
51 (6) (2023)
Ilan Doron Arad
,
Ariel Kulik
,
Hadas Shachnai
An FPTAS for budgeted laminar matroid independent set.
Oper. Res. Lett.
51 (6) (2023)
Sheldon M. Ross
On the duration of a gambler's ruin problem.
Oper. Res. Lett.
51 (6) (2023)
H. Galindo
,
José Manuel Gallardo
,
Andrés Jiménez-Losada
A random arrival rule for airport problems with fuzzy costs.
Oper. Res. Lett.
51 (6) (2023)
Zhongqi Deng
,
Xuecheng Fan
,
Tingfan Gao
A blessing in disguise: Collusion equivalent phenomenon under environmental regulation.
Oper. Res. Lett.
51 (6) (2023)
Robert E. Kooij
,
Massimo A. Achterberg
Minimizing the effective graph resistance by adding links is NP-hard.
Oper. Res. Lett.
51 (6) (2023)
Renan Spencer Trindade
,
Claudia D'Ambrosio
,
Antonio Frangioni
,
Claudio Gentile
Comparing perspective reformulations for piecewise-convex optimization.
Oper. Res. Lett.
51 (6) (2023)
Yajing Chen
,
Zhenhua Jiao
,
Wen Qin
,
Jinghong Shan
Fairness and efficiency of the random serial dictatorship on preference domains with a tier structure.
Oper. Res. Lett.
51 (6) (2023)
Saeed 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.
Oper. Res. Lett.
51 (6) (2023)
Qian Li
,
Liang Wang
,
Lirong Xia
,
Wenxun Zheng
,
Yuxuan Zhou
A practical multi-objective auction design and optimization framework for sponsored search.
Oper. Res. Lett.
51 (6) (2023)
Tomás Lagos
,
Oleg A. Prokopyev
On complexity of finding strong-weak solutions in bilevel linear programming.
Oper. Res. Lett.
51 (6) (2023)
Yu Su
,
Shai Vardi
,
Xiaoqi Ren
,
Adam Wierman
Communication-aware scheduling of precedence-constrained tasks on related machines.
Oper. Res. Lett.
51 (6) (2023)
Weinan Zhang
,
Pingping Zeng
,
Yue Kuen Kwok
Efficient recursion-quadrature algorithms for pricing Asian options and variance derivatives under stochastic volatility and Lévy jumps.
Oper. Res. Lett.
51 (6) (2023)
Friedrich Eisenbrand
,
Christoph Hunkenschröder
,
Kim-Manuel Klein
,
Martin Koutecký
,
Asaf Levin
,
Shmuel Onn
Reducibility bounds of objective functions over the integers.
Oper. Res. Lett.
51 (6) (2023)
Hongyi Jiang
,
Samitha Samaranayake
,
Qing Zhao
Online learning for route planning with on-time arrival reliability.
Oper. Res. Lett.
51 (6) (2023)
Meng Li
,
Paul Grigas
,
Alper Atamtürk
On the softplus penalty for large-scale convex optimization.
Oper. Res. Lett.
51 (6) (2023)
Tao 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].
Oper. Res. Lett.
51 (6) (2023)