default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 38
Volume 38, Number 1, January 2010
- Ahmad Al Hanbali
, Onno J. Boxma:
Busy period analysis of the state dependent M/M/1/K queue. 1-6 - Yutaka Sakuma:
Asymptotic behavior for MAP/PH/c queue with shortest queue discipline and jockeying. 7-10 - Jukka Lempa:
A note on optimal stopping of diffusions with a two-sided optimal rule. 11-16 - Gustavo Bergantiños, Leticia Lorenzo, Silvia Lorenzo-Freire:
A characterization of the proportional rule in multi-issue allocation situations. 17-19 - Xiaohu Li, Peng Zhao, Linxiong Li:
Resilience and reliability analysis of P2P network systems. 20-26 - Jiejian Feng, Liming Liu, Yat-wah Wan:
Order-based backorders in multi-item inventory systems. 27-32 - Douglas S. Altner, Özlem Ergun, Nelson A. Uhan:
The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximability. 33-38 - Claudia D'Ambrosio, Andrea Lodi, Silvano Martello:
Piecewise linear approximation of functions of two variables in MILP models. 39-46 - Gabriella Muratore, Ulrich M. Schwarz, Gerhard J. Woeginger:
Parallel machine scheduling with nested job assignment restrictions. 47-50 - Stefan Creemers, Roel Leus, Marc Lambrecht:
Scheduling Markovian PERT networks to maximize the net present value. 51-56 - Marcelo C. P. Santos, Lúcia M. A. Drummond, Eduardo Uchoa:
A distributed dual ascent algorithm for the Hop-constrained Steiner Tree Problem. 57-62 - Sivakumar Rathinam, Raja Sengupta:
3/2-approximation algorithm for two variants of a 2-depot Hamiltonian path problem. 63-68 - Zhentao Li, Adrian Vetta:
Bounds on the cleaning times of robot vacuums. 69-71 - Chongchao Huang, Song Wang:
A power penalty approach to a Nonlinear Complementarity Problem. 72-76
Volume 38, Number 2, March 2010
- Jevgenijs Ivanovs, Michel Mandjes:
First passage of time-reversible spectrally negative Markov additive processes. 77-81 - Arunachalam Chockalingam, Kumar Muthuraman:
Pricing American options when asset prices jump. 82-86 - Michi Nishihara:
Hybrid or electric vehicles? A real options perspective. 87-93 - William Stanford:
Pure strategy Nash equilibria and the probabilistic prospects of Stackelberg players. 94-96 - Chunyang Tong:
Order postponement in a supply chain in the presence of exponential demand with gamma prior. 97-103 - C. Guerrero García, Juan José Saameño Rodríguez, José Muñoz-Pérez:
On the ordered anti-Weber problem for any norm in R2. 104-108 - Sanjeeb Dash:
On the complexity of cutting-plane proofs using split cuts. 109-114 - Daniel G. Espinoza:
Computing with multi-row Gomory cuts. 115-120 - Andrei Horbach:
A combinatorial property of the maximum round robin tournament problem. 121-122 - Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo:
Complexity of a scheduling problem with controllable processing times. 123-126 - Christos Koulamas:
A faster algorithm for a due date assignment problem with tardy jobs. 127-128 - Tamás Kis, Dominique de Werra, Wieslaw Kubiak:
A projective algorithm for preemptive open shop scheduling with two multiprocessor groups. 129-132 - Weiya Zhong, Zhi-Long Chen, Ming Chen:
Integrated production and distribution scheduling with committed delivery dates. 133-138 - Jean-Pierre Crouzeix, Eladio Ocaña Anaya:
Monotone and maximal monotone affine subspaces. 139-142 - Davide La Torre, Nicolae Popovici:
Arcwise cone-quasiconvex multicriteria optimization. 143-146 - Alireza Asadi, Guoyong Gu, Cornelis Roos:
Convergence of the homotopy path for a full-Newton step infeasible interior-point method. 147-151
Volume 38, Number 3, May 2010
- Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli:
Equivalence between intersection cuts and the corner polyhedron. 153-155 - Viswanath Nagarajan, R. Ravi, Mohit Singh:
Simpler analysis of LP extreme points for traveling salesman and survivable network design problems. 156-160 - Vineet Goyal, R. Ravi:
A PTAS for the chance-constrained knapsack problem with random item sizes. 161-164 - Bruno H. Strulovici, Thomas A. Weber:
Additive envelopes of continuous functions. 165-168 - Zhou Xu, Qi Wen:
Approximation hardness of min-max tree covers. 169-173 - Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho:
Theoretical investigations on maximal dual feasible functions. 174-178 - Valentina Cacchiani, Alberto Caprara, Paolo Toth:
Non-cyclic train timetabling and comparability graphs. 179-184 - Judit Nagy-György:
Online coloring graphs with high girth and high odd girth. 185-187 - Vaithilingam Jeyakumar, Guoyin Li:
Characterizing robust set containments and solutions of uncertain linear programs without qualifications. 188-194 - Qiong Tian, Hai Yang, Hai-Jun Huang:
Novel travel cost functions based on morning peak commuting equilibrium. 195-200 - Xiaowei Xu, Yao Zhao:
Price-only contracts with backup supply. 201-206 - Cem Iyigun, Adi Ben-Israel:
A generalized Weiszfeld method for the multi-facility location problem. 207-214 - Doron Chen, Reuven Chen:
A relaxation-based algorithm for solving the conditional p-center problem. 215-217 - Yuanyuan Liu:
Augmented truncation approximations of discrete-time Markov chains. 218-222 - David F. Muñoz:
On the validity of the batch quantile method for Markov chains. 223-226 - Thomas Eichner, Andreas Wagener:
Beneficial changes in dependence structures and two-moment decision models. 227-230 - Jianjun Xu, Shaoxiang Chen, Bing Lin, Rohit Bhatnagar:
Optimal production and rationing policies of a make-to-stock production system with batch demand and backordering. 231-235 - Ying Wang, Fuqing Gao:
Deviation inequalities for an estimator of the conditional value-at-risk. 236-239
- Frits C. R. Spieksma:
Book review. 240
Volume 38, Number 4, July 2010
- Rafael A. Melo, Laurence A. Wolsey:
Uncapacitated two-level lot-sizing. 241-245 - Lihua Sun, L. Jeff Hong:
Asymptotic representations for importance-sampling estimators of value-at-risk and conditional value-at-risk. 246-251 - Lakdere Benkherouf, Suresh P. Sethi:
Optimality of (s, S) policies for a stochastic inventory model with proportional and lump-sum shortage costs. 252-255 - Zhiyuan Chen, Yi Yang:
Optimality of (s, S, p) policy in a general inventory-pricing model with uniform demands. 256-260 - Yun Zhou, Xiaobo Zhao:
A two-demand-class inventory system with lost-sales and backorders. 261-266 - Saif Benjaafar, Jean-Philippe Gayon, Seda Tepe:
Optimal control of a production-inventory system with customer impatience. 267-272 - Murat Kurt, Jeffrey P. Kharoufeh:
Monotone optimal replacement policies for a Markovian deteriorating system in a controllable environment. 273-279 - Amr Farahat, Georgia Perakis:
A nonnegative extension of the affine demand function and equilibrium analysis for multiproduct price competition. 280-286 - Jin Xu:
Duopoly information sharing with differentiated products. 287-291 - Xu-Na Miao, Xian-Wei Zhou, Hua-Yi Wu:
A cooperative differential game model based on transmission rate in wireless networks. 292-295 - Bo van der Rhee, Jack A. A. van der Veen, V. Venugopal, Vijayender Reddy Nalla:
A new revenue sharing mechanism for coordinating multi-echelon supply chains. 296-301 - Lorenza Moreno, Marcus Poggi de Aragão, Eduardo Uchoa:
Improved lower bounds for the Split Delivery Vehicle Routing Problem. 302-306 - Deshi Ye, Guochuan Zhang:
On-line scheduling of multi-core processor tasks with virtualization. 307-311 - Carlo Filippi:
An approximate algorithm for a high-multiplicity parallel machine scheduling problem. 312-317 - Stefan Steinerberger:
A new lower bound for the geometric traveling salesman problem in terms of discrepancy. 318-319 - Christoph Helmberg, Susanna Reiss:
A note on Fiedler vectors interpreted as graph realizations. 320-321 - Anupam Gupta, Viswanath Nagarajan, R. Ravi:
An improved approximation algorithm for requirement cut. 322-325 - Eduardo Conde:
A 2-approximation for minmax regret problems via a mid-point scenario optimal solution. 326-327 - Osman Y. Özaltin, Oleg A. Prokopyev, Andrew J. Schaefer:
The bilevel knapsack problem with stochastic right-hand sides. 328-333 - Kevin K. H. Cheung, Kyle Harvey:
Revisiting a simple algorithm for the planar multiterminal cut problem. 334-336
Volume 38, Number 5, September 2010
- Laura Galli, Adam N. Letchford:
Small bipartite subgraph polytopes. 337-340 - Claudia D'Ambrosio, Antonio Frangioni, Leo Liberti, Andrea Lodi:
On interval-subgradient and no-good cuts. 341-345 - Dominique Feillet, Michel Gendreau, Andrés L. Medaglia, Jose L. Walteros:
A note on branch-and-cut-and-price. 346-353 - Riccardo Cambini, Francesca Salvi:
Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience. 354-357 - Sheng-Long Hu, Zheng-Hai Huang:
Polynomial time solvability of non-symmetric semidefinite programming. 358-360 - Hayato Waki, Masakazu Muramatsu:
A facial reduction algorithm for finding sparse SOS representations. 361-365 - Jordi Castro, Jordi Cuesta:
Existence, uniqueness, and convergence of the regularized primal-dual central path. 366-371 - Shaohua Pan, Yu-Lin Chang, Jein-Shan Chen:
Stationary point conditions for the FB merit function associated with symmetric cones. 372-377 - Wenqi Huang, Tao Ye:
Greedy vacancy search algorithm for packing equal circles in a square. 378-382 - Johannes Hatzl, Andreas Karrenbauer:
A combinatorial algorithm for the 1-median problem in Rd with the Chebyshev norm. 383-385 - Zhen Wang, Donglei Du, Adriana Felicia Gabor, Dachuan Xu:
An approximation algorithm for the k-level stochastic facility location problem. 386-389 - Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan:
Minimizing the sum of weighted completion times in a concurrent open shop. 390-395 - Stanley P. Y. Fung:
Bounded delay packet scheduling in a bounded buffer. 396-398 - Fabrizio Grandoni, Gaia Nicosia, Gianpaolo Oriolo, Laura Sanità:
Stable routing under the Spanning Tree Protocol. 399-404 - Jiafu Tang, Yuan Kong, Henry C. W. Lau, Andrew W. H. Ip:
A note on "Efficient feasibility testing for dial-a-ride problems". 405-407 - H.-C. Hwang, Wikrom Jaruphongsa, Sila Çetinkaya, Chung-Yee Lee:
Capacitated dynamic lot-sizing problem with delivery/production time windows. 408-413 - Zhili Zhou, Yongpei Guan:
Stochastic lot-sizing problem with deterministic demands and Wagner-Whitin costs. 414-419 - Jesse C. Frey, Edward H. Kaplan:
Queue inference from periodic reporting data. 420-426 - Utku Yildirim, John J. Hasenbein:
Admission control and pricing in a queue with batch arrivals. 427-431 - Esa Hyytiä, Samuli Aalto, Aleksi Penttinen, Reijo Sulonen:
A stochastic model for a vehicle in a dial-a-ride system. 432-435 - Harish Krishnan:
A note on demand functions with uncertainty. 436-440 - Yanyi Xu, Arnab Bisi, Maqbool Dada:
New structural properties of (s, S) policies for inventory models with lost sales. 441-449 - Shaoxiang Chen, Jianjun Xu:
Note on the optimality of (s, S) policies for inventory systems with two demand classes. 450-453 - Engin Topan, Z. Pelin Bayindir, Tarkan Tan:
An exact solution procedure for multi-item two-echelon spare parts inventory control problem with batch ordering in the central warehouse. 454-461 - Weifen Zhuang, Michael Z. F. Li:
A new method of proving structural properties for certain class of stochastic dynamic control problems. 462-467 - Ji Hwan Cha, Eui Yong Lee:
An extended stochastic failure model for a system subject to random shocks. 468-473 - Hoi Ying Wong, Jing Zhao:
Valuing American options under the CEV model by Laplace-Carson transforms. 474-481 - Martin Eling, Luisa Tibiletti:
Internal vs. external risk measures: How capital requirements differ in practice. 482-488 - Ming Liu, Jeremy Staum:
Sensitivity analysis of the Eisenberg-Noe model of contagion. 489-491
- Walter Kern:
Book review. 492
Volume 38, Number 6, November 2010
- Amir Beck, Aharon Ben-Tal, Nili Guttmann-Beck, Luba Tetruashvili:
The CoMirror algorithm for solving nonsmooth constrained convex problems. 493-498 - John A. Morrison:
Optimal trunk reservation for an overloaded link. 499-501 - Yusik Kim, Rhonda Righter, Ronald Wolff:
Grid scheduling with NBU service times. 502-504 - M. Mahdi Tajbakhsh, Chi-Guhn Lee, Saeed Zolfaghari:
On the supplier diversification under binomial yield. 505-509 - Mehmet Murat Fadiloglu, Önder Bulut:
An embedded Markov chain approach to stock rationing. 510-515 - Tatsiana Levina, Yuri Levin, Jeff McGill, Mikhail Nediak, Vladimir Vovk:
Weak aggregating algorithm for the distribution-free perishable inventory problem. 516-521 - Lauri Ahlroth, André Schumacher, Harri Haanpää:
On the power of lookahead in online lot-sizing. 522-526 - Vivek S. Borkar, Mrinal K. Ghosh, Govindan Rangarajan:
Application of nonlinear filtering to credit risk. 527-532 - Daisuke Hirata, Toshihiro Matsumura:
On the uniqueness of Bertrand equilibrium. 533-535 - Jens Leth Hougaard, Mich Tvede:
n-person non-convex bargaining: Efficient proportional solutions. 536-538 - Rachel R. Chen, Shuya Yin:
The equivalence of uniform and Shapley value-based cost allocations in a specific game. 539-544 - Bernard Fortz, Michael Poss:
Easy distributions for combinatorial optimization problems with probabilistic constraints. 545-549 - L. Jeff Hong, Barry L. Nelson, Jie Xu:
Speeding up COMPASS for high-dimensional discrete optimization via simulation. 550-555 - Marco Di Summa:
On a class of mixed-integer sets with a single integer variable. 556-558 - Daniel G. Espinoza, Ricardo Fukasawa, Marcos Goycoolea:
Lifting, tilting and fractional programming revisited. 559-563 - Shengning Qiao, Shenggui Zhang:
Vertex-disjoint chorded cycles in a graph. 564-566 - Deeparnab Chakrabarty, Jochen Könemann, David Pritchard:
Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound. 567-570 - Ashish Goel, Mohammad Mahdian, Hamid Nazerzadeh, Amin Saberi:
Advertisement allocation for generalized second-pricing schemes. 571-576 - Gerald Paul:
Comparative performance of tabu search and simulated annealing heuristics for the quadratic assignment problem. 577-581 - Adriana Felicia Gabor, Gerhard J. Woeginger:
How * not * to solve a Sudoku. 582-584 - René Sitters:
Competitive analysis of preemptive single-machine scheduling. 585-588 - Federico Della Croce, Vincent T'kindt:
Improving the preemptive bound for the single machine dynamic maximum lateness problem. 589-591 - Pim van 't Hof, Gerhard F. Post, Dirk Briskorn:
Constructing fair round robin tournaments with a minimum number of breaks. 592-596
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-28 23:55 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:
