Zobrazeno 1 - 10
of 15
pro vyhledávání: '"Asghar Moeini"'
Publikováno v:
Operations Research Letters. 49:431-438
We establish sufficient conditions for finite convergence of the alternating projections method for two non-intersecting and potentially nonconvex sets. Our results are based on a generalization of the concept of intrinsic transversality, which until
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::884bfaaca01dee0aeade32d63fc073bc
https://doi.org/10.1016/j.orl.2021.04.009
https://doi.org/10.1016/j.orl.2021.04.009
Autor:
Amir Ahmadi-Javid, Asghar Moeini
Publikováno v:
Journal of Statistical Planning and Inference. 201:1-19
This paper studies a class of distributions supported on generalized balls and spheres that are extensions of l p balls and spheres, defined based on power-sum polynomials—which can be non-symmetric. The joint, marginal, and conditional distributio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d2bf41d97c547a957cd512eba4e132f1
https://doi.org/10.1016/j.jspi.2018.09.001
https://doi.org/10.1016/j.jspi.2018.09.001
Publikováno v:
International Journal of Production Research. 56:6450-6472
In this paper, we consider a robotic automated storage and retrieval system (AS/RS) where a Cartesian robot picks and palletises items onto a mixed pallet for any order. This robotic AS/RS not only...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90a4b06fbf7c7b2c3c24943c5e527abc
https://doi.org/10.1080/00207543.2018.1456692
https://doi.org/10.1080/00207543.2018.1456692
Publikováno v:
Computers & Industrial Engineering. 112:492-502
Scheduling of two-machine robotic rework cells with in-process inspection scenario.Converting multiple-sensor systems into single-sensor systems.Deriving cycle times of two different cycles based on a geometric distribution.A mechanism of finding the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::68675f8999c4e84fb16252f4a96fa6b3
https://doi.org/10.1016/j.cie.2017.02.009
https://doi.org/10.1016/j.cie.2017.02.009
Autor:
Asghar Moeini
Publikováno v:
European Journal of Operational Research. 260:460-467
Characterising the smallest dimension polytope containing all integer solutions of an integer programming problem can be a very challenging task. Frequently, this task is facilitated by identifying linear equality constraints that all integer solutio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8d2b2fe7895c02c5f21062a38ddc4010
https://doi.org/10.1016/j.ejor.2016.12.040
https://doi.org/10.1016/j.ejor.2016.12.040
Autor:
Jerzy A. Filar, Asghar Moeini
Publikováno v:
Annals of Operations Research. 317:605-622
We study the embedding of the Hamiltonian Cycle problem, on a symmetric graph, in a discounted Markov decision process. The embedding allows us to explore the space of occupational measures corresponding to that decision process. In this paper we con
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::503c230bcca0dbeeefba954c424b92e0
https://doi.org/10.1007/s10479-015-2030-2
https://doi.org/10.1007/s10479-015-2030-2
Autor:
Asghar Moeini, Amir Ahmadi-Javid
Publikováno v:
Statistics and Computing. 26:703-713
This paper develops an algorithm for uniform random generation over a constrained simplex, which is the intersection of a standard simplex and a given set. Uniform sampling from constrained simplexes has numerous applications in different fields, suc
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5d61fdb6ece0f5930e4985be95f43cb1
https://doi.org/10.1007/s11222-015-9553-x
https://doi.org/10.1007/s11222-015-9553-x
Publikováno v:
Journal of Manufacturing Technology Management. 26:349-363
Purpose – Computer integrated manufacturing (CIM) refers the manufacturing concept based on the use of computers to control and exchange information for the entire production process. As a result, manufacturing can be faster and less error-prone. H
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c3d87930a2e2b89f4ff13ed358390e0b
https://doi.org/10.1108/jmtm-08-2012-0079
https://doi.org/10.1108/jmtm-08-2012-0079
Publikováno v:
ICSE (Companion Volume)
The existing software release planning models aim to find a subset of software requirements with the highest value on the assumption that the value of a selected subset of requirements equals to the Accumulated Value (AV) of that subset. This assumpt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8c29b69b054f5edeff537d90d16676d4
https://doi.org/10.1109/icse-c.2017.74
https://doi.org/10.1109/icse-c.2017.74
Publikováno v:
AI 2017: Advances in Artificial Intelligence ISBN: 9783319630038
Australasian Conference on Artificial Intelligence
Australasian Conference on Artificial Intelligence
Binary Knapsack Problem (BKP) is to select a subset of items with the highest value while keeping the size within the capacity of the knapsack. This paper presents an Integer Linear Programming (ILP) model for a variation of BKP where the value of an
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af97a0d75aacb69327010b19b569407e
https://doi.org/10.1007/978-3-319-63004-5_12
https://doi.org/10.1007/978-3-319-63004-5_12
