Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 37
Volume 37, Number 1, January 2009
- Amir Beck, Aharon Ben-Tal:
Duality in robust optimization: Primal worst equals dual best. 1-6 - Archis Ghate, Robert L. Smith:
Characterizing extreme points as basic feasible solutions in infinite linear programs. 7-10 - David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook, Daniel G. Espinoza, Marcos Goycoolea
, Keld Helsgaun:
Certification of an optimal TSP tour through 85, 900 cities. 11-15 - Pasquale Avella, Maurizio Boccia, Igor Vasil'ev:
Computational experience with general cutting planes for the Set Covering problem. 16-20 - Giacomo Zambelli:
On degenerate multi-row Gomory cuts. 21-22 - Jochen Gorski, Stefan Ruzika:
On k-max-optimization. 23-26 - Nebojsa Gvozdenovic, Monique Laurent, Frank Vallentin:
Block-diagonal semidefinite programming hierarchies for 0/1 programming. 27-31 - Céline Gicquel, Michel Minoux, Yves Dallery:
On the discrete lot-sizing and scheduling problem with sequence-dependent changeover times. 32-36 - David Soler, José Albiach, Eulalia Martínez:
A way to optimally solve a time-dependent Vehicle Routing Problem with Time Windows. 37-42 - Amr Farahat, Georgia Perakis:
Profit loss in differentiated oligopolies. 43-46 - Chia-Li Wang, Ronald W. Wolff:
Loss probability properties in retrial queues. 47-50 - Yair Carmon, Adam Shwartz:
Markov decision processes with exponentially representable discounting. 51-55 - Xiaohu Li, Rongfang Yan, Ming Jian Zuo:
Evaluating a warm standby system with components having proportional hazard rates. 56-60 - Elvira Hernández, Luis Rodríguez-Marín, Miguel Sama:
Some equivalent problems in set optimization. 61-64 - Jaya Singhal, Kalyan Singhal:
On the noniterative multiproduct multiperiod production planning method. 65-66 - Ruud H. Teunter:
Note on the fill rate of single-stage general periodic review inventory systems. 67-68 - Yasemin Serin:
Comments on: "A policy improvement method for constrained average Markov decision processes" [ORL 35 (2007) 434-438]. 69
Volume 37, Number 2, March 2009
- Fernanda Salazar, Martin Skutella:
Single-source k-splittable min-cost flows. 71-74 - Joanna Bauer, Dag Haugland, Di Yuan:
A fast local search method for minimum energy broadcast in wireless ad hoc networks. 75-79 - Christian Eggermont, Cor A. J. Hurkens, Maciej Modelski, Gerhard J. Woeginger:
The hardness of train rearrangements. 80-82 - Christian Engels, Bodo Manthey:
Average-case approximation ratio of the 2-opt algorithm for the TSP. 83-84 - Wei Yu, Zhaohui Liu:
Vehicle routing problems on a line-shaped network with release time constraints. 85-88 - Ling Gai, Guochuan Zhang:
Hardness of lazy packing and covering. 89-92 - József Békési, Gábor Galambos, Marcus Oswald, Gerhard Reinelt:
Improved analysis of an algorithm for the coupled task problem with UET jobs. 93-96 - Guosong Yu, Guochuan Zhang:
Scheduling with a minimum number of machines. 97-101 - Wilco van den Heuvel, Albert P. M. Wagelmans:
A holding cost bound for the economic lot-sizing problem with time-invariant cost parameters. 102-106 - Dachuan Xu, Ruichun Yang:
A cost-sharing method for an economic lot-sizing game. 107-110 - Kyungsik Lee, Kyungchul Park, Sungsoo Park:
A compact formulation of the ring loading problem with integer demand splitting. 111-113 - Lizhi Wang:
Cutting plane algorithms for the inverse mixed integer linear programming problem. 114-116 - Changsheng Zhang, Jiaxu Ning, Shuai Lu, Dantong Ouyang, Tienan Ding:
A novel hybrid differential evolution and particle swarm optimization algorithm for unconstrained optimization. 117-122 - Mathieu Tracol:
Fast convergence to state-action frequency polytopes for MDPs. 123-126 - Ning Cai:
On first passage times of a hyper-exponential jump diffusion process. 127-134 - Roberto Tadei, Nicoletta Ricciardi, Guido Perboli:
The stochastic p-median problem with unknown cost probability distribution. 135-141
Volume 37, Number 3, May 2009
- Alexander Shapiro:
On a time consistency concept in risk averse multistage stochastic programming. 143-147 - Ulas Özen, Marco Slikker, Henk Norde:
A general framework for cooperation under uncertainty. 148-154 - Deeparnab Chakrabarty, Nikhil R. Devanur:
On competitiveness in uniform utility allocation markets. 155-158 - Karthik S. Gurumoorthy, Arunava Banerjee, Anand A. Paul:
Dynamics of 2-worker bucket brigade assembly line with blocking and instantaneous walk-back. 159-162 - Ning Cai, Nan Chen, Xiangwei Wan:
Pricing double-barrier options under a flexible jump diffusion model. 163-167 - Olga Gluchshenko, Horst W. Hamacher, Arie Tamir:
An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width. 168-170 - P. M. Dearing, Christiane R. Zeck:
A dual algorithm for the minimum covering ball problem in Rn. 171-175 - Markus Bläser, L. Shankar Ram, Maxim Sviridenko:
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems. 176-180 - Qiaoming Han, Abraham P. Punnen, Yinyu Ye:
An edge-reduction algorithm for the vertex cover problem. 181-186 - M. Selim Akturk, Alper Atamtürk, Sinan Gurel:
A strong conic quadratic reformulation for machine-job assignment with controllable processing times. 187-191 - Agostinho Agra, Luis Eduardo Neves Gouveia, Cristina Requejo:
Extended formulations for the cardinality constrained subtree of a tree problem. 192-196 - Maria Grazia Scutellà:
On improving optimal oblivious routing. 197-200 - Daniele Pretolani, Lars Relund Nielsen, Kim Allan Andersen, Matthias Ehrgott:
Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks. 201-205 - Antonio Frangioni, Claudio Gentile:
A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes. 206-210 - Patrice Marcotte, Daoli Zhu:
Existence and computation of optimal tolls in multiclass network equilibrium problems. 211-214 - Luce Brotcorne, Saïd Hanafi, Raïd Mansi:
A dynamic programming algorithm for the bilevel knapsack problem. 215-218 - Mehdi Dehghan, Masoud Hajarian:
Convergence of SSOR methods for linear complementarity problems. 219-223
Volume 37, Number 4, July 2009
- Zhixin Liu:
Complexity of core allocation for the bin packing game. 225-229 - Paat Rusmevichientong, Zuo-Jun Max Shen, David B. Shmoys:
A PTAS for capacitated sum-of-ratios optimization. 230-238 - Nir Halman, Chung-Lun Li, David Simchi-Levi:
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks. 239-244 - Carol A. Meyers, Andreas S. Schulz:
Integer equal flows. 245-249 - Fatma Kilinç-Karzan, Alejandro Toriello, Shabbir Ahmed, George L. Nemhauser, Martin W. P. Savelsbergh:
Approximating the stability region for binary mixed-integer programs. 250-254 - Emilie Danna, David L. Woodruff:
How to select a small set of diverse solutions to mixed integer programming problems. 255-260 - Paolo Detti, Cor A. J. Hurkens, Alessandro Agnetis, Gianfranco Ciaschetti:
Optimal packet-to-slot assignment in mobile telecommunications. 261-264 - Kurtulus B. Öner, Gudrun P. Kiesmüller, Geert-Jan van Houtum:
Monotonicity and supermodularity results for the Erlang loss system. 265-268 - Derek R. Atkins, Xuan Zhao:
On the modeling of demand spill for a stochastic demand system under competition. 269-272 - Seray Aydin, Yalçin Akçay, Fikri Karaesmen:
On the structural properties of a discrete-time single product revenue management problem. 273-279 - Murat Kurt, Lisa M. Maillart:
Structured replacement policies for a Markov-modulated shock model. 280-284 - Demet Batur, David Goldsman, Seong-Hee Kim:
An improved standardized time series Durbin-Watson variance estimator for steady-state simulation. 285-289 - Bernardetta Addis, Werner Schachinger:
Improved bounds for interatomic distance in Morse clusters. 290-294 - Enrico Miglierina, Elena Molho:
Sectionwise connected sets in vector optimization. 295-298
Volume 37, Number 5, September 2009
- David J. Aldous, Colin McDiarmid, Alex D. Scott:
Uniform multicommodity flow through the complete graph with random edge-capacities. 299-302 - Arie Tamir:
New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems. 303-306 - Predrag R. Jelenkovic, Ana Radovanovic:
Asymptotic optimality of the static frequency caching in the presence of correlated requests. 307-311 - Tolga Tezcan:
Instability of FIFO in a simple queueing system with arbitrarily low loads. 312-316 - Xianping Guo, XinYuan Song, Junyu Zhang:
Bias optimality for multichain continuous-time Markov decision processes. 317-321 - Xiaoming Yan, Ke Liu:
An inventory system with two suppliers and default risk. 322-326 - Michael Z. F. Li, Weifen Zhuang:
Risk-sensitive dynamic pricing for a single perishable product. 327-332 - Yuichi Nagata, Olli Bräysy:
A powerful route minimization heuristic for the vehicle routing problem with time windows. 333-338 - MohammadHossein Bateni, Mohammad Taghi Hajiaghayi:
A note on the subadditive network design problem. 339-344 - Attila Bernáth, Tamás Király:
Covering skew-supermodular functions by hypergraphs of minimum total size. 345-350 - Nicola Apollonio, Massimiliano Caramia:
A superclass of Edge-Path-Tree graphs with few cliques. 351-355 - Peter Szabó:
A short note on the weighted sub-partition mean of integers. 356-358 - Bernard Fortz, Michael Poss:
An improved Benders decomposition applied to a multi-layer network design problem. 359-364 - Gerardo Berbeglia:
The counting complexity of a simple scheduling problem. 365-367 - Zhongjun Tian, C. T. Ng, T. C. Edwin Cheng:
Preemptive scheduling of jobs with agreeable due dates on a single machine to minimize total tardiness. 368-374
Volume 37, Number 6, November 2009
- Manoel B. Campêlo, Gérard Cornuéjols:
Stable sets, corner polyhedra and the Chvátal closure. 375-378 - Michele Conforti, Giacomo Zambelli:
The mixing set with divisible capacities: A simple approach. 379-383 - Ravi Kannan, Luis Rademacher:
Optimization of a convex program with a polynomial perturbation. 384-386 - Jonathan P. Caulkins, Gustav Feichtinger, Dieter Grass, Gernot Tragler:
Optimal control of terrorism and global reputation: A case study with novel threshold behavior. 387-391 - Christian H. Christiansen, Jens Lysgaard, Sanne Wøhlk:
A Branch-and-Price Algorithm for the Capacitated Arc Routing Problem with Stochastic Demands. 392-398 - Chung-Yee Lee, Xiangtong Qi:
Vehicle scheduling with combinable delivery and pickup operations. 399-404 - Nodari Vakhania:
Scheduling jobs with release times preemptively on a single machine to minimize the number of late jobs. 405-410 - Guangwu Liu, L. Jeff Hong:
Revisit of stochastic mesh method for pricing American options. 411-414 - Arnab Basu, Mrinal K. Ghosh:
Asymptotic analysis of option pricing in a Markov modulated market. 415-419 - Pengfei Guo, John J. Liu, Yulan Wang:
Intertemporal service pricing with strategic customers. 420-424 - Alain Bensoussan, Anshuman Chutani, Suresh P. Sethi:
Optimal cash management under uncertainty. 425-429 - Ying-Ju Chen:
Monotonicity in the stock competition game with consumer search. 430-432 - Kevin H. Shang, Sean X. Zhou:
A simple heuristic for echelon (r, nQ, T) policies in serial supply chains. 433-437 - Josep Freixas, María Albina Puente:
Consecutive expansions of k-out-of-n systems. 438-442 - Ju-Liang Zhang, Chung-Yee Lee, Jian Chen:
Inventory control problem with freight cost and stochastic demand. 443-446 - Qiang Zhen, Charles Knessl:
On sojourn times in the finite capacity M/M/1 queue with processor sharing. 447-450
a service of 
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 2024-04-24 23:19 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:
