default search action
Operations Research Letters, Volume 42
Volume 42, Number 1, January 2014
- Amir Beck, Marc Teboulle:
A fast dual proximal gradient algorithm for convex minimization and applications. 1-6 - Erim Kardes:
On discounted stochastic games with incomplete information on payoffs and a security application. 7-11 - Daniel Granot, Yigal Gerchak:
An auction with positive externality and possible application to overtime rules in football, soccer, and chess. 12-15 - Amitabh Basu, R. Kipp Martin, Christopher Thomas Ryan:
On the sufficiency of finite support duals in semi-infinite linear programming. 16-20 - Alix Munier Kordon, Djamal Rebaine:
The coupled unit-time operations problem on identical parallel machines with respect to the makespan. 21-26 - Daniel Wei-Chung Miao, Xenos Chang-Shuo Lin, Wan-Ling Chao:
Option pricing under jump-diffusion models with mean-reverting bivariate jumps. 27-33 - Vaithilingam Jeyakumar, T. S. Pham, Guoyin Li:
Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness. 34-40 - Sila Çetinkaya, Fatih Mutlu, Bo Wei:
On the service performance of alternative shipment consolidation policies. 41-47 - Vikas Vikram Singh, N. Hemachandra:
A characterization of stationary Nash equilibria of constrained stochastic games with independent state processes. 48-52 - Neil S. Walton:
Two queues with non-stochastic arrivals. 53-57 - Jung Woo Baek, Ho Woo Lee, Se Won Lee, Soohan Ahn:
A workload factorization for BMAP/G/1 vacation queues under variable service speed. 58-63 - David Hirschmann:
Optimal quality provision when reputation is subject to random inspections. 64-69 - Xin Geng, Woonghee Tim Huh, Mahesh Nagarajan:
Sequential resource allocation with constraints: Two-customer case. 70-75 - Nelson A. Uhan:
The complexity of egalitarian mechanisms for linear programming games. 76-81 - Alejandro Toriello, Nelson A. Uhan:
Dynamic cost allocation for economic lot sizing games. 82-84 - Sameh S. Askar:
Complex dynamic properties of Cournot duopoly games with convex and log-concave demand function. 85-90 - László A. Végh, Giacomo Zambelli:
A polynomial projection-type algorithm for linear programming. 91-96 - Golbon Zakeri, D. Craigie, Andy Philpott, M. Todd:
Optimization of demand response through peak shaving. 97-101 - Moshe Kress, Niall J. MacKay:
Bits or shots in combat? The generalized Deitchman model of guerrilla warfare. 102-108
Volume 42, Number 2, March 2014
- Oren Gal, Eilon Solan:
Robust optimal strategies in Markov decision problems. 109-112 - Joseph Armel Momo Kenfack, Bertrand Tchantcho:
On the non-emptiness of the one-core and the bargaining set of committee games. 113-118 - Arieh Gavious, Yizhaq Minchuk:
Revenue in contests with many participants. 119-122 - Yonghui Huang, Zhongfei Li, Xianping Guo:
Constrained optimality for finite horizon semi-Markov decision processes in Polish spaces. 123-129 - Eugene A. Feinberg, Jefferson Huang:
The value iteration algorithm is not strongly polynomial for discounted dynamic programming. 130-131 - Nil Kamal Hazra, Asok K. Nanda:
Some results on series and parallel systems of randomized components. 132-136 - Robert D. Carr, Giuseppe Lancia:
Ramsey theory and integrality gap for the independent set problem. 137-139 - Attahiru Sule Alfa:
Some decomposition results for a class of vacation queues. 140-144 - Gyoocheol Shim, Yong Hyun Shin:
An optimal job, consumption/leisure, and investment policy. 145-149 - Pan Zhang, Yu Xiong, Zhongkai Xiong, Wei Yan:
Designing contracts for a closed-loop supply chain under information asymmetry. 150-155 - João Gouveia, James Pfeiffer:
A semidefinite approach to the Ki-cover problem. 156-160 - Huseyin Tunc, Onur A. Kilic, S. Armagan Tarim, Burak Eksioglu:
A reformulation for the stochastic lot sizing problem with service-level constraints. 161-165 - André Berger, Alexander Grigoriev, Pinar Heggernes, Ruben van der Zwaan:
Scheduling unit-length jobs with precedence constraints of small height. 166-172 - José R. Correa, Roger Lederman, Nicolás E. Stier Moses:
Sensitivity analysis of markup equilibria in complementary markets. 173-179 - Bara Kim, Jeongsim Kim:
A batch arrival Mx/M/c queue with impatient customers. 180-185 - Rodolfo Carvajal, Shabbir Ahmed, George L. Nemhauser, Kevin C. Furman, Vikas Goel, Yufen Shao:
Using diversification, communication and parallelism to solve mixed-integer linear programs. 186-189 - Annalisa Fabretti, Stefano Herzel, Mustafa Ç. Pinar:
Delegated portfolio management under ambiguity aversion. 190-195
Volume 42, Number 3, May 2014
- Jian Li, Tianlin Shi:
A fully polynomial-time approximation scheme for approximating a sum of random variables. 197-202 - Eline De Cuypere, Koen De Turck, Dieter Fiems:
A Maclaurin-series expansion approach to multiple paired queues. 203-207 - Seyoung Park, Bong-Gyu Jang:
Optimal retirement strategy with a negative wealth constraint. 208-212 - Marco Sagliano:
Performance analysis of linear and nonlinear techniques for automatic scaling of discretized control problems. 213-216 - Gail Gilboa-Freedman, Refael Hassin:
Regulation under partial cooperation: The case of a queueing system. 217-221 - Edouard Bonnet, Vangelis Th. Paschos:
Parameterized (in)approximability of subset problems. 222-225 - Wuhua Hu, Wee Peng Tay:
An integer linear programming approach for a class of bilinear integer programs. 226-230 - Anna Jaskiewicz, Janusz Matkowski, Andrzej S. Nowak:
Generalised discounting in dynamic programming with unbounded returns. 231-233 - Matan Shnaiderman, Fouad El Ouardighi:
The impact of partial information sharing in a two-echelon supply chain. 234-237 - Ilbin Lee, Marina A. Epelman, H. Edwin Romeijn, Robert L. Smith:
Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space. 238-245 - Shiran Rachmilevitch:
Efficiency-free characterizations of the Kalai-Smorodinsky bargaining solution. 246-249
Volume 42, Number 4, June 2014
- Giovanni Andreatta, Luigi De Giovanni, Paolo Serafini:
Optimal shift coloring of trees. 251-256 - Bara Kim, Jeongsim Kim:
Optimal admission control for two station tandem queues with loss. 257-262 - Majid Taghavi, Kai Huang:
Stochastic capacity expansion with multiple sources of capacity. 263-267 - Guillermo Cabrera-Guerrero, Matthias Ehrgott, Andrew J. Mason, Andy Philpott:
Multi-objective optimisation of positively homogeneous functions and an application in radiation therapy. 268-272 - Xiaobing Zhao, Xian Zhou:
Copula-based dependence between frequency and class in car insurance with excess zeros. 273-277 - Chaoyue Zhao, Yongpei Guan:
Extended formulations for stochastic lot-sizing problems. 278-283 - Nitin Gupta, Somesh Kumar:
Stochastic comparisons of component and system redundancies with dependent components. 284-289 - René van Bevern, Sepp Hartung, André Nichterlein, Manuel Sorge:
Constant-factor approximations for Capacitated Arc Routing without triangle inequality. 290-292 - Jamol Pender:
A Poisson-Charlier approximation for nonstationary queues. 293-298
Volume 42, Number 5, July 2014
- Andrew E. B. Lim, Poomyos Wimonkittiwat:
Dynamic portfolio selection with market impact costs. 299-306 - Gábor Braun, Sebastian Pokutta:
A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set. 307-310 - Ward Whitt:
The steady-state distribution of the Mt/m/∞ queue with a sinusoidal arrival rate function. 311-318 - Guang Li, Paat Rusmevichientong:
A greedy algorithm for the two-level nested logit model. 319-324 - Ji Hwan Cha, Maxim Finkelstein:
On some conditional characteristics of hazard rate processes induced by external shocks. 325-331 - Shmuel Wimer, Doron Gluzer, Uri Wimer:
Using well-solvable minimum cost exact covering for VLSI clock energy minimization. 332-336 - Yang Shen, Xin Zhang, Tak Kuen Siu:
Mean-variance portfolio selection under a constant elasticity of variance model. 337-342 - Óscar C. Vásquez:
On the complexity of the single machine scheduling problem minimizing total weighted delay penalty. 343-347 - Lin Chen, Deshi Ye, Guochuan Zhang:
An improved lower bound for rank four scheduling. 348-350 - Ngo Dac Tan:
Vertex disjoint cycles of different lengths in d-arc-dominated digraphs. 351-354 - Mauro Castelli, Leonardo Vanneschi:
Genetic algorithm with variable neighborhood search for the optimal allocation of goods in shop shelves. 355-360 - Kazuo Murota, Akiyoshi Shioura:
Exact bounds for steepest descent algorithms of L-convex function minimization. 361-366 - Retsef Levi, Georgia Perakis, Gonzalo Romero:
A continuous knapsack problem with separable convex utilities: Approximation algorithms and applications. 367-373 - Uladzimir Rubasheuski, Johan Oppen, David L. Woodruff:
Multi-stage scenario generation by the combined moment matching and scenario reduction method. 374-377
Volume 42, Numbers 6-7, September 2014
- Jin Xu, Jianghua Zhang, Jianliang Wu:
Quantity strategies in economic networks. 379-382 - Guo-ji Tang, Nan-Jing Huang:
Rate of convergence for proximal point algorithms on Hadamard manifolds. 383-387 - Zhenghua Long, Jiheng Zhang:
Convergence to equilibrium states for fluid models of many-server queues with abandonment. 388-393 - Jeremy Chen:
Weighing the "heaviest" Polya urn. 394-397 - Didier Aussel, Joydeep Dutta:
Addendum to "Generalized Nash equilibrium problem, variational inequality and quasiconvexity" [Oper. Res. Letters 36 (4) (2008) 461-464]. 398 - Li Jiang, Zhongyuan Hao:
On the value of information sharing and cooperative price setting. 399-403 - Stephen E. Wright, James J. Rohal:
Solving the continuous nonlinear resource allocation problem with an interior point method. 404-408 - Jim (Junmin) Shi, Yao Zhao:
Component commonality under no-holdback allocation rules. 409-413 - Peiyu Luo, Lihui Bai, Jiang Zhang, Ryan Gill:
A computational study on fill rate expressions for single-stage periodic review under normal demand and constant lead time. 414-417 - Avishai Mandelbaum, Petar Momcilovic:
Performance-based routing. 418-423 - Timm Oertel, Christian Wagner, Robert Weismantel:
Integer convex minimization by mixed integer linear optimization. 424-428 - Eugene A. Feinberg, Jefferson Huang, Bruno Scherrer:
Modified policy iteration algorithms are not strongly polynomial for discounted dynamic programming. 429-431 - Victor Magron, Didier Henrion, Jean-Bernard Lasserre:
Approximating Pareto curves using semidefinite relaxations. 432-437 - Behzad Hezarkhani, Wieslaw Kubiak, Bruce Hartman:
Asymptotic behavior of optimal quantities in symmetric transshipment coalitions. 438-443 - Li Jiang, Zhongyuan Hao:
Alleviating supplier's capital restriction by two-order arrangement. 444-449 - Rico Zenklusen:
Connectivity interdiction. 450-454 - Yigal Gerchak, Dina Smirnov:
Evaluating the effect of sub-optimality. 455-457 - Ward Whitt:
Heavy-traffic limits for queues with periodic arrival processes. 458-461 - Sonika Arora, Neelima Gupta, Samir Khuller, Yogish Sabharwal, Swati Singhal:
Facility location with red-blue demands. 462-465 - Mourad Baïou, Francisco Barahona:
On a connection between facility location and perfect graphs. 466-472 - Kyle Y. Lin, Niall J. MacKay:
The optimal policy for the one-against-many heterogeneous Lanchester model. 473-477 - Weining Kang:
Existence and uniqueness of a fluid model for many-server queues with abandonment. 478-483 - Young-Soo Myung, Ilkyeong Moon:
A network flow model for the optimal allocation of both foldable and standard containers. 484-488
Volume 42, Number 8, December 2014
- Lan Yi, Xianping Wu, Xun Li, Xiangyu Cui:
A mean-field formulation for optimal multi-period mean-variance portfolio selection with an uncertain exit time. 489-494 - Stefan Hougardy:
On the integrality ratio of the subtour LP for Euclidean TSP. 495-499 - Bertrand Hellion, Fabien Mangione, Bernard Penz:
A polynomial time algorithm for the single-item lot sizing problem with capacities, minimum order quantities and dynamic time windows. 500-504 - Behzad Hezarkhani, Marco Slikker, Tom Van Woensel:
On characterization of the core of lane covering games via dual solutions. 505-508 - Peng Wu, Xiuli Chao, Jian Chen:
On the replenishment policy considering less expensive but non-committed supply. 509-513 - Debdas Ghosh, Debjani Chakraborty:
A new Pareto set generating method for multi-criteria optimization problems. 514-521 - A. Mahmodinejad, D. Foroutannia:
Piecewise equitable efficiency in multiobjective programming. 522-526 - Chihoon Lee, Amy R. Ward:
Optimal pricing and capacity sizing for the GI/GI/1 queue. 527-531 - Daniel Zhuoyu Long, Jin Qi:
Distributionally robust discrete optimization with Entropic Value-at-Risk. 532-538 - Kangbok Lee, Joseph Y.-T. Leung, Michael L. Pinedo:
Two dimensional load balancing. 539-544 - Xiaoming Yan, Yong Wang:
Optimality of two-sided (σ, Σ) policy in capacity expansion problem. 545-548 - Karen I. Aardal, Pierre Le Bodic:
Approximation algorithms for the transportation problem with market choice and related models. 549-552 - Jean Bertrand Gauthier, Jacques Desrosiers, Marco E. Lübbecke:
Decomposition theorems for linear programs. 553-557 - Shmuel Onn:
Robust integer programming. 558-560
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.