![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Amir Elalouf
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2022
- [j14]Daniel Cohen
, Amir Elalouf, Raz Zeev
:
Collaboration or separation maximizing the partnership between a "Gray hat" hacker and an organization in a two-stage cybersecurity game. Int. J. Inf. Manag. Data Insights 2(1): 100073 (2022) - [j13]Amir Elalouf
, Guy Wachtel:
Queueing Problems in Emergency Departments: A Review of Practical Approaches and Research Methodologies. Oper. Res. Forum 3(1) (2022) - 2021
- [j12]Amir Elalouf
:
An FPTAS for just-in-time scheduling of a flow shop manufacturing process with different service quality levels. RAIRO Oper. Res. 55(Supplement): S727-S740 (2021) - 2018
- [j11]C. T. Ng
, T. C. E. Cheng
, Dmitry Tsadikovich, Eugene Levner, Amir Elalouf
, Sharon Hovav:
A multi-criterion approach to optimal vaccination planning: Method and solution. Comput. Ind. Eng. 126: 637-649 (2018) - [j10]Hadas Elalouf, Moshe Kaspi
, Amir Elalouf, Ilan Halachmi:
Optimal operation policy for a sustainable recirculation aquaculture system for ornamental fish: Simulation and response surface methodology. Comput. Oper. Res. 89: 230-240 (2018) - [j9]Yael Perlman
, Amir Elalouf, Uri Yechiali:
Dynamic allocation of stochastically-arriving flexible resources to random streams of objects with application to kidney cross-transplantation. Eur. J. Oper. Res. 265(1): 169-177 (2018) - [j8]Amir Elalouf, Dmitry Tsadikovich, Sharon Hovav:
Optimization of blood sample collection with timing and quality constraints. Int. Trans. Oper. Res. 25(1): 191-214 (2018) - 2017
- [j7]Guy Wachtel
, Amir Elalouf:
Using the "Floating Patients" method to balance crowding between the hospital emergency department and other departments. Comput. Ind. Eng. 110: 289-296 (2017) - 2016
- [j6]Amir Elalouf, Eugene Levner:
Improving the solution complexity of the scheduling problem with deadlines: A general technique. RAIRO Oper. Res. 50(4-5): 681-687 (2016) - 2014
- [j5]Amir Elalouf:
Fast approximation algorithms for routing problems with hop-wise constraints. Ann. Oper. Res. 222(1): 279-291 (2014) - [j4]Huajun Tang
, Amir Elalouf, Eugene Levner, T. C. E. Cheng
:
Efficient computation of evacuation routes on a three-dimensional geometric network. Comput. Ind. Eng. 76: 231-242 (2014) - 2013
- [j3]Amir Elalouf, Eugene Levner, T. C. E. Cheng:
Efficient Routing of Mobile Agents in a Stochastic Network. Polibits 47: 61-66 (2013) - [j2]Amir Elalouf, Eugene Levner, Huajun Tang
:
An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem. J. Sched. 16(4): 429-435 (2013) - 2011
- [j1]Eugene Levner, Amir Elalouf, T. C. Edwin Cheng:
An Improved FPTAS for Mobile Agent Routing with Time Constraints. J. Univers. Comput. Sci. 17(13): 1854-1862 (2011)
Conference and Workshop Papers
- 2022
- [c11]David Freud, Amir Elalouf:
An improved procedure for solving minimum makespan on a flowshop. CoDIT 2022: 1630-1634 - 2020
- [c10]Eugene Levner, Boris Kriheli, Arriel Benis
, Alexander Ptuskin
, Amir Elalouf, Sharon Hovav, Shai Ashkenazi:
Entropy-Based Approach to Efficient Cleaning of Big Data in Hierarchical Databases. BigData 2020: 3-12 - [c9]Tomer Kedarya, Rafael Sherbu Cohen, Amir Elalouf:
Calculating Reputation Risk of Financial Institutions. CoDIT 2020: 1174-1178 - 2018
- [c8]Guy Wachtel, Amir Elalouf, Yael Perlman
, Uri Yechiali:
Decision Support System for the Hospital's Departments: Using Armchairs as Sub-Servers. CoDIT 2018: 183-186 - [c7]Amir Elalouf, Dmitry Tsadikovich, Eugene Levner:
A location-routing problem within blood sample collection chains. CoDIT 2018: 488-491 - 2014
- [c6]Eugene Levner, Amir Elalouf:
An improved approximation algorithm for the ancient scheduling problem with deadlines. CoDIT 2014: 113-116 - [c5]Eugene Levner, Boris Kriheli, Amir Elalouf, Dmitry Tsadikovich:
A Fast Scheduling Algorithm for Detection and Localization of Hidden Objects Based on Data Gathering in Wireless Sensor Networks. MICAI (2) 2014: 436-450 - 2012
- [c4]Eugene Levner, Amir Elalouf, Huajun Tang
:
A Multi-agent Scheduling Model for Maximizing Agent Satisfaction. MIWAI 2012: 90-100 - 2011
- [c3]Amir Elalouf, Eugene Levner, T. C. Edwin Cheng
:
Efficient Routing of Mobile Agents for Agent-Based Integrated Enterprise Management: A General Acceleration Technique. EOMAS 2011: 1-20 - [c2]Eugene Levner, Avishai Ceder
, Amir Elalouf, Yuval Hadas
, Dvir Shabtay
:
Detection and improvement of deficiencies and failures in public-transportation networks using agent-enhanced distribution data mining. IEEM 2011: 694-698 - [c1]Amir Elalouf, Eugene Levner, T. C. Edwin Cheng
:
Computing Mobile Agent Routes with Node-Wise Constraints in Distributed Communication Systems. MICAI (1) 2011: 76-87
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint