default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 40
Volume 40, Number 1, January 2012
- Jan Karel Lenstra:
Editorial. 1 - Martina Gancarova, Michael J. Todd:
A robust robust optimization result. 2-5 - Huseyin Onur Mete, Zelda B. Zabinsky:
Pattern Hit-and-Run for sampling efficiently on polytopes. 6-11 - Alejandro Toriello
, George L. Nemhauser:
The value function of an infinite-horizon single-item lot-sizing problem. 12-14 - Binyuan Chen, Simge Küçükyavuz, Suvrajeet Sen:
A computational study of the cutting plane tree algorithm for general mixed-integer linear programs. 15-19 - Sam D. Allen, Edmund K. Burke, Jakub Marecek:
A space-indexed formulation of packing boxes into a larger box. 20-24 - Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho:
On the extremality of maximal dual feasible functions. 25-30 - Samuel Fiorini, Gwenaël Joret:
Approximating the balanced minimum evolution problem. 31-35 - Bodo Manthey:
Multi-criteria TSP: Min and max combined. 36-38 - Tal Raviv, Mor Kaspi:
The locomotive fleet fueling problem. 39-45 - Weifen Zhuang, Michael Z. F. Li:
Dynamic pricing with two revenue streams. 46-51 - Gustavo Bergantiños, María Gómez-Rúa, Natividad Llorca, Manuel A. Pulido, Joaquín Sánchez-Soriano:
A cost allocation rule for k-hop minimum cost spanning tree problems. 52-55 - Konstantin Avrachenkov, Laura Cottatellucci, Lorenzo Maggi:
Algorithms for uniform optimal strategies in two-player zero-sum stochastic games with perfect information. 56-60 - Ling-Chieh Kung, Ying-Ju Chen:
The resource allocation problem for demand forecasting and performance measurement. 61-68
Volume 40, Number 2, March 2012
- Qie He, Shabbir Ahmed, George L. Nemhauser:
Sell or Hold: A simple two-stage stochastic combinatorial optimization problem. 69-73 - Alexandre S. Freire, Eduardo Moreno, Juan Pablo Vielma:
An integer linear programming approach for bilinear integer programming. 74-77 - Georgia Perakis, Wei Sun:
Price of anarchy for supply chains with partial positive externalities. 78-83 - Francesc Llerena:
The pairwise egalitarian solution for the assignment game. 84-88 - Martin I. Reiman, Qiong Wang:
A stochastic program based lower bound for assemble-to-order inventory systems. 89-95 - Meng Li, Jun Zhang:
Does inventory pooling improve customer service levels? 96-98 - Xiuli Chao, Baimei Yang, Yifan Xu:
Dynamic inventory and pricing policy in a capacitated stochastic inventory system with fixed ordering cost. 99-107 - Edwin K. P. Chong, Scott A. Miller, Jason Adaska:
On Bellman's principle with inequality constraints. 108-113 - F. Zeynep Sargut, Lian Qi:
Analysis of a two-party supply chain with random disruptions. 114-122 - Hangjun Yang:
Impact of discounting and competition on benefit of decentralization with strategic customers. 123-127 - Jonathan Y. Li, Roy H. Kwon:
Market price-based convex risk measures: A distribution-free optimization approach. 128-133 - Mounir El Maghri, Bouchaib Radi:
Asymptotical good behavior on inequalities with completely approximate K-T concept. 134-139 - Xiaodong Fan, Caozong Cheng, Haijun Wang:
Density of stable convex semi-infinite vector optimization problems. 140-143 - Majid Soleimani-Damaneh:
On a basic definition of returns to scale. 144-147
Volume 40, Number 3, May 2012
- Laura Galli, Konstantinos Kaparis, Adam N. Letchford:
Complexity results for the gap inequalities for the max-cut problem. 149-152 - Juan Pablo Vielma, Shabbir Ahmed, George L. Nemhauser:
Mixed integer linear programming formulations for probabilistic constraints. 153-158 - Matteo Fischetti, Michele Monaci:
Branching on nonchimerical fractionalities. 159-164 - Utz-Uwe Haus, Frank Pfeuffer:
Split cuts for robust mixed-integer optimization. 165-171 - Tomonari Kitahara, Shinji Mizuno:
On the number of solutions generated by the dual simplex method. 172-174 - Sebastián Marbán, Ruben van der Zwaan, Alexander Grigoriev, Benjamin Hiller, Tjark Vredeveld:
Dynamic pricing problems with elastic demand. 175-179 - Daniel Cole, Sungjin Im, Benjamin Moseley, Kirk Pruhs:
Speed scaling for stretch plus energy. 180-184 - Tatsuaki Kimura, Hiroyuki Masuyama, Yutaka Takahashi:
Heavy-traffic asymptotics for stationary GI/G/1-type Markov chains. 185-189 - O. Fogelklou, Takis Konstantopoulos, Warwick Tucker:
On the global stability of a peer-to-peer network model. 190-194 - Wanmo Kang, Kyoung-Kuk Kim, Hayong Shin:
Denoising Monte Carlo sensitivity estimates. 195-202 - Samuel Burer, Hongbo Dong:
Representing quadratically constrained quadratic programs as generalized copositive programs. 203-206 - Martin Branda:
Sample approximation technique for mixed-integer stochastic programming problems with several chance constraints. 207-211 - Tiago Pascoal Filomena, Miguel A. Lejeune:
Stochastic portfolio optimization with proportional transaction costs: Convex reformulations and computational experiments. 212-217 - Laijun Zhao, Ying Qian, Rongbing Huang, Changmin Li, Jian Xue, Yue Hu:
Model of transfer tax on transboundary water pollution in China's river basin. 218-222
Volume 40, Number 4, July 2012
- Michael P. Atkinson, Moshe Kress:
On popular response to violence during insurgencies. 223-229 - Ward Whitt:
Extending the FCLT version of L=λW. 230-234 - Dieter Fiems, Koen De Turck:
The mean queue content of discrete-time queues with zero-regenerative arrivals. 235-238 - Yutaka Sakuma, Atsushi Inoie:
Stationary distribution of a multi-server vacation queue with constant impatient times. 239-243 - Michael N. Katehakis, Kartikeya S. Puranam:
On optimal bidding in sequential procurement auctions. 244-249 - Yanyi Xu, Arnab Bisi:
Wholesale-price contracts with postponed and fixed retail prices. 250-257 - Shyam S. Chandramouli, Martin B. Haugh:
A unified approach to multiple stopping and duality. 258-264 - Fabien Cornillier, José Eduardo Pécora Junior, Vincent Charles:
A variable depth search branching. 265-271 - Stasys Jukna, Georg Schnitger:
Cutting planes cannot approximate some integer programs. 272-275 - Jochen Gorski, Kathrin Klamroth, Stefan Ruzika:
Generalized multiple objective bottleneck problems. 276-281 - Trivikram Dokka, Anastasia Kouvela, Frits C. R. Spieksma:
Approximating the multi-level bottleneck assignment problem. 282-286 - Cyriel Rutten, Diego Recalde, Petra Schuurman, Tjark Vredeveld:
Performance guarantees of jump neighborhoods on restricted related parallel machines. 287-291 - Ernst Althaus, Daniel Dumitriu:
Certifying feasibility and objective value of linear programs. 292-297 - Amir Beck, Yoel Drori, Marc Teboulle:
A new semidefinite programming relaxation scheme for a class of quadratic matrix problems. 298-302 - Haibin Chen, Yiju Wang, Hongge Zhao:
Finite convergence of a projected proximal point algorithm for the generalized variational inequalities. 303-305 - Martin I. Reiman, Qiong Wang:
Erratum to "A stochastic program based lower bound for assemble-to-order inventory systems" [Oper. Res. Lett. 40(2) (2012) 89-95]. 306
Volume 40, Number 5, September 2012
- Yunan Liu, Ward Whitt:
A many-server fluid limit for the Gt/G//st+G/ queueing model experiencing periods of overloading. 307-312 - Vincent Guigues, Werner Römisch:
SDDP for multistage stochastic linear programs based on spectral risk measures. 313-318 - Bram L. Gorissen, Dick den Hertog:
Approximating the Pareto set of multiobjective linear programs via robust optimization. 319-324 - Jianqiang Cheng, Abdel Lisser:
A second-order cone programming approach for linear programs with joint probabilistic constraints. 325-328 - Ping Heidi Huang, Kwei Tang:
A constructive periodicity bound for the unbounded knapsack problem. 329-331 - Guo-ji Tang, Nan-Jing Huang:
Strong convergence of a splitting proximal projection method for the sum of two maximal monotone operators. 332-336 - Joseph Cheriyan, Chenglong Zou:
On orienting graphs for connectivity: Projective planes and Halin graphs. 337-341 - Stéphanie Vanhove, Veerle Fack:
Route planning with turn restrictions: A computational experiment. 342-348 - T. C. E. Cheng, Hans Kellerer, Vladimir Kotov:
Algorithms better than LPT for semi-online scheduling with decreasing processing times. 349-352 - Han Hoogeveen, Vincent T'kindt:
Minimizing the number of late jobs when the start time of the machine is variable. 353-355 - Eranda Çela, Vladimir G. Deineko, Gerhard J. Woeginger:
Another well-solvable case of the QAP: Maximizing the job completion time variance. 356-359 - Walter Kern, Xian Qiu:
Integrality gap analysis for bin packing games. 360-363 - Mingming Leng, Mahmut Parlar:
Transfer pricing in a multidivisional firm: A cooperative game analysis. 364-369 - Hamideh Esfahani, Luca Lambertini:
The profitability of small horizontal mergers with nonlinear demand functions. 370-373 - Tomohiko Kawamori, Ming Hsin Lin:
The way of offering vertically differentiated airline services. 374-377 - Jianwen Luo, Qinhong Zhang:
Trade credit: A new mechanism to coordinate supply chain. 378-384 - Xin Chen, Peng Hu:
Joint pricing and inventory management with deterministic demand and costly price adjustment. 385-389 - Ayse Akbalik, Christophe Rapine:
Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost. 390-397 - Xiaoming Yan:
Capacity competition under random yield. 398-403 - Zhiyuan Chen, Xiaoying Liang, Haifeng Wang, Houmin Yan:
Inventory rationing with multiple demand classes: The case of group buying. 404-408 - Steven M. Shechter:
Efficient solutions for a class of optimal stopping problems. 409-410 - Steven M. Shechter, Woonghee Tim Huh, Anyu Slofstra:
Simultaneous testing of multicharacteristic components. 411-415 - Ji Hwan Cha, Maxim Finkelstein:
Stochastic analysis of preventive maintenance in heterogeneous populations. 416-421 - Shyam S. Chandramouli, Martin B. Haugh:
Erratum to "A unified approach to multiple stopping and duality" [Oper. Res. Lett. (2012)]. 422-423
Volume 40, Number 6, November 2012
- Alain Bensoussan, Hongwei Long, Sandun C. Perera, Suresh P. Sethi:
Impulse control with random reaction periods: A central bank intervention problem. 425-430 - Linwei Xin, Alexander Shapiro:
Bounds for nested law invariant coherent risk measures. 431-435 - Alexander Shapiro:
Time consistency of dynamic risk measures. 436-439 - Philippe Baptiste, Jacques Carlier, Alexander V. Kononov, Maurice Queyranne, Sergey Sevastyanov, Maxim Sviridenko:
Integer preemptive scheduling on parallel machines. 440-444 - Sergei Chubanov, Erwin Pesch:
An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand. 445-449 - Yury Makarychev:
Simple linear time approximation algorithm for betweenness. 450-452 - Mohan Gopaladesikan, Nelson A. Uhan, Jikai Zou:
A primal-dual algorithm for computing a cost allocation in the core of economic lot-sizing games. 453-458 - Shiran Rachmilevitch:
Gradual negotiations and proportional solutions. 459-461 - Weibin Han, Hao Sun, Genjiu Xu:
A new approach of cooperative interval games: The interval core and Shapley value revisited. 462-468 - Zsombor Z. Méder, János Flesch, Ronald J. A. P. Peeters:
Optimal choice for finite and infinite horizons. 469-474 - Xianwei Zhou, Zhi-mi Cheng, Yan Ding, Fuhong Lin:
A optimal power control strategy based on network wisdom in wireless networks. 475-477 - Vincent Guigues, Claudia A. Sagastizábal:
Exploiting the structure of autoregressive processes in chance-constrained multistage stochastic linear programs. 478-483 - Bernd Gärtner, Markus Sprecher:
A polynomial-time algorithm for the tridiagonal and Hessenberg P-matrix linear complementarity problem. 484-486 - Myoungkuk Park, Kalyanam Krishnamoorthy, Swaroop Darbha, Phillip R. Chandler, Meir Pachter:
State partitioning based linear program for stochastic dynamic programs: An invariance property. 487-491 - Ruxian Wang:
Capacitated assortment and price optimization under the multinomial logit model. 492-497 - Chunyang Tong:
Pricing schemes for congestion-prone service facilities. 498-502 - Lee K. Jones:
Remarks on queue inference from departure data alone and the importance of the queue inference engine. 503-505 - Steven B. Kramer, Arjang A. Assad:
Alternating priority versus FCFS scheduling in a two-class queueing system. 506-509 - Aylin Turhan, Murat Alanyali, David Starobinski:
Optimal admission control in two-class preemptive loss systems. 510-515 - Xiao-song Ding, Ji-hong Zhang, Xi Chen:
A joint pricing and inventory control problem under an energy buy-back program. 516-520 - Martin Haugh, Andrew E. B. Lim:
Linear-quadratic control and information relaxations. 521-528 - Vaithilingam Jeyakumar, Guoyin Li:
Exact SDP relaxations for classes of nonlinear semidefinite programming problems. 529-536 - Bara Kim, Jeongsim Kim:
Exact tail asymptotics for the M/M/m retrial queue with nonpersistent customers. 537-540 - Amir Beck, Shoham Sabach:
An improved ellipsoid method for solving convex differentiable optimization problems. 541-545 - Tal Raviv:
The battery switching station scheduling problem. 546-550 - Dejian Tian, Xinli Suo:
A note on convex risk statistic. 551-553 - Nan Chen, Zhengyu Huang:
Brownian meanders, importance sampling and unbiased simulation of diffusion extremes. 554-563 - Qing-Bang Zhang:
A modified proximal point algorithm with errors for approximating solution of the general variational inclusion. 564-567 - Sara Mattia:
Separating tight metric inequalities by bilevel programming. 568-572 - Bo Zhang, Bert Zwart:
Fluid models for many-server Markovian queues in a changing environment. 573-577 - José Neto:
A simple finite cutting plane algorithm for integer programs. 578-580
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-11-08 00:53 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:
