default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 41
Volume 41, Number 1, January 2013
- Lauri Ahlroth, André Schumacher, Pekka Orponen
:
Online bin packing with delay and holding costs. 1-6 - Johanna C. Gerdessen, G. D. H. Claassen, Aleksander Banasik:
General 0-1 fractional programming with conditional fractional terms for design of food frequency questionnaires. 7-11 - Wei Zhang, Zhongsheng Hua:
Optimal inventory policy for capacitated systems with two supply sources. 12-18 - Alexandar Angelus, Wanshan Zhu:
On the structure of capacitated assembly systems. 19-26 - R. S. Randhawa:
Accuracy of fluid approximations for queueing systems with congestion-sensitive demand and implications for capacity sizing. 27-31 - Frank M. Muldoon, Warren P. Adams, Hanif D. Sherali:
Ideal representations of lexicographic orderings and base-2 expansions of integer variables. 32-39 - Fatma Gzara:
A cutting plane approach for bilevel hazardous material transport network design. 40-46 - Jeremy Staum:
Excess invariance and shortfall risk measures. 47-53 - Utku Koç, Aysegül Toptal, Ihsan Sabuncuoglu:
A class of joint production and transportation planning problems under different delivery policies. 54-60 - Lu Hsiao, Ying-Ju Chen:
Benefiting from the economic recession? A supply chain perspective. 61-66 - Chun-Hung Chiu, Ngai-Hang Z. Leung, Karthik Natarajan:
New analytical bounds on the average undershoot in an infinite horizon (s, S) inventory system. 67-73 - Valentina Cacchiani, Alberto Caprara, Gábor Maróti, Paolo Toth:
On integer polytopes with few nonzero vertices. 74-77 - Gerd Wachsmuth:
On LICQ and the uniqueness of Lagrange multipliers. 78-80 - Alexandre Salch, Jean-Philippe Gayon, Pierre Lemaire:
Optimal static priority rules for stochastic scheduling with impatience. 81-85 - Yue Dai, Xiuli Chao:
Salesforce contract design and inventory planning with asymmetric risk-averse sales agents. 86-91 - Lanshan Han, Andrew L. Liu:
On Nash-Cournot games with price caps. 92-97 - Mei Choi Chiu, Hoi Ying Wong:
Mean-variance principle of managing cointegrated risky assets and random liabilities. 98-106 - Achal Bassamboo, Leon Yang Chu, Ramandeep S. Randhawa:
Designing flexible systems using a new notion of submodularity. 107-111 - Michael Z. Spivey:
Optimal discounts for the online assignment problem. 112-115 - Alexander Zaigraev, Serguei Kaniovski:
A note on the probability of at least k successes in n correlated binary trials. 116-120
Volume 41, Number 2, March 2013
- James M. Davis, Rajiv Gandhi, Vijay H. Kothari:
Combinatorial algorithms for minimizing the weighted sum of completion times on a single machine. 121-125 - Paolo Serafini:
Combinatorial optimization problems with normal random costs. 126-133 - Retsef Levi, Liron Yedidsion:
NP-hardness proof for the assembly problem with stationary setup and additive holding costs. 134-137 - Hongyu Liang:
The hardness and approximation of the star p-hub center problem. 138-141 - Gérard Cornuéjols, Tamás Kis, Marco Molinaro:
Lifting Gomory cuts with bounded variables. 142-146 - Yanfang Zhang, Shue Mei, Weijun Zhong:
Should R&D risk always be preferable? 147-149 - Vyacheslav M. Abramov:
Characterization theorem on losses in GIX/GIY/1/n queues. 150-152 - Igor Vasilyev, Xenia Klimentova, Maurizio Boccia:
Polyhedral study of simple plant location problem with order. 153-158 - Anand A. Paul, Arda Yenipazarli:
A note on lateral transshipment under point-process driven demand. 159-163 - Helin Wu:
Optimal stopping under g-expectation with constraints. 164-171 - Xi Chen, Saif Benjaafar, Adel Elomri:
The carbon-constrained EOQ. 172-179 - Yang Shen, Tak Kuen Siu:
Pricing variance swaps under a stochastic interest rate and volatility model with regime-switching. 180-187 - Natalia Chernova, Sergey Foss, Bara Kim:
A polling system whose stability region depends on the whole distribution of service times. 188-190 - Vineet Goyal, R. Ravi:
An FPTAS for minimizing a class of low-rank quasi-concave functions over a convex set. 191-196 - Milan J. Stanojevic, Mirko Vujosevic, Bogdana Stanojevic:
On the cardinality of the nondominated set of multi-objective combinatorial optimization problems. 197-200 - Tal Ben-Zvi, Abraham Grosfeld-Nir:
Partially observed Markov decision processes with binomial observations. 201-206 - Shouwei Guo, Liying Kang:
Online scheduling of parallel jobs with preemption on two identical machines. 207-209
Volume 41, Number 3, May 2013
- Renaud Masson, Fabien Lehuédé, Olivier Péton:
Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers. 211-215 - Ruyan Fu, T. C. E. Cheng, C. T. Ng, Jinjiang Yuan:
An optimal online algorithm for single parallel-batch machine scheduling with incompatible job families to minimize makespan. 216-219 - Joke G. Blom, Michel Mandjes:
A large-deviations analysis of Markov-modulated infinite-server queues. 220-225 - Hamed Ghasemieh, Mohammad Ghodsi, Hamid Mahini, Mohammad Ali Safari:
Pricing in population games with semi-rational agents. 226-231 - Ji Hwan Cha, Maxim Finkelstein:
On history-dependent shock models. 232-237 - Wayne Goddard, Ewa M. Kubicka, Grzegorz Kubicki:
An efficient algorithm for stopping on a sink in a directed graph. 238-240 - Asok K. Nanda, Nil Kamal Hazra:
Some results on active redundancy at component level versus system level. 241-245 - Charles N. Glover, Michael O. Ball:
Sparse Monge matrices arising from scheduling problems. 246-248 - Eugene A. Feinberg, Jefferson Huang:
Strong polynomiality of policy iterations for average-cost MDPs modeling replacement and maintenance problems. 249-251 - Miles Lubin, R. Kipp Martin, Cosmin G. Petra, Burhaneddin Sandikçi:
On parallelizing dual decomposition in stochastic integer programming. 252-258 - Yong-Jin Liu, Shiyun Wang, Juhe Sun:
Finding the projection onto the intersection of a closed half-space and a variable box. 259-264 - Yoni Nazarathy, Leonardo Rojas-Nandayapa, Thomas S. Salisbury:
Non-existence of stabilizing policies for the critical push-pull network and generalizations. 265-270 - Jose H. Blanchet, Yixi Shi:
Efficient rare event simulation for heavy-tailed systems via cross entropy. 271-276 - Pengfei Guo, Qingying Li:
Strategic behavior and social optimization in partially-observable Markovian vacation queues. 277-284 - Jun Wang, Peng Wang:
Counterterror measures and economic growth: A differential game. 285-289 - Joseph Y.-T. Leung, Zhi-Long Chen:
Integrated production and distribution with fixed delivery departure dates. 290-293 - Luis Eduardo Neves Gouveia, Juan José Salazar González:
Polynomial-time separation of Enhanced Reverse Multistar inequalities. 294-297 - Katrin Herr, Thomas Rehn, Achill Schürmann:
Exploiting symmetry in integer convex optimization using core points. 298-304 - A. C. C. van Wijk, Ivo J. B. F. Adan, Geert-Jan van Houtum:
Optimal allocation policy for a multi-location inventory system with a quick response warehouse. 305-310 - Anderson Rodrigo de Queiroz, David P. Morton:
Sharing cuts under aggregated forecasts when decomposing multi-stage stochastic programs. 311-316
Volume 41, Number 4, July 2013
- Anshul Gandhi, Mor Harchol-Balter:
M/G/kM/G/k with staggered setup. 317-320 - Satoru Iwata, R. Ravi:
Approximating max-min weighted T-joins. 321-324 - Esa Hyytiä, Samuli Aalto:
To split or not to split: Selecting the right server with batch arrivals. 325-330 - Lilian Markenzon, Christina Fraga Esteves Maciel Waga, Paulo Renato da Costa Pereira, Clícia Valladares Peixoto Friedmann, Abel Rodolfo Garcia Lozano:
An efficient representation of chordal graphs. 331-335 - András Frank, Csaba Király:
Tree-compositions and orientations. 336-342 - Hans Kellerer, Vladimir Kotov:
An efficient algorithm for bin stretching. 343-346 - Sebastian Pokutta, Mathieu Van Vyve:
A note on the extension complexity of the knapsack polytope. 347-350 - Daniel F. Silva, Bo Zhang, Hayriye Ayhan:
Optimal admission control for tandem loss systems with two stations. 351-356 - Endre Boros, Khaled M. Elbassioni, Vladimir Gurvich, Kazuhisa Makino:
On discounted approximations of undiscounted stochastic games and Markov decision processes with limited randomness. 357-362 - Long Wan, Jinjiang Yuan:
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard. 363-365 - W. J. Hurley, Jack Brimberg:
Game theory to a friend's rescue. 366-369 - Marco Locatelli:
Computing the value of the convex envelope of quadratic forms over polytopes through a semidefinite program. 370-372 - Ganesh Janakiraman, Seung Jae Park, Sridhar Seshadri, Qi Wu:
New results on the newsvendor model and the multi-period inventory model with backordering. 373-376 - Zhi-mi Cheng, Xianwei Zhou, Yan Ding, Fuhong Lin:
A wisdom rate allocation scheme in wireless networks. 377-380 - John Gunnar Carlsson, Jianming Shi:
A linear relaxation algorithm for solving the sum-of-linear-ratios problem with lower dimension. 381-389 - Gianpaolo Oriolo, Laura Sanità, Rico Zenklusen:
Network design with a discrete set of traffic matrices. 390-396 - Pengfei Guo, Refael Hassin:
On the advantage of leadership in service pricing competition. 397-402 - He Huang, Hongyan Xu, Robert J. Kauffman, Ning Sun:
Analyzing auction and bargaining mechanisms in e-procurement with supply quality risk. 403-409 - Erbao Cao, Yujie Ma, Can Wan, Mingyong Lai:
Contracting with asymmetric cost information in a dual-channel supply chain. 410-414 - John N. Tsitsiklis, Yunjian Xu:
Profit loss in Cournot oligopolies. 415-420
Volume 41, Number 5, September 2013
- Xing Gao, Weijun Zhong, Shue Mei:
A differential game approach to information security investment under hackers' knowledge dissemination. 421-425 - Tomonari Kitahara, Shinji Mizuno, Jianming Shi:
The LP-Newton method for standard form linear programming problems. 426-429 - Ningxiong Xu, Arthur F. Veinott Jr.:
Sequential stochastic core of a cooperative stochastic programming game. 430-435 - Rodrigo A. Carrasco, Garud Iyengar, Cliff Stein:
Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints. 436-441 - Pierre Bonami, Michele Conforti, Gérard Cornuéjols, Marco Molinaro, Giacomo Zambelli:
Cutting planes from two-term disjunctions. 442-444 - George J. Kyparisis, Christos Koulamas:
On index priority sequencing rules for scheduling with time-dependent job processing times. 445-448 - M. Gloria Fiestras-Janeiro, Ignacio García-Jurado, Ana Meca, Manuel A. Mosquera:
A new cost allocation rule for inventory transportation systems. 449-453 - Bara Kim, Jeongsim Kim, Jerim Kim:
Counterexamples to conjectures on discriminatory processor sharing and generalized processor sharing systems. 454-456 - Bo Zeng, Long Zhao:
Solving two-stage robust optimization problems using a column-and-constraint generation method. 457-461 - Ali Kakhbod:
Pay-to-bid auctions: To bid or not to bid. 462-467 - Oriol Tejada:
Complements and substitutes in generalized multisided assignment economies. 468-473 - Omer Tamuz:
A lower bound on seller revenue in single buyer monopoly auctions. 474-476 - Olga L. Ortiz, Alan L. Erera, Chelsea C. White III:
State observation accuracy and finite-memory policy performance. 477-481 - Talat S. Genc, Georges Zaccour:
Capacity investments in a stochastic dynamic game: Equilibrium characterization. 482-485 - Shmuel Wimer:
On optimal flip-flop grouping for VLSI power minimization. 486-489 - Pengfei Guo, Mingming Leng, Yulan Wang:
A fair staff allocation rule for the capacity pooling of multiple call centers. 490-493 - Alois Geyer, Michael Hanke, Alex Weissensteiner:
Scenario tree generation and multi-asset financial optimization problems. 494-498 - Haris Aziz:
Computation of the random arrival rule for bankruptcy problems. 499-502 - Yu-Hsien Liao:
The coincidences among the semicore and the dominance core. 503-505 - Lishun Zeng, Shinji Mizuno:
Constructing fair single round robin tournaments regarding strength groups with a minimum number of breaks. 506-510 - Kyoung-Sook Moon, Hongjoong Kim:
An adaptive averaging binomial method for option valuation. 511-515 - Martin Branda:
Reformulations of input-output oriented DEA tests with diversification. 516-520 - Lingfei Li, Rafael Mendoza-Arriaga:
Ornstein-Uhlenbeck processes time changed with additive subordinators and their applications in commodity derivative models. 521-525 - Susumu Cato:
The first-order approach to the principal-agent problems under inequality aversion. 526-529 - Alper Sen:
Performance bounds on optimal fixed prices. 530-534 - Yuhang Liu, Zizhuo Wang:
A simple policy for multiple queues with size-independent service times. 535-539 - George J. Kyparisis, Christos Koulamas:
Two-tier equilibria for supply chains with a single manufacturer and multiple asymmetric retailers. 540-544 - Xiaoming Yan, Yong Wang:
A note on supplier diversification under random yield. 545-551 - Pedro J. de Rezende, Flávio Keidi Miyazawa, Anderson T. Sasaki:
A PTAS for the disk cover problem of geometric objects. 552-555 - Hande Yaman:
The splittable flow arc set with capacity and minimum load constraints. 556-558 - Naoyuki Kamiyama:
A note on the serial dictatorship with project closures. 559-561 - Bo van der Rhee, Jack A. A. van der Veen, V. Venugopal, Vijayender Reddy Nalla:
Corrigendum to "A new revenue sharing mechanism for coordinating multi-echelon supply chains" [Oper. Res. Lett. 38(4) (2010) 296-301]. 562 - Zhou Xu, Qi Wen:
Corrigendum to "Approximation hardness of min-max tree covers" [Oper. Res. Lett. 38 (3) (2010) 169-173]. 563
Volume 41, Number 6, November 2013
- Shabbir Ahmed:
A scenario decomposition algorithm for 0-1 stochastic programs. 565-569 - Caroline J. Jagtenberg, Uwe Schwiegelshohn, Marc Uetz:
Analysis of Smith's rule in stochastic machine scheduling. 570-575 - Daya Ram Gaur, Apurva Mudgal, Rishi Ranjan Singh:
Routing vehicles to minimize fuel consumption. 576-580 - L. D. Servi:
Analyzing social media data having discontinuous underlying dynamics. 581-585 - Guo-ji Tang, Nan-Jing Huang:
An inexact proximal point algorithm for maximal monotone vector fields on Hadamard manifolds. 586-591 - Denis Cornaz, V. H. Nguyen:
Kőnig's edge-colouring theorem for all graphs. 592-596 - Jianqiang Cheng, Abdel Lisser:
A completely positive representation of 0-1 linear programs with joint probabilistic constraints. 597-601 - Eduardo Conde:
A minmax regret median problem on a tree under uncertain locations of the demand points. 602-606 - Nicolas Lebert, Frédéric Meunier, Quentin Carbonneaux:
Envy-free two-player mm-cake and three-player two-cake divisions. 607-610 - Timo Berthold:
Measuring the impact of primal heuristics. 611-614 - Zhihan Gao:
An LP-based 32-approximation algorithm for the s-ts-t path graph Traveling Salesman Problem. 615-617 - Michael L. Pinedo, Josh Reed:
The "least flexible job first" rule in scheduling and in queueing. 618-621 - Gabriela Tavares, Panos Parpas:
On the information-based complexity of stochastic programming. 622-626 - Srikrishna Sridhar, Jeff T. Linderoth, James R. Luedtke:
Locally ideal formulations for piecewise linear functions with indicator variables. 627-632 - Vladimir G. Deineko, Bettina Klinz, Gerhard J. Woeginger:
Uniqueness in quadratic and hyperbolic 0-1 programming problems. 633-635 - Alexey Y. Golubin:
On Pareto optimality conditions in the case of two-dimension non-convex utility space. 636-638 - Adam Kasperski, Pawel Zielinski:
Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion. 639-643 - Mauro Castelli, Stefano Beretta, Leonardo Vanneschi:
A hybrid genetic algorithm for the repetition free longest common subsequence problem. 644-649 - Yunshu Gao, Ding Ma:
Disjoint cycles with different length in 4-arc-dominated digraphs. 650-653 - Sercan Yildiz, Juan Pablo Vielma:
Incremental and encoding formulations for Mixed Integer Programming. 654-658 - Vahid Sarhangian, Baris Balcioglu:
A first passage time problem for spectrally positive Lévy processes and its application to a dynamic priority queue. 659-663 - Lauri Häme, Harri Hakula:
Routing by ranking: A link analysis method for the constrained dial-a-ride problem. 664-669 - Chung-Yee Lee, Xi Li:
Economic lot sizing: The capacity reservation model. 670-674 - F. Javier Martínez-de-Albéniz, Carles Rafels, Neus Ybern:
A procedure to compute the nucleolus of the assignment game. 675-678 - Yan Shu, Sunil Chopra, Ellis L. Johnson, Sangho Shim:
Binary group facets with complete support and non-binary coefficients. 679-684 - Cristina Bazgan, Sonia Toubaline, Daniel Vanderpooten:
Critical edges for the assignment problem: Complexity and exact resolution. 685-689 - Peng Zhao, Ping Shing Chan, Long Li, Hon Keung Tony Ng:
On allocation of redundancies in two-component series systems. 690-693 - Sean W. Jewell, Yang Li, Traian A. Pirvu:
Non-linear equity portfolio variance reduction under a mean-variance framework - A delta-gamma approach. 694-700 - Anja Fischer, Frank Fischer:
Complete description for the spanning tree problem with one linearised quadratic term. 701-705 - Jun Wang, Feng Chen:
Feedback saddle point solution of counterterror measures and economic growth game. 706-709 - Igor Averbakh, Mehmet Baysan:
Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem. 710-714 - Anh Ninh, András Prékopa:
The discrete moment problem with fractional moments. 715-718 - Jian Li, Xiaowei Xu:
Optimality of (s, S)-policies in a dynamic pricing model with replenishment opportunities: A sample path approach. 719-725 - Thomas DuBois, Georges Allaert, Frank Witlox:
Determining the fill rate for a periodic review inventory policy with capacitated replenishments, lost sales and zero lead time. 726-729 - Jose H. Blanchet, Michel Mandjes:
Asymptotics of the area under the graph of a Lévy-driven workload process. 730-736
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-12-05 22:37 CET 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:
