for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> MATHEMATICS (Total: 1021 journals)
    - APPLIED MATHEMATICS (83 journals)
    - GEOMETRY AND TOPOLOGY (21 journals)
    - MATHEMATICS (757 journals)
    - MATHEMATICS (GENERAL) (43 journals)
    - NUMERICAL ANALYSIS (22 journals)
    - PROBABILITIES AND MATH STATISTICS (95 journals)

MATHEMATICS (757 journals)            First | 1 2 3 4     

Showing 401 - 538 of 538 Journals sorted alphabetically
Journal of Knot Theory and Its Ramifications     Hybrid Journal   (Followers: 1)
Journal of Kufa for Mathematics and Computer     Open Access   (Followers: 1)
Journal of Liquid Chromatography & Related Technologies     Hybrid Journal   (Followers: 7)
Journal of Logical and Algebraic Methods in Programming     Hybrid Journal  
Journal of Manufacturing Systems     Full-text available via subscription   (Followers: 4)
Journal of Mathematical Analysis and Applications     Full-text available via subscription   (Followers: 3)
Journal of mathematical and computational science     Open Access   (Followers: 7)
Journal of Mathematical and Fundamental Sciences     Open Access  
Journal of Mathematical Behavior     Hybrid Journal   (Followers: 2)
Journal of Mathematical Chemistry     Hybrid Journal   (Followers: 3)
Journal of Mathematical Cryptology     Hybrid Journal   (Followers: 1)
Journal of Mathematical Extension     Open Access   (Followers: 3)
Journal of Mathematical Finance     Open Access   (Followers: 7)
Journal of Mathematical Imaging and Vision     Hybrid Journal   (Followers: 6)
Journal of Mathematical Logic     Hybrid Journal   (Followers: 2)
Journal of Mathematical Modelling and Algorithms     Hybrid Journal   (Followers: 1)
Journal of Mathematical Neuroscience     Open Access   (Followers: 9)
Journal of Mathematical Sciences     Hybrid Journal  
Journal of Mathematical Sciences and Applications     Open Access   (Followers: 2)
Journal of Mathematical Sociology     Hybrid Journal   (Followers: 3)
Journal of Mathematics     Open Access  
Journal of Mathematics and Statistics     Open Access   (Followers: 8)
Journal of Mathematics and the Arts     Hybrid Journal   (Followers: 2)
Journal of Mathematics in Industry     Open Access  
Journal of Mathematics Research     Open Access   (Followers: 6)
Journal of Metallurgy     Open Access   (Followers: 7)
Journal of Modern Mathematics Frontier     Open Access  
Journal of Multidisciplinary Modeling and Optimization     Open Access  
Journal of Multivariate Analysis     Hybrid Journal   (Followers: 13)
Journal of Natural Sciences and Mathematics Research     Open Access  
Journal of Nonlinear Analysis and Optimization : Theory & Applications     Open Access   (Followers: 4)
Journal of Nonlinear Mathematical Physics     Hybrid Journal   (Followers: 1)
Journal of Nonlinear Science     Hybrid Journal  
Journal of Numerical Cognition     Open Access  
Journal of Numerical Mathematics     Hybrid Journal   (Followers: 2)
Journal of Optimization     Open Access   (Followers: 4)
Journal of Problem Solving     Open Access   (Followers: 2)
Journal of Progressive Research in Mathematics     Open Access  
Journal of Pseudo-Differential Operators and Applications     Hybrid Journal  
Journal of Pure and Applied Algebra     Full-text available via subscription   (Followers: 4)
Journal of Quantitative Analysis in Sports     Hybrid Journal   (Followers: 8)
Journal of Quantitative Linguistics     Hybrid Journal   (Followers: 6)
Journal of Scientific Computing     Hybrid Journal   (Followers: 18)
Journal of Scientific Research     Open Access  
Journal of Symbolic Computation     Hybrid Journal   (Followers: 1)
Journal of the Australian Mathematical Society     Full-text available via subscription  
Journal of the Egyptian Mathematical Society     Open Access  
Journal of the European Mathematical Society     Full-text available via subscription  
Journal of the Indian Mathematical Society     Hybrid Journal   (Followers: 1)
Journal of the Institute of Mathematics of Jussieu     Hybrid Journal  
Journal of the London Mathematical Society     Hybrid Journal   (Followers: 2)
Journal of the Nigerian Mathematical Society     Open Access   (Followers: 1)
Journal of Theoretical and Applied Physics     Open Access   (Followers: 8)
Journal of Topology and Analysis     Hybrid Journal  
Journal of Transport and Supply Chain Management     Open Access   (Followers: 14)
Journal of Turbulence     Hybrid Journal   (Followers: 7)
Journal of Uncertainty Analysis and Applications     Open Access  
Journal of Universal Mathematics     Open Access  
Journal of Urban Regeneration & Renewal     Full-text available via subscription   (Followers: 10)
Journal of Water and Land Development     Open Access   (Followers: 3)
JRAMathEdu : Journal of Research and Advances in Mathematics Education     Open Access   (Followers: 3)
JURING (Journal for Research in Mathematics Learning)     Open Access   (Followers: 1)
Jurnal Ilmiah AdMathEdu     Open Access  
Jurnal Matematika     Open Access   (Followers: 1)
Jurnal Matematika Integratif     Open Access  
Jurnal Matematika, Sains, Dan Teknologi     Open Access  
Jurnal Natural     Open Access  
Jurnal Pendidikan Matematika Raflesia     Open Access  
Jurnal Penelitian Pembelajaran Matematika Sekolah     Open Access  
Jurnal Penelitian Sains (JPS)     Open Access  
Jurnal Riset Pendidikan Matematika     Open Access  
Jurnal Sains Matematika dan Statistika     Open Access  
Jurnal Tadris Matematika     Open Access  
Jurnal Teknologi dan Sistem Komputer     Open Access  
Kreano, Jurnal Matematika Kreatif-Inovatif     Open Access   (Followers: 5)
Le Matematiche     Open Access  
Learning and Teaching Mathematics     Full-text available via subscription   (Followers: 7)
Lettera Matematica     Hybrid Journal  
Limits : Journal of Mathematics and Its Applications     Open Access   (Followers: 1)
Linear Algebra and its Applications     Full-text available via subscription   (Followers: 18)
Linear and Multilinear Algebra     Hybrid Journal   (Followers: 8)
Lithuanian Mathematical Journal     Hybrid Journal  
LMS Journal of Computation and Mathematics     Free  
Lobachevskii Journal of Mathematics     Open Access  
Logic and Analysis     Hybrid Journal  
Logic Journal of the IGPL     Hybrid Journal  
Logica Universalis     Hybrid Journal  
manuscripta mathematica     Hybrid Journal  
MaPan : Jurnal Matematika dan Pembelajaran     Open Access  
Marine Genomics     Hybrid Journal   (Followers: 2)
Matemáticas, Educación y Sociedad     Open Access  
Matematicheskie Zametki     Full-text available via subscription  
Matematika     Open Access  
Matematychni Studii     Open Access  
Mathematica Eterna     Open Access  
Mathematica Scandinavica     Open Access   (Followers: 1)
Mathematica Slovaca     Hybrid Journal   (Followers: 1)
Mathematical and Computational Forestry & Natural-Resource Sciences     Free  
Mathematical Communications     Open Access  
Mathematical Computation     Open Access   (Followers: 1)
Mathematical Geosciences     Hybrid Journal   (Followers: 3)
Mathematical Medicine and Biology: A Journal of the IMA     Hybrid Journal   (Followers: 1)
Mathematical Methods in the Applied Sciences     Hybrid Journal   (Followers: 3)
Mathematical Methods of Statistics     Hybrid Journal   (Followers: 4)
Mathematical Modelling and Analysis     Open Access   (Followers: 1)
Mathematical Modelling in Civil Engineering     Open Access   (Followers: 5)
Mathematical Modelling of Natural Phenomena     Full-text available via subscription   (Followers: 1)
Mathematical Models and Methods in Applied Sciences     Hybrid Journal   (Followers: 2)
Mathematical Notes     Hybrid Journal  
Mathematical Proceedings of the Cambridge Philosophical Society     Full-text available via subscription   (Followers: 1)
Mathematical Programming Computation     Hybrid Journal   (Followers: 3)
Mathematical Sciences     Open Access  
Mathematical Social Sciences     Hybrid Journal   (Followers: 1)
Mathematical Theory and Modeling     Open Access   (Followers: 13)
Mathematical Thinking and Learning     Hybrid Journal   (Followers: 3)
Mathematics and Statistics     Open Access   (Followers: 5)
Mathematics Education Journal     Open Access   (Followers: 1)
Mathematics Education Research Journal     Partially Free   (Followers: 17)
Mathematics in Science and Engineering     Full-text available via subscription  
Mathematics of Control, Signals, and Systems (MCSS)     Hybrid Journal   (Followers: 4)
Mathematics of Quantum and Nano Technologies     Open Access  
Mathématiques et sciences humaines     Open Access   (Followers: 7)
Mathematische Annalen     Hybrid Journal   (Followers: 1)
Mathematische Nachrichten     Hybrid Journal   (Followers: 1)
Mathematische Semesterberichte     Hybrid Journal  
Mathematische Zeitschrift     Hybrid Journal   (Followers: 1)
MATI : Mathematical Aspects of Topological Indeces     Open Access  
MATICS     Open Access   (Followers: 1)
Matrix Science Mathematic     Open Access  
Measurement Science Review     Open Access   (Followers: 3)
Mediterranean Journal of Mathematics     Hybrid Journal  
Memetic Computing     Hybrid Journal  
Mendel : Soft Computing Journal     Open Access  
Metals and Materials International     Hybrid Journal  
Metascience     Hybrid Journal   (Followers: 1)
Milan Journal of Mathematics     Hybrid Journal  
Mitteilungen der DMV     Hybrid Journal  
MLQ- Mathematical Logic Quarterly     Hybrid Journal  
Monatshefte fur Mathematik     Hybrid Journal  
Moroccan Journal of Pure and Applied Analysis     Open Access   (Followers: 4)
Moscow University Mathematics Bulletin     Hybrid Journal  
MSOR Connections     Open Access   (Followers: 1)
Multiscale Modeling and Simulation     Hybrid Journal   (Followers: 3)
MUST : Journal of Mathematics Education, Science and Technology     Open Access   (Followers: 1)
Nagoya Mathematical Journal     Hybrid Journal  
Nano Research     Hybrid Journal   (Followers: 3)
Nanotechnologies in Russia     Hybrid Journal   (Followers: 1)
Natural Resource Modeling     Hybrid Journal  
New Mathematics and Natural Computation     Hybrid Journal  
Nonlinear Analysis : Modelling and Control     Open Access  
Nonlinear Analysis : Theory, Methods & Applications     Hybrid Journal   (Followers: 1)
Nonlinear Analysis: Hybrid Systems     Hybrid Journal  
Nonlinear Analysis: Real World Applications     Hybrid Journal   (Followers: 2)
Nonlinear Differential Equations and Applications NoDEA     Hybrid Journal  
Nonlinear Engineering     Open Access  
Nonlinear Oscillations     Hybrid Journal   (Followers: 1)
North Carolina Journal of Mathematics and Statistics     Open Access  
North-Holland Mathematical Library     Full-text available via subscription   (Followers: 1)
North-Holland Mathematics Studies     Full-text available via subscription  
North-Holland Series in Applied Mathematics and Mechanics     Full-text available via subscription   (Followers: 1)
Note di Matematica     Open Access  
NTM Zeitschrift für Geschichte der Wissenschaften, Technik und Medizin     Hybrid Journal   (Followers: 4)
Numeracy : Advancing Education in Quantitative Literacy     Open Access  
Numerical Analysis and Applications     Hybrid Journal   (Followers: 1)
Numerical Functional Analysis and Optimization     Hybrid Journal   (Followers: 2)
Numerical Linear Algebra with Applications     Hybrid Journal   (Followers: 4)
Numerical Mathematics : Theory, Methods and Applications     Full-text available via subscription  
Numerische Mathematik     Hybrid Journal  
Open Journal of Discrete Mathematics     Open Access   (Followers: 5)
Open Journal of Modelling and Simulation     Open Access   (Followers: 1)
Open Mathematics     Open Access   (Followers: 1)
Operations Research Letters     Hybrid Journal   (Followers: 11)
Optimization Letters     Hybrid Journal   (Followers: 2)
Optimization Methods and Software     Hybrid Journal   (Followers: 7)
Opuscula Mathematica     Open Access   (Followers: 108)
Order     Hybrid Journal  
ORiON     Open Access  
P-Adic Numbers, Ultrametric Analysis, and Applications     Hybrid Journal  
PAMM : Proceedings in Applied Mathematics and Mechanics     Free   (Followers: 1)
Parallel Processing Letters     Hybrid Journal   (Followers: 3)
Periodica Mathematica Hungarica     Full-text available via subscription   (Followers: 1)
Perspectivas da Educação Matemática     Open Access  
Petroleum Science     Full-text available via subscription   (Followers: 1)
Philosophia Mathematica     Hybrid Journal   (Followers: 1)
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences     Full-text available via subscription   (Followers: 6)
PNA. Revista de Investigación en Didáctica de la Matemática     Open Access  
Polar Science     Hybrid Journal   (Followers: 3)
Positivity     Hybrid Journal  
Prague Bulletin of Mathematical Linguistics, The     Open Access  
Press Start     Open Access  
Prime Number     Full-text available via subscription  
PRIMS     Full-text available via subscription  
Probability in the Engineering and Informational Sciences     Hybrid Journal   (Followers: 1)
Problemy Peredachi Informatsii     Full-text available via subscription  
Proceedings - Mathematical Sciences     Open Access   (Followers: 5)
Proceedings of the American Mathematical Society, Series B     Open Access   (Followers: 1)
Proceedings of the Edinburgh Mathematical Society     Hybrid Journal  
Proceedings of the Institution of Civil Engineers - Engineering and Computational Mechanics     Hybrid Journal   (Followers: 2)
Proceedings of the Latvian Academy of Sciences. Section B: Natural, Exact and Applied Sciences     Open Access  
Proceedings of the London Mathematical Society     Hybrid Journal   (Followers: 3)

  First | 1 2 3 4     

Similar Journals
Journal Cover
Operations Research Letters
Journal Prestige (SJR): 0.669
Citation Impact (citeScore): 1
Number of Followers: 11  
 
  Hybrid Journal Hybrid journal (It can contain Open Access articles)
ISSN (Print) 0167-6377
Published by Elsevier Homepage  [3184 journals]
  • A note on Selective line-graphs and partition colorings
    • Abstract: Publication date: Available online 12 September 2019Source: Operations Research LettersAuthor(s): Denis Cornaz, Fabio Furini, Enrico Malaguti, Alberto Santini We extend a one-to-one correspondence between the set of all colorings of any graph and the set of all stable sets of an auxiliary graph, from graphs to partitioned graphs. This correspondence has an application to Selective Coloring and to Selective Max-Coloring.
       
  • Strong NP-hardness of AC power flows feasibility
    • Abstract: Publication date: Available online 9 September 2019Source: Operations Research LettersAuthor(s): Daniel Bienstock, Abhinav Verma We prove that testing feasibility for an AC power flow system is a strongly NP-hard problem.
       
  • Exact asymptotics in an infinite-server system with overdispersed input
    • Abstract: Publication date: Available online 9 September 2019Source: Operations Research LettersAuthor(s): Mariska Heemskerk, Michel Mandjes This short communication considers an infinite-server system with overdispersed input. The objective is to identify the exact tail asymptotics of the number of customers present at a given point in time under a specific scaling of the model (which involves both the arrival rate and time). The proofs rely on a change-of-measure approach. The results obtained are illustrated by a series of examples.
       
  • Tail asymptotics for service systems with transfers of customers in an
           alternating environment
    • Abstract: Publication date: Available online 7 September 2019Source: Operations Research LettersAuthor(s): Tao Jiang, Lu Liu, Qingqing Ye, Xudong Chai This study examines service systems with transfers of customers in an alternating environment. We model the service system as a two-server two-parallel queue (primary and auxiliary queues), that has various applications especially in manufacturing and healthcare systems. We establish a sufficient stability condition, and based on the censoring technique, we provide sufficient conditions under which the stationary distribution possesses an exactly geometric tail along the direction of the queue length in the primary queue.
       
  • Minimal conic quadratic reformulations and an optimization model
    • Abstract: Publication date: Available online 7 September 2019Source: Operations Research LettersAuthor(s): Ramez Kian, Emre Berk, Ülkü Gürler In this paper, we consider a particular form of inequalities which involves product of multiple variables with rational exponents. These inequalities can equivalently be represented by a number of conic quadratic forms called cone constraints. We propose an integer programming model and a heuristic algorithm to obtain the minimum number of cone constraints which equivalently represent the original inequality. The performance of the proposed algorithm and the computational effect of reformulations are numerically illustrated.
       
  • Assortment planning for vertically differentiated products under a
           consider-then-choose model
    • Abstract: Publication date: Available online 7 September 2019Source: Operations Research LettersAuthor(s): Wenbo Chen, Huixiao Yang Consider-then-choose models, borne out by empirical literature in marketing and psychology, note that customers follow a two-stage procedure to choose among alternatives. In this paper, we consider the assortment optimization problem of a retailer who manages a category of vertically differentiated products under customers’ consider-then-choose behavior. We characterize some structural results of the optimal assortment and find that the problem can be solved as the shortest path problem. Also, we develop an efficient algorithm to identify an optimal assortment.
       
  • ϵ -core&rft.title=Operations+Research+Letters&rft.issn=0167-6377&rft.date=&rft.volume=">The finagle point might not be within the ϵ -core
    • Abstract: Publication date: Available online 6 September 2019Source: Operations Research LettersAuthor(s): Mathieu Martin, Zéphirin Nganmeni In this note, we focus on a result stated by Bräuninger that the finagle point is within the ϵ -core in a spatial voting game with Euclidean individual preferences. Through a counter-example with 7 players, we show that Bräuninger’s result is not valid.
       
  • Quantile forecasting and data-driven inventory management under
           nonstationary demand
    • Abstract: Publication date: Available online 4 September 2019Source: Operations Research LettersAuthor(s): Ying Cao, Zuo-Jun Max Shen In this paper, a single-step framework for predicting quantiles of time series is presented. Subsequently, we propose that this technique can be adopted as a data-driven approach to determine stock levels in the environment of newsvendor problem and its multi-period extension. Theoretical and empirical findings suggest that our method is effective at modeling both weakly stationary and some nonstationary time series. On both simulated and real-world datasets, the proposed approach outperforms existing statistical methods and yields good newsvendor solutions.
       
  • Potential functions for finding stable coalition structures
    • Abstract: Publication date: Available online 2 September 2019Source: Operations Research LettersAuthor(s): Vasily V. Gusev, Vladimir V. Mazalov The existence of a Nash-stable coalition structure in cooperative games with the Aumann–Dreze value is investigated. Using the framework of potential functions, it is proved that such a coalition structure exists in any cooperative game. In addition, a similar result is established for some linear values of the game, in particular, the Banzhaf value. For a cooperative game with vector payments, a type of stability based on maximizing the guaranteed payoffs of all players is proposed.
       
  • Strong NP-hardness of minimizing total deviation with generalized and
           periodic due dates
    • Abstract: Publication date: Available online 17 August 2019Source: Operations Research LettersAuthor(s): Byung-Cheon Choi, Yunhong Min, Myoung-Ju Park We consider a single-machine scheduling problem with generalized and periodic due dates such that each due date is assigned not to a specific job but to a position and the lengths of the intervals between consecutive due dates are identical. The objective is to minimize the total deviation, which is calculated as the sum of the earliness and tardiness of each job. We show that the problem is strongly NP-hard. We develop a heuristic and verify its performance via experiments.
       
  • S 1 , S )+inventory+model+and+its+counterparts+in+queueing+theory&rft.title=Operations+Research+Letters&rft.issn=0167-6377&rft.date=&rft.volume=">The ( S − 1 , S ) inventory model and its counterparts in queueing
           theory
    • Abstract: Publication date: Available online 16 August 2019Source: Operations Research LettersAuthor(s): Onno J. Boxma, David Perry, Wolfgang Stadje We explore the relationship between the (S−1,S) inventory model and three well-known queueing models: the Erlang loss system, the machine-repair model and a two-node Jackson network. Exploiting this relationship allows us to obtain key performance measures of the (S−1,S) model, like the so-called virtual outdating time, the number of items on the shelf in steady state, the long-run rate of unsatisfied demands and the distribution of the empty shelf period.
       
  • A non-Euclidean gradient descent method with sketching for unconstrained
           matrix minimization
    • Abstract: Publication date: Available online 9 August 2019Source: Operations Research LettersAuthor(s): Nadav Hallak, Marc Teboulle We propose a method that incorporates a non-Euclidean gradient descent step with a generic matrix sketching procedure, for solving unconstrained, nonconvex, matrix optimization problems, in which the decision variable cannot be saved in memory due to its size, and the objective function is the composition of a vector function on a linear operator. The method updates the sketch directly without updating nor storing the decision variable. Subsequence convergence, global convergence under the Kurdyka–Lojasiewicz property, and rate of convergence, are established.
       
  • Robust assortment optimization using worst-case CVaR under the multinomial
           logit model
    • Abstract: Publication date: Available online 5 August 2019Source: Operations Research LettersAuthor(s): Xiaolong Li, Jiannan Ke We consider robust assortment optimization problems with partial distributional information of parameters in the multinomial logit choice model. The objective is to find an assortment that maximizes a revenue target using a distributionally robust chance constraint, which can be approximated by the worst-case Conditional Value-at-Risk. We show that our problems are equivalent to robust assortment optimization problems over special uncertainty sets of parameters, implying the optimality of revenue-ordered assortments under certain conditions.
       
  • A regular equilibrium solves the extended HJB system
    • Abstract: Publication date: Available online 5 August 2019Source: Operations Research LettersAuthor(s): Kristoffer Lindensjö Control problems not admitting the dynamic programming principle are known as time-inconsistent. The game-theoretic approach is to interpret such problems as intrapersonal dynamic games and look for subgame perfect Nash equilibria. A fundamental result of time-inconsistent stochastic control is a verification theorem saying that solving the extended HJB system is a sufficient condition for equilibrium. We show that solving the extended HJB system is a necessary condition for equilibrium, under regularity assumptions. The controlled process is a general Itô diffusion.
       
  • A dynamic free-entry oligopoly with sluggish entry and exit adjustments
    • Abstract: Publication date: Available online 25 July 2019Source: Operations Research LettersAuthor(s): Yasuhito Tanaka We study a dynamic free-entry oligopoly with sluggish entry and exit of firms under general demand and cost functions. We show that the number of firms in a steady-state open-loop solution for a dynamic free-entry oligopoly is smaller than that at static equilibrium and that the number of firms in a steady-state memoryless closed-loop solution is larger than that in an open-loop solution.
       
  • Structural properties of the lost sales problem with fractional lead times
    • Abstract: Publication date: Available online 23 July 2019Source: Operations Research LettersAuthor(s): Yanyi Xu, Sang-Phil Kim, Arnab Bisi, Suresh Chand, Maqbool Dada We consider an infinite horizon periodic review base-stock inventory system with discrete demand and lost sales. Every T periods the inventory is reviewed and an order, with arbitrary lead time L, is placed to bring the inventory position to R. Using a recursive Markovian representation, we develop the operating characteristics for any system with positive integer-valued base-stock R, review period T, and lead time L. Then, we develop an algorithm to find the optimal stationary R. Surprisingly, computational results yield the unintuitive findings that the optimal base-stock and cost are not monotone in L given T.
       
  • Point availability of Gaver’s duplex system supervised by a safety
           device unit
    • Abstract: Publication date: Available online 19 July 2019Source: Operations Research LettersAuthor(s): E.J. Vanderperre, S.S. Makhanov We analyse the point availability of Gaver’s parallel system supervised by a safety device. For safety reasons, no unit is allowed to operate without supervision. The entire system is attended by two heterogeneous repairmen. Our methodology is based on the theory of sectionally holomorphic functions combined with the notion of dual transforms. As an application we consider Coxian repair time distributions.
       
  • Computing a minimum-width cubic and hypercubic shell
    • Abstract: Publication date: Available online 16 July 2019Source: Operations Research LettersAuthor(s): Sang Won Bae This paper addresses the problem of computing a minimum-width axis-aligned cubic shell enclosing a given set of n points in R3. A cubic shell is a closed volume between two concentric and face-parallel cubes. Prior to this work, there was no known algorithm for this problem in the literature. We present the first nontrivial algorithm whose running time is O(nlog2n) in the worst case. Our approach extends to higher dimension d>3, resulting in an algorithm in O(n⌊d∕2⌋logd−1n) expected time.
       
  • Transient analysis of a Markovian queue with deterministic rejection
    • Abstract: Publication date: Available online 15 July 2019Source: Operations Research LettersAuthor(s): Benjamin Legros We analyze the transient behavior of the M/M/1+D queue. Considering an Erlang distribution for customers’ waiting time, we approximate the real system by a Markov chain. We obtain the Laplace Transform of the transient probabilities in the approximated model and the Laplace transform of the main performance measures for the real system. We next analyze the busy period of this queue. One interesting insight is that the busy period of the unstable M/M/s queue has a finite coefficient of variation.
       
  • On the difficulty of extending the coco value to games with more than two
           players
    • Abstract: Publication date: September 2019Source: Operations Research Letters, Volume 47, Issue 5Author(s): Shiran Rachmilevitch Kalai and Kalai (2013) presented five axioms for solutions of 2-person semi-cooperative games: games in which the basic data specifies individual strategies and payoffs, but in which the players can sign binding contracts and make utility transfers. The axioms pin down a unique solution, the coco value. I show that if one adds a mild dummy player axiom to the list, then the axioms become inconsistent when there are more than two players.
       
  • A characterization of the folk rule for multi-source minimal cost spanning
           tree problems
    • Abstract: Publication date: September 2019Source: Operations Research Letters, Volume 47, Issue 5Author(s): G. Bergantiños, A. Navarro-Ramos In this paper we provide an axiomatic characterization of the folk rule for minimum cost spanning tree problems with multiple sources. The properties we need are: cone-wise additivity, cost monotonicity, symmetry, isolated agents, and equal treatment of source costs.
       
  • Solving multiple facilities location problems with separated clusters
    • Abstract: Publication date: Available online 10 July 2019Source: Operations Research LettersAuthor(s): Jack Brimberg, Zvi Drezner This paper examines a special case of multi-facility location problems where the set of demand points is partitioned into a given number of subsets or clusters that can be treated as smaller independent sub-problems once the number of facilities allocated to each cluster is determined. A dynamic programming approach is developed to determine the optimal allocation of facilities to clusters. The use of clusters is presented as a new idea for designing heuristics to solve general multi-facility location problems.
       
  • Revenue management on an on-demand service platform
    • Abstract: Publication date: Available online 9 July 2019Source: Operations Research LettersAuthor(s): Vijay Kamble I consider a worker’s optimal per-unit-time pricing problem on an on-demand service platform. I establish that if the customer arrival process is Poisson, then any price discrimination must result only from differences in the customers’ willingness-to-pay distributions, and not from differences in their arrival or service-time characteristics. For multiple customer classes that differ in their willingness-to-pay distributions, I present a simple procedure to compute the optimal prices. Finally, I analyze price competition across workers in the presence of reputation effects.
       
  • Idealness and 2-resistant sets
    • Abstract: Publication date: Available online 3 July 2019Source: Operations Research LettersAuthor(s): Ahmad Abdi, Gérard Cornuéjols A subset of the unit hypercube {0,1}n is cube-ideal if its convex hull is described by hypercube and generalized set covering inequalities. In this note, we study sets S⊆{0,1}n such that, for any subset X⊆{0,1}n of cardinality at most 2, S∪X is cube-ideal.
       
  • New valid inequalities for the fixed-charge and single-node flow polytopes
    • Abstract: Publication date: Available online 3 July 2019Source: Operations Research LettersAuthor(s): Adam N. Letchford, Georgia Souli The most effective software packages for solving mixed 0-1 linear programs use strong valid linear inequalities derived from polyhedral theory. We introduce a new procedure which enables one to take known valid inequalities for the knapsack polytope, and convert them into valid inequalities for the fixed-charge and single-node flow polytopes. The resulting inequalities are very different from the previously known inequalities (such as flow cover and flow pack inequalities), and define facets under certain conditions.
       
  • Sparsity of integer formulations for binary programs
    • Abstract: Publication date: Available online 24 June 2019Source: Operations Research LettersAuthor(s): Christopher Hojny, Hendrik Lüthen, Marc E. Pfetsch This paper considers integer formulations of binary sets X of minimum sparsity, i.e., the maximal number of non-zeros for each row of the corresponding constraint matrix is minimized. Providing a constructive mechanism for computing the minimum sparsity, we derive sparsest integer formulations of several combinatorial problems, including the traveling salesman problem. We also show that sparsest formulations are NP-hard to separate, while (under mild assumptions) there exists a dense formulation of X separable in polynomial time.
       
  • The single-item lot-sizing problem with two production modes, inventory
           bounds, and periodic carbon emissions capacity
    • Abstract: Publication date: Available online 20 June 2019Source: Operations Research LettersAuthor(s): Siao-Leu Phouratsamay, T.C.E. Cheng We consider the single-item lot-sizing problem with inventory bounds under a carbon emissions constraint with two options for producing items: regular or green. We wish to find the optimal production plan so that the total carbon emissions from production cannot exceed the carbon emissions capacity in each period. Extending a problem without fixed carbon emissions and inventory bounds, we show that the extended problem is polynomially solvable by a dynamic programming algorithm.
       
  • Algorithms for Pareto optimal exchange with bounded exchange cycles
    • Abstract: Publication date: Available online 18 June 2019Source: Operations Research LettersAuthor(s): Haris Aziz We consider exchange markets with single-unit endowments and demands where there is a bound on the size of the exchange cycles. The computational problem we study is that of computing a Pareto optimal and individually rational allocation. We present polynomial-time algorithms to compute a Pareto optimal and individually rational allocation when preferences are strict, the exchange bound is two, or when Pareto optimality is replaced with weak Pareto optimality.
       
  • Open-loop policies in Bayesian dynamic pricing: Some counter-intuitive
           observations and insights
    • Abstract: Publication date: Available online 7 June 2019Source: Operations Research LettersAuthor(s): Li Chen, Chengyu Wu In this paper, we show some counter-intuitive observations regarding the open-loop policies in a Bayesian dynamic pricing problem. Specifically, while the common intuition that a policy incorporating more information performs better continues to hold under ample inventory for sale, it breaks down in the case where inventory is limited. This can be explained by the unique feature of selling a limited amount of inventory: information updating may stop prematurely when inventory is depleted, rendering certain demand information being inconsequential.
       
  • Extended formulations for radial cones
    • Abstract: Publication date: Available online 4 June 2019Source: Operations Research LettersAuthor(s): Matthias Walter, Stefan Weltge This paper studies extended formulations for radial cones at vertices of polyhedra, which are the polyhedra defined by the constraints that are active at the vertex. While the perfect-matching polytope cannot be described by subexponential-size extended formulations (Rothvoß 2014), Ventura & Eisenbrand (2003) showed that its radial cones can be described by polynomial-size extended formulations. The authors also asked whether this extends to odd-cut polyhedra, which are related to matching polyhedra by polarity. We answer this question negatively.
       
  • Optimizing reserves in school choice: A dynamic programming approach
    • Abstract: Publication date: Available online 4 June 2019Source: Operations Research LettersAuthor(s): Franklyn Wang, Ravi Jagadeesan, Scott Duke Kominers We introduce a new model of school choice with reserves in which asocial planner is constrained by a limited supply of reserve seats and tries to find an optimal matching according to a social welfare function. We construct the optimal distribution of reserves via a quartic-time dynamic programming algorithm. Due to the modular nature of the dynamic program, the mechanism is strategy-proof for reserve-eligible students.
       
  • Risk-sensitive finite-horizon piecewise deterministic Markov decision
           processes
    • Abstract: Publication date: Available online 30 May 2019Source: Operations Research LettersAuthor(s): Yonghui Huang, Zhaotong Lian, Xianping Guo This paper deals with risk-sensitive piecewise deterministic Markov decision processes, where the expected exponential utility of a finite-horizon reward is to be maximized. Both the transition rates and reward functions are allowed to be unbounded. The Feynman–Kac’s formula is developed in our setup, using which along with an approximation technique, we establish the associated Hamilton–Jacobi-Bellman equation and the existence of risk-sensitive optimal policies under suitable conditions.
       
 
 
JournalTOCs
School of Mathematical and Computer Sciences
Heriot-Watt University
Edinburgh, EH14 4AS, UK
Email: journaltocs@hw.ac.uk
Tel: +00 44 (0)131 4513762
Fax: +00 44 (0)131 4513327
 
Home (Search)
Subjects A-Z
Publishers A-Z
Customise
APIs
Your IP address: 34.237.76.91
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-