for Journals by Title or ISSN
for Articles by Keywords
help
  Subjects -> MATHEMATICS (Total: 1041 journals)
    - APPLIED MATHEMATICS (84 journals)
    - GEOMETRY AND TOPOLOGY (23 journals)
    - MATHEMATICS (770 journals)
    - MATHEMATICS (GENERAL) (43 journals)
    - NUMERICAL ANALYSIS (23 journals)
    - PROBABILITIES AND MATH STATISTICS (98 journals)

MATHEMATICS (770 journals)            First | 1 2 3 4     

Showing 401 - 538 of 538 Journals sorted alphabetically
Journal of Humanistic Mathematics     Open Access   (Followers: 1)
Journal of Hyperbolic Differential Equations     Hybrid Journal  
Journal of Indian Council of Philosophical Research     Hybrid Journal  
Journal of Industrial Mathematics     Open Access   (Followers: 2)
Journal of Inequalities and Applications     Open Access  
Journal of Infrared, Millimeter and Terahertz Waves     Hybrid Journal   (Followers: 2)
Journal of Integrable Systems     Open Access   (Followers: 1)
Journal of K-Theory     Full-text available via subscription  
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: 4)
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   (Followers: 1)
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   (Followers: 1)
Journal of Numerical Cognition     Open Access  
Journal of Numerical Mathematics     Hybrid Journal   (Followers: 2)
Journal of Optimization     Open Access   (Followers: 4)
Journal of Peridynamics and Nonlocal Modeling     Hybrid Journal  
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   (Followers: 1)
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: 22)
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: 4)
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: 5)
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: 2)
Matrix Science Mathematic     Open Access   (Followers: 1)
Measurement Science Review     Open Access   (Followers: 3)
Mediterranean Journal of Mathematics     Hybrid Journal  
Memetic Computing     Hybrid Journal  
Mendel : Soft Computing Journal     Open Access  
Metaheuristics     Hybrid Journal  
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   (Followers: 1)
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: 6)
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: 8)
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)
Peking Mathematical Journal     Hybrid Journal  
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  

  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  [3181 journals]
  • Robust absolute single machine makespan scheduling-location problem on
           trees
    • Abstract: Publication date: Available online 7 November 2019Source: Operations Research LettersAuthor(s): Sven O. Krumke, Huy Minh Le We investigate a robust single machine scheduling-location problem with uncertainty in edge lengths. Jobs are located at the vertices of a given tree. Given a location for a single machine, the jobs travel to the location and are processed there sequentially. The goal is to find a location of the machine and simultaneously a sequence to minimize the makespan value in the worst-case. We use the concept of gamma-robustness to model uncertainty. Our main result is a polynomial time algorithm.
       
  • Influence maximization with partial feedback
    • Abstract: Publication date: Available online 5 November 2019Source: Operations Research LettersAuthor(s): Shaojie Tang, Jing Yuan The goal of Influence maximization (IM) is to select a set of most influential users in a social network subject to a budget constraint. In this work, we propose to study the adaptive IM problem under partial-feedback model. Our main contribution in this paper is to introduce a novel adaptive policy with bounded approximation ratio. One nice feature of our policy is that we can balance the delay and performance tradeoff by adjusting the value of a controlling parameter.
       
  • The complexity of computing a robust flow
    • Abstract: Publication date: Available online 2 November 2019Source: Operations Research LettersAuthor(s): Yann Disser, Jannik Matuschke The Maximum Robust Flow problem asks for a flow on the paths of a network maximizing the guaranteed amount of flow surviving the removal of any k arcs. We point out a flaw in a previous publication that claimed NP-hardness for this problem when k=2. For the case that k is part of the input, we present a new hardness proof. We also discuss the complexity of the integral version of the problem.
       
  • A lexicographic pricer for the fractional bin packing problem
    • Abstract: Publication date: November 2019Source: Operations Research Letters, Volume 47, Issue 6Author(s): Stefano Coniglio, Fabio D’Andreagiovanni, Fabio Furini We propose an exact lexicographic dynamic programming pricing algorithm for solving the Fractional Bin Packing Problem with column generation. The new algorithm is designed for generating maximal columns of minimum reduced cost which maximize, lexicographically, one of the measures of maximality we investigate. Extensive computational experiments reveal that a column generation algorithm based on this pricing technique can achieve a substantial reduction in the number of columns and the computing time, also when combined with a classical smoothing technique from the literature.
       
  • On energy-aware M/G/1-LAS queue with batch arrivals
    • Abstract: Publication date: November 2019Source: Operations Research Letters, Volume 47, Issue 6Author(s): Pasi Lassila, Samuli Aalto We analyze an energy-aware MX/G/1 queue under LAS scheduling with a setup delay and an idle timer that controls the delay before the server enters a sleep state. Through a classical busy period analysis, the expression for the mean conditional delay is derived, which generalizes the earlier well-known result for the ordinary M/G/1-LAS queue. We also analyze the performance-energy tradeoff and show that two well-known cost metrics, weighted sum and product of the mean delay and mean power, are minimized by setting the timer equal to zero or infinite, i.e., a finite idle timer is never used.
       
  • Discounting-sensitivity in symmetric repeated games: An example
    • Abstract: Publication date: Available online 24 October 2019Source: Operations Research LettersAuthor(s): Shiran Rachmilevitch I present an example of a symmetric repeated game in which an arbitrarily small change in the discount factor can lead to a discontinuous change in the level of symmetry that can be sustained in equilibrium.
       
  • Optimal policy for inventory systems with capacity commitment and fixed
           ordering costs
    • Abstract: Publication date: Available online 23 October 2019Source: Operations Research LettersAuthor(s): Xiangyin Kong, Huihui Wang, Xi Chen, Gengzhong Feng This paper investigates a single-product, periodic-review, non-stationary inventory system with total maximum capacity commitment and fixed ordering costs over a finite planning horizon. We characterize the optimal ordering policy as a state-dependent (s,S) policy whose parameters only depend on the sum of the net inventory and the remaining capacity. We show that such policy can degenerate into two simple policies in two special cases respectively. We also derive bounds on parameters of the optimal ordering policy.
       
  • Fluid queues with synchronized output
    • Abstract: Publication date: Available online 23 October 2019Source: Operations Research LettersAuthor(s): Onno Boxma, Offer Kella, Liron Ravner We present a model of parallel Lévy-driven queues that mix their output into a final product; whatever cannot be mixed is sold on the open market for a lower price. The queues incur holding and capacity costs and can choose their processing rates. We solve the ensuing centralized (system optimal) and decentralized (individual station optimal) profit optimization problems. In equilibrium the queues process work faster than desirable from a system point of view. Several model extensions are also discussed.
       
  • An agreeable collusive equilibrium in differential games with asymmetric
           players
    • Abstract: Publication date: Available online 22 October 2019Source: Operations Research LettersAuthor(s): Anna Castañer, Jesús Marín-Solano, Carmen Ribas We study a class of collusive equilibria in differential games with asymmetric players discounting the future at different rates. For such equilibria, at each moment, weights of players can depend on the state of the system. To fix them, we propose using a bargaining procedure according to which players can bargain again at every future moment. By choosing as threat point the feedback noncooperative outcome, the corresponding solution, if it exists, is agreeable. An exhaustible resource game illustrates the results.
       
  • A note on single-machine scheduling to tradeoff between the number of
           tardy jobs and the start time of machine
    • Abstract: Publication date: Available online 19 October 2019Source: Operations Research LettersAuthor(s): Qiulan Zhao, Jinjiang Yuan We consider the single-machine scheduling to tradeoff between the number of tardy jobs and the start time of machine. For this problem, Hoogeveen and T’kindt (2012) proposed an O(n4) algorithm and Gafarov et al. (2010) gave an O(n2) algorithm. In this paper, we present an improved O(nlogn) algorithm. This also provides a new O(nlogn) algorithm for problem 1 ∑Uj.
       
  • Naor’s model with heterogeneous customers and arrival rate
           uncertainty
    • Abstract: Publication date: Available online 16 October 2019Source: Operations Research LettersAuthor(s): Chengcheng Liu, John J. Hasenbein This paper examines an extension of Naor’s observable queueing model in which the arrival rate is not known with certainty by either customers or the system manager. Further, customers are heterogeneous in terms of their service valuation and waiting time cost. We analyze the stability of the system and properties of the revenue maximizing fee and socially optimal fee.
       
  • A geometric way to build strong mixed-integer programming formulations
    • Abstract: Publication date: Available online 11 October 2019Source: Operations Research LettersAuthor(s): Joey Huchette, Juan Pablo Vielma We give an explicit geometric way to build mixed-integer programming (MIP) formulations for unions of polyhedra. The construction is simply described in terms of spanning hyperplanes in an r-dimensional linear space. The resulting MIP formulation is ideal, and uses exactly r integer variables and 2×(#of spanning hyperplanes) general inequality constraints. We use this result to derive novel logarithmic-sized ideal MIP formulations for discontinuous piecewise linear functions and structures appearing in robotics and power systems problems.
       
  • The efficient proportional Myerson values
    • Abstract: Publication date: Available online 10 October 2019Source: Operations Research LettersAuthor(s): Erfang Shan, Jiayu Han, Jilei Shi In this paper we introduce a class of efficient extensions of the Myerson value for games with communication graph structures in which the surplus is allocated in proportion to measures defined on the graph. We show that the efficient proportional Myerson values can be characterized by efficiency, coherence with the Myerson value for connected graphs, and α-fairness of surplus. The axiomatization implies a new characterization of the efficient egalitarian Myerson value proposed by van den Brink et al. (2012).
       
  • A branch and bound algorithm for dynamic resource allocation in population
           disease management
    • Abstract: Publication date: Available online 8 October 2019Source: Operations Research LettersAuthor(s): Ting-Yu Ho, Shan Liu, Zelda B. Zabinsky We embed an approximate dynamic program into a branch-and-bound framework to solve sequential resource allocation problems in population disease management. The proposed algorithm is capable of providing an optimality guarantee and getting bounds on the optimality gap of healthcare interventions. A numerical study on screening and treatment policy implementation for chronic hepatitis C virus (HCV) infection provides useful insights regarding HCV elimination for baby boomers.
       
  • A simple algorithm for the multiway cut problem
    • Abstract: Publication date: Available online 5 October 2019Source: Operations Research LettersAuthor(s): Niv Buchbinder, Roy Schwartz, Baruch Weizman Multiway Cut is a classic graph partitioning problem in which the goal is to disconnect a given set of special vertices called terminals. This problem admits a rich sequence of works. Unfortunately, most of these works resort to the mix of multiple algorithmic components, resulting in both complicated algorithms and analysis. We present a simple algorithm for the Multiway Cut problem that is comprised of a single algorithmic component and achieves an approximation of 118=1.375.
       
  • Corrigendum to “Heavy-Traffic Asymptotics for Stationary GI/G/1-Type
           Markov Chains” [Oper. Res. Lett. 40 (2012) 185–189]
    • Abstract: Publication date: November 2019Source: Operations Research Letters, Volume 47, Issue 6Author(s): Tatsuaki Kimura, Hiroyuki Masuyama, Yutaka Takahashi This corrigendum provides corrections for several errors in the previously published letter “Heavy-Traffic Asymptotics for Stationary GI/G/1-Type Markov Chains” [Operations Research Letters 40 (2012) 185–189].
       
  • Epiconvergence of relaxed stochastic optimization problems
    • Abstract: Publication date: Available online 3 October 2019Source: Operations Research LettersAuthor(s): Vincent Leclère We consider relaxation of almost sure constraint in dynamic stochastic optimization problems and their convergence. We show an epiconvergence result relying on the Kudo convergence of σ-algebras and continuity of the objective and constraint operators. We present classical constraints and objective functions with conditions ensuring their continuity. We are motivated by a Lagrangian decomposition algorithm, known as Dual Approximate Dynamic Programming, that relies on relaxation, and can also be understood as a decision rule approach in the dual.
       
  • Separation theorems for nonconvex sets and application in optimization
    • Abstract: Publication date: Available online 3 October 2019Source: Operations Research LettersAuthor(s): Refail Kasimbeyli, Masoud Karimi The aim of this paper is to present separation theorems for two disjoint closed sets, without convexity condition. First, a separation theorem for a given closed cone and a point outside from this cone, is proved and then it is used to prove a separation theorem for two disjoint sets. Illustrative examples are provided to highlight the important aspects of these theorems. An application to optimization is also presented to prove optimality condition for a nonconvex optimization problem.
       
  • A copositive Farkas lemma and minimally exact conic relaxations for robust
           quadratic optimization with binary and quadratic constraints
    • Abstract: Publication date: Available online 26 September 2019Source: Operations Research LettersAuthor(s): N.H. Chieu, T.D. Chuong, V. Jeyakumar, G. Li We present a new copositive Farkas lemma for a general conic quadratic system with binary constraints under a convexifiability requirement. By employing this Farkas lemma, we establish that a minimally exact conic programming relaxation holds for a convexifiable robust quadratic optimization problem with binary and quadratic constraints under a commonly used ellipsoidal uncertainty set of robust optimization. We then derive a minimally exact copositive relaxation for a robust binary quadratic program with conic linear constraints where the convexifiability easily holds.
       
  • A Shapley-based Groves mechanism: When the mechanism designer plays the
           wise man
    • Abstract: Publication date: Available online 24 September 2019Source: Operations Research LettersAuthor(s): Michela Chessa We define two mechanisms. The first one implements the Shapley value to define some monetary transfers, but it is not incentive compatible. The second one implements only in expectation the same solution and it is a Groves mechanism. While inheriting all the properties of this family, it is also budget-balanced (still in expectation). The trick is to ask the mechanism designer to insert/remove some utility and to take/give it back at the end.
       
  • Electricity market equilibrium under information asymmetry
    • Abstract: Publication date: Available online 23 September 2019Source: Operations Research LettersAuthor(s): Vladimir Dvorkin, Jalal Kazempour, Pierre Pinson We study a competitive electricity market equilibrium with two trading stages, day-ahead and real-time. The welfare of each market agent is exposed to uncertainty (here from renewable energy production), while agent information on the probability distribution of this uncertainty is not identical at the day-ahead stage. We show a high sensitivity of the equilibrium solution to the level of information asymmetry and demonstrate economic, operational, and computational value for the system stemming from potential information sharing.
       
  • Assortment optimization under the multinomial logit model with product
           synergies
    • Abstract: Publication date: Available online 23 September 2019Source: Operations Research LettersAuthor(s): Venus Lo, Huseyin Topaloglu In synergistic assortment optimization, a product’s attractiveness changes as a function of which other products are offered. We represent synergy structure graphically. Vertices denote products. An edge denotes synergy between two products, which increases their attractiveness when both are offered. Finding an assortment to maximize retailer’s expected profit is NP-hard in general. We present efficient algorithms when the graph is a path, a tree, or has low treewidth. We give a linear program to recover the optimal assortment for paths.
       
  • Single courier single restaurant meal delivery (without routing)
    • Abstract: Publication date: Available online 20 September 2019Source: Operations Research LettersAuthor(s): Matteo Cosmi, Gianpaolo Oriolo, Veronica Piccialli, Paolo Ventura We investigate optimization models for meal delivery that do not involve routing. We focus on the simplest case, with a single restaurant and a single courier, and reduce it to the throughput maximization single machine scheduling problem, with release times and bounded slacks. In the meal delivery setting, slacks are small for QoS purposes and we indeed show the scheduling problem can be solved in polynomial time when slacks are bounded. We discuss extensions to more couriers and restaurants.
       
  • 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.
       
  • 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.
       
  • 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
 
About JournalTOCs
API
Help
News (blog, publications)
JournalTOCs on Twitter   JournalTOCs on Facebook

JournalTOCs © 2009-