default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 51
Volume 51, Number 1, January 2023
- Jan Karel Lenstra, Vitaly A. Strusevich, Milan Vlach
:
A historical note on the complexity of scheduling problems. 1-2 - Johannes O. Royset:
On robustness in nonconvex optimization with application to defense planning. 3-10 - Ricardo Fukasawa, Joshua Gunter:
The complexity of branch-and-price algorithms for the capacitated vehicle routing problem with stochastic demands. 11-16 - H. W. Lenstra:
Powers of commutators. 17-20 - Shuang Yang, Shi-Liang Wu:
A modified Barzilai-Borwein algorithm for the generalized absolute value equation. 21-25 - Renbo Zhao:
Convergence rate analysis of the multiplicative gradient method for PET-type problems. 26-32 - Frédéric Babonneau, Alain Haurie, Marc Vielle:
Reaching Paris Agreement goal through carbon dioxide removal development: A compact OR model. 33-39 - Annabella Astorino, Matteo Avolio, Annamaria Canino, Teresa Crupi, Antonio Fuduli:
Partitional clustering via successive transportation problems. 40-46 - Abhinav Anand, Souvik Dutta, Prithwiraj Mukherjee:
Platform exploitation in the sharing economy. 47-53 - Lixiang Li, Min Li, Hailun Zhang, Lianmin Zhang:
Price optimization under the extended nested logit model. 54-59 - Awi Federgruen, Zhe Liu, Jiaqi Lu:
Combined pricing and inventory control with multiple unreliable suppliers. 60-66 - Manoel B. Campêlo, Jhonata A. S. Matias:
A strongly polynomial algorithm for the minimum maximum flow degree problem. 67-71 - Adam Jozefiak, F. Bruce Shepherd, Noah Weninger:
A knapsack intersection hierarchy. 72-78 - Andrew Butler, Roy H. Kwon:
Gradient boosting for convex cone predict and optimize problems. 79-83 - Floriane Mefo Kue, Stephan Dempe:
A study of mixed discrete bilevel programs using semidefinite and semi-infinite programming. 84-91 - Man Yiu Tsang, Karmel S. Shehadeh, Frank E. Curtis:
An inexact column-and-constraint generation method to solve two-stage robust optimization problems. 92-98 - Woo-Hyung Cho, David B. Shmoys, Shane G. Henderson:
SPT optimality (mostly) via linear programming. 99-104 - Yann Braouezec, Keyvan Kiani:
A generalized Nash equilibrium problem arising in banking regulation: An existence result with Tarski's theorem. 105-110 - Gambheer Singh, Vatsalkumar N. Mer, Promila Kumar, S. K. Neogy:
Some more subclasses of Q-matrix. 111-115 - Karthik Natarajan, Arjun Kodagehalli Ramachandra, Colin Tan:
Probability bounds for n random events under (n - 1)-wise independence. 116-122
Volume 51, Number 2, March 2023
- Ismail Saglam:
Two-player bargaining problems with unilateral pre-donation. 123-127 - Kenjiro Takazawa:
An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint. 128-132 - Milos Kopa, Martin Smíd:
Contractivity of Bellman operator in risk averse dynamic programming with infinite horizon. 133-136 - Marin Bougeret, Artur Alves Pessoa, Michael Poss:
Single machine robust scheduling with budgeted uncertainty. 137-141 - Maurizio D'Andrea:
Playing against no-regret players. 142-145 - Aida Khajavirad:
On the strength of recursive McCormick relaxations for binary polynomial optimization. 146-152 - David Bartl, Miklós Pintér:
On balanced games with infinitely many players: Revisiting Schmeidler's result. 153-158 - Qianqian Kong, Hans Peters:
Scoring indices, top-truncated preferences, and splitting invariance. 159-162 - Laurens Deprez, Katrien Antonio, Joachim J. Arts, Robert N. Boute:
Data-driven preventive maintenance for a heterogeneous machine portfolio. 163-170 - Avinash Bhardwaj, Manjesh K. Hanawal, Purushottam Parthasarathy:
Almost exact risk budgeting with return forecasts for portfolio allocation. 171-175 - Mahmoud Affouf, Jiantian Wang:
Answer to an open problem about stochastic comparison of parallel systems with geometric components. 176-178 - Tim Engels, Ivo Adan, Onno J. Boxma, Jacques Resing:
Exact results for the order picking time distribution under return routing. 179-186 - Jan Karel Lenstra, Nodari Vakhania:
On the complexity of scheduling unrelated parallel machines with limited preemptions. 187-189 - Shanshan Guo, Jiayuan Han, Wenbin Wang:
Business models for public emission reduction projects. 190-196 - Annabella Astorino, Antonio Frangioni, Enrico Gorgone, Benedetto Manca:
Ellipsoidal classification via semidefinite programming. 197-203
Volume 51, Number 3, May 2023
- Qiao Wang, Cheng Lu, Zhibin Deng, Jichang Dong:
A simplified completely positive reformulation for binary quadratic programs. 197-200 - Lukasz Kruk:
Instability of LRTF multiclass queueing networks. 201-205 - Jun Deng, Hua Zong, Yun Wang:
Static replication of impermanent loss for concentrated liquidity provision in decentralised markets. 206-211 - Pieter Jacob Storm, Sem C. Borst:
Diffusion-level universality of many-server systems with concurrent service. 212-219 - Marten Maack:
Online load balancing on uniform machines with limited migration. 220-225 - Zhi Chen, Daniel Kuhn, Wolfram Wiesemann:
On approximations of data-driven chance constrained programs over Wasserstein balls. 226-233 - Maxence Delorme, David F. Manlove, Tom Smeets:
Half-cycle: A new formulation for modelling kidney exchange problems. 234-241 - Matteo Lapucci, Pierluigi Mansueto:
Improved front steepest descent for multi-objective optimization. 242-247 - Özden Engin Çakici, Itir Z. Karaesmen:
Bidding to procure supply in newsvendor networks. 248-254 - Martin Skutella:
A note on the quickest minimum cost transshipment problem. 255-258 - Francesco Giordano:
A note on social learning in non-atomic routing games. 259-265 - Alexandros A. Voudouris:
Tight distortion bounds for distributed metric voting on a line. 266-269 - Victor Cohen, Axel Parmentier:
Future memories are not needed for large classes of POMDPs. 270-277 - Rubono Setiawan, Salmah, Irwan Endrayanto, Indarsih:
Analysis of the n-person noncooperative supermodular multiobjective games. 278-284 - Dirk Briskorn, Gerhard J. Woeginger:
Hardness of flow time minimization in a crossdock with a single door and asymmetric handover relations. 285-288 - Logan Grout, Joseph Cheriyan, Bundit Laekhanukit:
On a partition LP relaxation for min-cost 2-node connected spanning subgraphs. 289-295 - Qingwei Jin, Yi Wu, Yinlian Zeng, Lianmin Zhang:
Population monotonic allocation schemes for the two-period economic lot-sizing games. 296-303 - Homa Hosseinzadeh Ranjbar, Mehdi Feizi:
Random assignments with uniform preferences: An impossibility result. 304-307 - Yiwei Wang, Nian Yang:
Asymptotics for the survival probability of time-inhomogeneous diffusion processes. 308-311 - Tinghan Ye, David B. Shmoys:
A min-max theorem for the minimum fleet-size problem. 312-314 - Tian Xia, Jia Liu, Abdel Lisser:
Distributionally robust chance constrained games under Wasserstein ball. 315-321 - Lonnie Turpin:
Service staffing with delay probabilities. 322-325 - David Van Bulck, Dries R. Goossens:
First-break-heuristically-schedule: Constructing highly-constrained sports timetables. 326-331 - Bernardo Freitas Paulo da Costa, Vincent Leclère:
Dual SDDP for risk-averse multistage stochastic programs. 332-337 - Sripad K. Devalkar, Ganesh Janakiraman, Sridhar Seshadri:
Dual sourcing systems: An asymptotic result for the cost of optimal tailored base-surge (TBS) policy. 338-345 - Dan Pirjol, Lingjiong Zhu:
Asymptotics for the Laplace transform of the time integral of the geometric Brownian motion. 346-352 - Orestes Bueno, John Edwin Cotrina, Yboon García:
Generalized ordinal Nash games: Variational approach. 353-356 - Jong Gwang Kim:
A new Lagrangian-based first-order method for nonconvex constrained optimization. 357-363 - Katsuhisa Ouchi, Hiroyuki Masuyama:
A geometric convergence formula for the level-increment-truncation approximation of M/G/1-type Markov chains. 364-369 - Shimai Su, Elena M. Parilina:
Can partial cooperation between developed and developing countries be stable? 370-377
Volume 51, Number 4, July 2023
- Ganchen Xing, Jian Gu, Xiantao Xiao:
Convergence analysis of a subsampled Levenberg-Marquardt algorithm. 379-384 - Davide Castellano, Liberatina Carmela Santillo:
Stochastic joint replenishment problem under a fill rate constraint with controllable lead times and shared cost allocation. 385-392 - Vincent Guigues, Alexander Shapiro, Yi Cheng:
Risk-averse stochastic optimal control: An efficiently computable statistical upper bound. 393-400 - Karen I. Aardal, Lara Scavuzzo, Laurence A. Wolsey:
A study of lattice reformulations for integer programming. 401-407 - Jie Chen, Lingfei Li:
Data-driven hedging of stock index options via deep learning. 408-413 - Rachael M. Alfant, Temitayo Ajayi, Andrew J. Schaefer:
Evaluating mixed-integer programming models over multiple right-hand sides. 414-420 - Bo Chen, Vitaly A. Strusevich:
An FPTAS for scheduling with resource constraints. 421-424 - Cor A. J. Hurkens:
Truly tight bounds for TSP heuristics. 425-431 - Yuxiang Zhang, Weijun Zhong, Shu-e Mei:
Supply chain coordination by manufacturer reward contract. 432-438 - Didier Chételat, Andrea Lodi:
Continuous cutting plane algorithms in integer programming. 439-445 - René van Bevern, Andrey Melnikov, Pavel V. Smirnov, Oxana Yu. Tsidulko:
On data reduction for dynamic vector bin packing. 446-452 - Tomohiko Kawamori:
Complete rent dissipation in contest with power technologies. 453-455 - Salomon Bendayan, Joseph Cheriyan, Kevin K. H. Cheung:
Unconstrained traveling tournament problem is APX-complete. 456-460 - Selena Li, Rajan Udwani:
The non-Markovian nature of nested logit choice. 461-467 - Weimin Dai, Jian-Qiang Hu, Chenbo Zhu:
A gradient-based method to calculate (s,S) policies. 468-473
Volume 51, Number 5, September 2023
- Stephen E. Wright:
Direct solution of the normal equations in interior point methods for convex transportation problems. 469-472 - Jun Wu, Yongxi Cheng, Zhen Yang, Feng Chu:
A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints. 473-476 - Sang Won Bae:
An optimal algorithm for the minimum-width cubic shell problem. 477-482 - Steven J. M. den Hartog, Han Hoogeveen, Tom C. van der Zanden:
On the complexity of Nurse Rostering problems. 483-487 - Alexey B. Piunovskiy, Yi Zhang:
On the structure of optimal solutions in a mathematical programming problem in a convex space. 488-493 - Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
Recognising permuted Demidenko matrices. 494-500 - Zéphirin Nganmeni, Craig A. Tovey:
The finagle point is close to the yolk. 501-506 - Khaled Elbassioni:
A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces. 507-514 - Hassan Mohammad:
Solving nonlinear equations with the convex combination of two positive spectral coefficients. 515-520 - Ramin Fakhimi, Hamidreza Validi, Illya V. Hicks, Tamás Terlaky, Luis F. Zuluaga:
On relaxations of the max k-cut problem formulations. 521-527 - Roel Lambers, Jop Briët, Viresh Patel, Frits C. R. Spieksma, Mehmet Akif Yildiz:
Orthogonal schedules in single round robin tournaments. 528-532 - Leah Epstein, Alexandra Lassota, Asaf Levin, Marten Maack, Lars Rohwedder:
Online cardinality constrained scheduling. 533-539
Volume 51, Number 6, November 2023
- Qian Li, Liang Wang, Lirong Xia, Wenxun Zheng, Yuxuan Zhou:
A practical multi-objective auction design and optimization framework for sponsored search. 541-547 - Hongyi Jiang, Samitha Samaranayake, Qing Zhao:
Online learning for route planning with on-time arrival reliability. 548-554 - Miquel Oliu-Barton, Guillaume Vigeral:
Absorbing games with irrational values. 555-559 - Yinbin Han, Zizhuo Wang:
Optimal switching policy for batch servers. 560-567 - François-Michel Boire, R. Mark Reesor, Lars Stentoft:
Lower bounds for American option prices with control variates. 568-574 - Zeyu Zhang, Chao Zhang, Qiao-Chu He, Pinghui Wang:
Robust integrated planning for LEO satellite network design and service operations. 575-582 - Jirí Sgall, Gerhard J. Woeginger:
Multiprocessor jobs, preemptive schedules, and one-competitive online algorithms. 583-590 - Bala Kalyanasundaram, Kirk Pruhs, Clifford Stein:
A randomized algorithm for online metric b-matching. 591-594 - Friedrich Eisenbrand, Christoph Hunkenschröder, Kim-Manuel Klein, Martin Koutecký, Asaf Levin, Shmuel Onn:
Reducibility bounds of objective functions over the integers. 595-598 - Sheldon M. Ross:
On the duration of a gambler's ruin problem. 599-600 - Robert E. Kooij, Massimo A. Achterberg:
Minimizing the effective graph resistance by adding links is NP-hard. 601-604 - Fernando Miguelez, Urtzi Ayesta, Josu Doncel:
Price of Anarchy with multiple information sources under competition. 605-611 - Tomás Lagos, Oleg A. Prokopyev:
On complexity of finding strong-weak solutions in bilevel linear programming. 612-617 - Christoph Buchheim:
Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations. 618-622 - Rajkaran Kori, Abhyendra Prasad, Ashish Kumar Upadhyay:
Reciprocal degree distance and Hamiltonian properties of graphs. 623-627 - Zhongqi Deng, Xuecheng Fan, Tingfan Gao:
A blessing in disguise: Collusion equivalent phenomenon under environmental regulation. 628-631 - Ilan Doron-Arad, Ariel Kulik, Hadas Shachnai:
An FPTAS for budgeted laminar matroid independent set. 632-637 - Yajing Chen, Zhenhua Jiao, Wen Qin, Jinghong Shan:
Fairness and efficiency of the random serial dictatorship on preference domains with a tier structure. 638-642 - Attila Tasnádi:
Mixed-strategy equilibrium of the symmetric production in advance game: The missing case. 643-650 - 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. 651-658 - Xiaohui Yu, Qiang Zhang, Yingying Gao, Chenglin Wang:
Coalition structure value considering the outside alignment option of priori coalition. 659-665 - Meng Li, Paul Grigas, Alper Atamtürk:
On the softplus penalty for large-scale convex optimization. 666-672 - H. Galindo, José Manuel Gallardo, Andrés Jiménez-Losada:
A random arrival rule for airport problems with fuzzy costs. 673-679 - 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. 680-686 - 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. 687-694 - Sarah Kelly, Yuyuan Ouyang, Boshi Yang:
Semidefinite representable reformulations for two variants of the trust-region subproblem. 695-701 - Renan Spencer Trindade, Claudia D'Ambrosio, Antonio Frangioni, Claudio Gentile:
Comparing perspective reformulations for piecewise-convex optimization. 702-708 - Yu Su, Shai Vardi, Xiaoqi Ren, Adam Wierman:
Communication-aware scheduling of precedence-constrained tasks on related machines. 709-716 - James P. Bailey:
On the dimension of the set of yolk centers. 717-722 - 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]. 723-727
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-04-25 17:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
