default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOperations Research Letters, Volume 43
Volume 43, Number 1, January 2015
- Cristina Bazgan, Florian Jamain, Daniel Vanderpooten
:
Approximate Pareto sets of minimal size for multi-objective optimization problems. 1-6 - Julián Mestre:
On the intersection of independence systems. 7-9 - Sina Modaresi, Mustafa R. Kilinç, Juan Pablo Vielma:
Split cuts and extended formulations for Mixed Integer Conic Quadratic Programming. 10-15 - Adam Kasperski, Adam Kurpisz, Pawel Zielinski:
Approximability of the robust representatives selection problem. 16-19 - Kyoung-Kuk Kim, Michael K. Lim:
R&D outsourcing in an innovation-driven supply chain. 20-25 - Babak Haji, Sheldon M. Ross:
M/G/∞ with exponentially distributed setup times. 26-28 - Ruichen (Richard) Sun, Oleg V. Shylo, Andrew J. Schaefer:
Totally unimodular multistage stochastic programs. 29-33 - Tri-Dung Nguyen:
The fairest core in cooperative games with transferable utilities. 34-39 - Jamol Pender:
The truncated normal distribution: Applications to queues with impatient customers. 40-45 - Santanu Dey, Sandeep Juneja, Karthyek R. A. Murthy:
Incorporating views on marginal distributions in the calibration of risk models. 46-51 - Qihang Lin, Xi Chen, Javier Peña:
A trade execution model under a composite dynamic coherent risk measure. 52-58 - Jinho Lee, John J. Hasenbein, David P. Morton:
Optimization of stochastic virus detection in contact networks. 59-64 - Xin Chen, Xiangyu Gao, Zhenyu Hu:
A new approach to two-location joint inventory and transshipment control via L♮-convexity. 65-68 - Marco Di Summa:
A short convex-hull proof for the all-different system with the inclusion property. 69-73 - Utz-Uwe Haus:
Bounding stochastic dependence, joint mixability of matrices, and multidimensional bottleneck assignment problems. 74-79 - Yuan Gao, Jinjiang Yuan:
A note on Pareto minimizing total completion time and maximum cost. 80-82 - Qingda Wei, Xian Chen:
Constrained stochastic games with the average payoff criteria. 83-88 - Naoyuki Kamiyama:
The nucleolus of arborescence games in directed acyclic graphs. 89-92 - Martin Groß, Martin Skutella:
A tight bound on the speed-up through storage for quickest multi-commodity flows. 93-95 - Nguyen L. Truong:
A note on the optimal stopping parking problem. 96-98 - Sebastian Bervoets, Vincent Merlin, Gerhard J. Woeginger:
Vote trading and subset sums. 99-102 - Monique Laurent, Matteo Seminaroti:
The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure. 103-109 - José María Lorenzo, Ismael Hernández-Noriega, Tomás Prieto-Rumeau:
Approximation of two-person zero-sum continuous-time Markov games with average payoff criterion. 110-116 - Chungen Shen, Wenjuan Xue, Yu'e An:
A new result on second-order necessary conditions for nonlinear programming. 117-122
Volume 43, Number 2, March 2015
- Sylvain Béal, Eric Rémila, Philippe Solal:
Decomposition of the space of TU-games, Strong transfer invariance and the Banzhaf value. 123-125 - Marco Locatelli:
Some results for quadratic problems with one or two quadratic constraints. 126-131 - Javiera Barrera, Héctor Cancela, Eduardo Moreno:
Topological optimization of reliable networks under dependent failures. 132-136 - Zijun Hao, Zhongping Wan, Xiaoni Chi:
A power penalty method for second-order cone linear complementarity problems. 137-142 - Bogumil Kaminski:
Refined knowledge-gradient policy for learning probabilities. 143-147 - Debapriya Sen, Giorgos Stamatopoulos:
When an inefficient competitor makes higher profit than its efficient rival. 148-150 - Seungbeom Kim, Woonghee Tim Huh, Sriram Dasu:
Pre-announced posted pricing scheme: Existence and uniqueness of equilibrium bidding strategy. 151-160 - Kanstantsin Pashkovich, Stefan Weltge:
Hidden vertices in extensions of polytopes. 161-164 - Jerzy Kamburowski:
On the distribution-free newsboy problem with some non-skewed demands. 165-171 - Fabien Cornillier, Vincent Charles:
Measuring the attractiveness of academic journals: A direct influence aggregation model. 172-176 - Ying-Ju Chen:
Optimal dynamic pricing for sponsored search advertising. 177-182 - M. Kayid, Salman Izadkhah:
A new extended mixture model of residual lifetime distributions. 183-188 - Sumit Kunnumkal:
On upper bounds for assortment optimization under the mixture of multinomial logit models. 189-194 - Jiantian Wang, Henry Laniado:
On likelihood ratio ordering of parallel system with two exponential components. 195-198 - Iskander Aliev:
On the lattice programming gap of the group problems. 199-202 - Hochang Lee, Dong-Won Seo:
Explicit expressions for moments of waiting times in Poisson driven deterministic two-node tandem queues with blocking. 203-208 - Yoel Drori, Shoham Sabach, Marc Teboulle:
A simple algorithm for a class of nonsmooth convex-concave saddle-point problems. 209-214 - Shabbir Ahmed:
Corrigendum to "A scenario decomposition algorithm for 0-1 stochastic programs" [Oper. Res. Lett. 41(6) (2013) 565-569]. 215-217
Volume 43, Number 3, May 2015
- Lifei Sheng, Huan Zheng, Ying Rong, Woonghee Tim Huh:
Flexible system design: A perspective from service levels. 219-225 - Zhe Chen:
Asymptotic analysis for proximal-type methods in vector variational inequality problems. 226-230 - Archis Ghate:
Inverse optimization in countably infinite linear programs. 231-235 - Bara Kim, Jeongsim Kim:
Proof of the conjecture on the stability of a multiserver retrial queue. 236-240 - Ahsan-Abbas Ali, Shuangqing Wei, Lijun Qian:
Optimal admission and preemption control in finite-source loss systems. 241-246 - Song-Hee Kim, Ponni Vel, Ward Whitt, Won Chul Cha:
Poisson and non-Poisson properties in appointment-generated arrival processes: The case of an endocrinology clinic. 247-253 - Fatemeh Saberian, Archis Ghate, Minsun Kim:
A two-variable linear program solves the standard linear-quadratic formulation of the fractionation problem in cancer radiotherapy. 254-258 - Judith Brecklinghaus, Stefan Hougardy:
The approximation ratio of the greedy algorithm for the metric traveling salesman problem. 259-261 - Lei Guo, Gui-Hua Lin, Dali Zhang, Daoli Zhu:
An MPEC reformulation of an EPEC model for electricity markets. 262-267 - Lotte Berghman, Frits C. R. Spieksma:
Valid inequalities for a time-indexed formulation. 268-272 - Pierre Le Bodic, George L. Nemhauser:
How important are branching decisions: Fooling MIP solvers. 273-278 - Robert Hildebrand, Timm Oertel, Robert Weismantel:
Note on the complexity of the mixed-integer hull of a polyhedron. 279-282 - Jay Sethuraman, Chun Ye:
A note on the assignment problem with uniform preferences. 283-287 - António Osório:
Some notes and comments on the efficient use of information in repeated games with Poisson signals. 288-292 - Feng Wang, Sanyang Liu, Yanfei Chai:
Robust counterparts and robust efficient solutions in vector optimization under uncertainty. 293-298 - Michael Schönlein:
A Lyapunov view on positive Harris recurrence of multiclass queueing networks. 299-303 - Haohua Wan, Qiong Wang:
Asymptotically-optimal component allocation for Assemble-to-Order production-inventory systems. 304-310 - Ge Guo, Gabriel Hackebeil, Sarah M. Ryan, Jean-Paul Watson, David L. Woodruff:
Integration of progressive hedging and dual decomposition in stochastic integer programs. 311-316 - David Adjiashvili, Sandro Bosio, Kevin Zemmer:
Minimizing the number of switch instances on a flexible machine in polynomial time. 317-322 - Santanu S. Dey, Andres Iroume, Marco Molinaro:
Some lower bounds on sparse outer approximations of polytopes. 323-328 - Satoru Fujishige, Michel X. Goemans, Tobias Harks, Britta Peis, Rico Zenklusen:
Congestion games viewed from M-convexity. 329-333 - Chee-Khian Sim:
On finding a generalized lowest rank solution to a linear semi-definite feasibility problem. 334-338 - Yuri Faenza, Laura Sanità:
On the existence of compact ε-approximated formulations for knapsack in the original space. 339-342 - Pengfei Guo, Refael Hassin:
Equilibrium strategies for placing duplicate orders in a single server queue. 343-348
Volume 43, Number 4, July 2015
- Michael R. Galbreth, Mümin Kurtulus, Mikhael Shor:
How collaborative forecasting can reduce forecast accuracy. 349-353 - Yu-Lin Chang, Jein-Shan Chen, Ching-Yu Yang:
Symmetrization of generalized natural residual function for NCP. 354-358 - Z. Melis Teksan, Joseph Geunes:
A polynomial time algorithm for convex cost lot-sizing problems. 359-364 - Lei Sun, Mark H. Karwan:
On the core of traveling salesman games. 365-369 - Luca Lambertini, Raimondello Orsini:
Quality improvement and process innovation in monopoly: A dynamic analysis. 370-373 - David Fernando Muñoz, Adán Ramírez-López:
A note on bias and mean squared error in steady-state quantile estimation. 374-377 - Yong Hsia, Shu Wang, Zi Xu:
Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints. 378-383 - Christoph Buchheim, Marianna De Santis, Laura Palagi:
A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations. 384-388 - Alessandra Buratto, Chiara D'Alpaos:
Optimal sustainable use of drinking water sources and interactions between multiple providers. 389-395 - Wei Cao, Jian Li, Shimin Li, Haitao Wang:
Balanced splitting on weighted intervals. 396-400 - Mei Lin, Ruhai Wu:
Production cost heterogeneity in the circular city model. 401-404 - Vaithilingam Jeyakumar, Guoyin Li:
A bilevel Farkas lemma to characterizing global solutions of a class of bilevel polynomial programs. 405-410 - Yaxian Li, Özlem Ergun, George L. Nemhauser:
A dual heuristic for mixed integer programming. 411-417 - Fatemeh Saberian, Archis Ghate, Minsun Kim:
Corrigendum to "A two-variable linear program solves the standard linear-quadratic formulation of the fractionation problem in cancer radiotherapy" [Oper. Res. Lett. 43(3) (2015) 254-258]. 418 - Leunglung Chan, Eckhard Platen:
Pricing volatility derivatives under the modified constant elasticity of variance model. 419-422 - Yiju Wang, Wanquan Liu, Louis Caccetta, Guanglu Zhou:
Parameter selection for nonnegative l1 matrix/tensor sparse decomposition. 423-426 - Jürgen Rietz, Cláudio Alves, José M. Valério de Carvalho, François Clautiaux:
Constructing general dual-feasible functions. 427-431 - Sercan Yildiz, Gérard Cornuéjols:
Disjunctive cuts for cross-sections of the second-order cone. 432-437 - Matthias Köppe, Yuan Zhou:
An electronic compendium of extreme functions for the Gomory-Johnson infinite group problem. 438-444 - Ruken Düzgün, Aurélie Thiele:
Robust binary optimization using a safe tractable approximation. 445-449 - Chenxu Li, Xiaocheng Li:
A closed-form expansion approach for pricing discretely monitored variance swaps. 450-455
Volume 43, Number 5, September 2015
- Michele Conforti, Volker Kaibel, Matthias Walter, Stefan Weltge:
Subgraph polytopes and independence polytopes of count matroids. 457-460 - M. Hosseinalifam, Patrice Marcotte, Gilles Savard:
Network capacity control under a nonparametric demand choice model. 461-466 - Bernardo D'Auria, Spyridoula Kanta:
Pure threshold strategies for a two-node tandem network under partial information. 467-470 - Xin Li, Mingwang Zhang:
Interior-point algorithm for linear optimization based on a new trigonometric kernel function. 471-475 - Jaume García-Segarra, Miguel Ginés-Vilar:
The impossibility of Paretian monotonic solutions: A strengthening of Roth's result. 476-478 - Minjiao Zhang:
Capacitated lot-sizing problem with outsourcing. 479-483 - Gabriel Haeser, Vinícius Veloso de Melo:
Convergence detection for optimization algorithms: Approximate-KKT stopping criterion when Lagrange multipliers are not available. 484-488 - Zhiyi Tan, Rongqi Li:
Pseudo lower bounds for online parallel machine scheduling. 489-494 - Fei Shi:
Endogenous timing, market research, and demand uncertainty. 495-497 - Timothy D. Lortz, Irina S. Dolinskaya, Archis Ghate, Robert L. Smith:
Solvability in infinite horizon optimization. 498-503 - Wouter Rogiest, Koenraad Laevens, Joris Walraevens, Herwig Bruneel:
When Random-Order-of-Service outperforms First-Come-First-Served. 504-506 - Elena M. Parilina, Georges Zaccour:
Approximated cooperative equilibria for games played over event trees. 507-513 - Geoffrey A. Chua, Yan Liu:
On the effect of demand randomness on inventory, pricing and profit. 514-518 - Serigne Gueye, Mozart B. C. Menezes:
General asymptotic and submodular results for the Median Problem with Unreliable Facilities. 519-521 - An Zhang:
On the optimality of the LP-based algorithm for online scheduling with GoS eligibility constraints. 522-525 - Takanori Maehara:
Risk averse submodular utility maximization. 526-529 - Refael Hassin, Uri Yovel:
Sequential scheduling on identical machines. 530-533 - Noriyoshi Sukegawa, Tomonari Kitahara:
A refinement of Todd's bound for the diameter of a polyhedron. 534-536 - Serdar Karademir, Oleg A. Prokopyev:
On speed scaling via integer programming. 537-544
Volume 43, Number 6, November 2015
- Michael Zhang, Jiejian Feng:
Turnpike properties of group testing for incomplete identification. 545-549 - Qinan Wang, Chang Liu:
Exact evaluation and optimization of the (R, nt) policy for a two-stage serial inventory system. 550-557 - Ryo Watanabe, Atsuyoshi Nakamura, Mineichi Kudo:
An improved upper bound on the expected regret of UCB-type policies for a matching-selection bandit problem. 558-563 - Po-An Chen:
How egalitarian are Nash equilibria in network cost-sharing games? 564-566 - Guo-ji Tang, Ming Zhu, Huan-Wen Liu:
A new extragradient-type method for mixed variational inequalities. 567-572 - Yusuke Kobayashi:
The complexity of minimizing the difference of two M♮-convex set functions. 573-574 - Jourdain B. Lamperski, Andrew J. Schaefer:
A polyhedral characterization of the inverse-feasible region of a mixed-integer program. 575-578 - Felix Lieder:
Simplified semidefinite and completely positive relaxations. 579-580 - Mark S. Joshi:
A new class of dual upper bounds for early exercisable derivatives encompassing both the additive and multiplicative bounds. 581-585 - Sina Dehghani, MohammadAmin Fazli, Jafar Habibi, Sadra Yazdanbod:
Using shortcut edges to maximize the number of triangles in graphs. 586-591 - Volker Kaibel, Shmuel Onn, Pauline Sarrabezolles:
The unimodular intersection problem. 592-594 - Tamás Kis:
Approximability of total weighted completion time with resource consuming jobs. 595-598 - Dominik Kress:
Reinvestigating the uniqueness of price equilibria in a product positioning model under price competition in a multisegmented market. 599-600 - José Da Fonseca, Alessandro Gnoatto, Martino Grasselli:
Analytic pricing of volatility-equity options within Wishart-based stochastic volatility models. 601-607 - James M. Davis, Huseyin Topaloglu, David P. Williamson:
Assortment optimization over time. 608-611 - Nitin Gupta, Lakshmi Kanta Patra, Somesh Kumar:
Stochastic comparisons in systems with Frèchet distributed components. 612-615 - Serkan Eryilmaz:
On the mean number of remaining components in three-state k-out-of-n system. 616-621 - Haris Aziz:
Competitive equilibrium with equal incomes for allocation of indivisible objects. 622-624 - Shinji Mizuno, Noriyoshi Sukegawa, Antoine Deza:
A primal-simplex based Tardos' algorithm. 625-628 - Yoshiaki Inoue, Tetsuya Takine:
The M/D/1+D queue has the minimum loss probability among M/G/1+G queues. 629-632
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-12-17 20:59 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:
