default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Amiri 0001
Person information
- affiliation: Oklohoma State University, Spears School of Business, Stillwater, OK, USA
Other persons with the same name
- Ali Amiri — disambiguation page
- Ali Amiri 0002
![[0000-0003-2297-8707]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0003-2297-8707")
— University of Zanjan, Department of Computer Engineering, Iran (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Ali Amiri, Reza Barkhi:
The bundled task assignment problem in mobile crowdsensing: A column generation-based solution approach. Expert Syst. Appl. 237(Part C): 121657 (2024)- 2022
- [j29]Ali Amiri:
The application grouping problem in Software-as-a-Service (SaaS) networks. Inf. Technol. Manag. 23(2): 125-137 (2022) - 2021
- [j28]Ali Amiri, Reza Barkhi:
A Lagrangean based solution algorithm for the multiple knapsack problem with setups. Comput. Ind. Eng. 153: 107089 (2021) - 2020
- [j27]Ali Amiri:
A Lagrangean based solution algorithm for the knapsack problem with setups. Expert Syst. Appl. 143 (2020)
2010 – 2019
- 2017
- [j26]Ali Amiri:
Application placement in computer clustering in software as a service (SaaS) networks. Inf. Technol. Manag. 18(2): 161-173 (2017) - 2016
- [j25]Ali Amiri:
Application placement and backup service in computer clustering in Software as a Service (SaaS) networks. Comput. Oper. Res. 69: 48-55 (2016) - 2011
- [j24]Ali Amiri, Reza Barkhi:
The combinatorial bandwidth packing problem. Eur. J. Oper. Res. 208(1): 37-45 (2011) - 2010
- [j23]Ali Amiri:
A Probabilistic Greedy Algorithm for Channel Assignment in Cellular Radio Networks. IEEE Trans. Commun. 58(11): 3286-3295 (2010)
2000 – 2009
- 2009
- [j22]Ali Amiri:
An efficient link allocation algorithm for survivable ATM-based personal communication networks. Comput. Oper. Res. 36(5): 1615-1621 (2009) - 2007
- [j21]Ali Amiri:
Dare to share: Protecting sensitive knowledge with data sanitization. Decis. Support Syst. 43(1): 181-191 (2007) - 2006
- [j20]Ali Amiri:
Customer-oriented catalog segmentation: Effective solution approaches. Decis. Support Syst. 42(3): 1860-1871 (2006) - [j19]Ali Amiri:
Designing a distribution network in a supply chain system: Formulation and efficient solution procedure. Eur. J. Oper. Res. 171(2): 567-576 (2006) - [j18]Ali Amiri, Syam Menon:
Scheduling Web Banner Advertisements With Multiple Display Frequencies. IEEE Trans. Syst. Man Cybern. Part A 36(2): 245-251 (2006) - [j17]Syam Menon, Ali Amiri:
Multiperiod cellular network design via price-influenced simulated annealing (PISA). IEEE Trans. Syst. Man Cybern. Part B 36(3): 600-610 (2006) - 2005
- [j16]Ali Amiri:
The selection and scheduling of telecommunication calls with time windows. Eur. J. Oper. Res. 167(1): 243-256 (2005) - [j15]Syam Menon, Ali Amiri:
Designing Partially Survivable Cellular Telecommunications Networks. Inf. Technol. Manag. 6(2-3): 293-303 (2005) - 2004
- [j14]Syam Menon, Ali Amiri:
Scheduling Banner Advertisements on the Web. INFORMS J. Comput. 16(1): 95-105 (2004) - [j13]Ali Amiri:
A coordinated planning model for the design of a distributed database system. Inf. Sci. 164(1-4): 229-245 (2004) - 2003
- [j12]Ali Amiri:
The Multi-Hour Bandwidth Packing Problem with Response Time Guarantees. Inf. Technol. Manag. 4(1): 113-127 (2003) - [j11]Ali Amiri, Syam Menon:
Efficient scheduling of Internet banner advertisements. ACM Trans. Internet Techn. 3(4): 334-346 (2003) - 2002
- [j10]Ali Amiri:
An integrated approach for planning the adoption of client/server systems. Eur. J. Oper. Res. 142(3): 509-522 (2002) - 2001
- [j9]Ali Amiri:
The multi-hour service system design problem. Eur. J. Oper. Res. 128(3): 625-638 (2001) - 2000
- [j8]Ali Amiri, Reza Barkhi:
The multi-hour bandwidth packing problem. Comput. Oper. Res. 27(1): 1-14 (2000)
1990 – 1999
- 1999
- [j7]Erik Rolland, Ali Amiri, Reza Barkhi:
Queueing delay guarantees in bandwidth packing. Comput. Oper. Res. 26(9): 921-935 (1999) - [j6]Ali Amiri, Erik Rolland, Reza Barkhi:
Bandwidth packing with queuing delay costs: Bounding and heuristic solution procedures. Eur. J. Oper. Res. 112(3): 635-645 (1999) - [j5]Ali Amiri, Hasan Pirkul:
Routing and capacity assignment in backbone communication networks under time varying traffic conditions. Eur. J. Oper. Res. 117(1): 15-29 (1999) - 1998
- [j4]Ali Amiri:
A system for the design of packet-switched communication networks with economic tradeoffs. Comput. Commun. 21(18): 1670-1680 (1998) - 1997
- [j3]Ali Amiri:
Solution procedures for the service system design problem. Comput. Oper. Res. 24(1): 49-60 (1997) - [j2]Ali Amiri, Hasan Pirkul:
Routing and capacity assignment in backbone communication networks. Comput. Oper. Res. 24(3): 275-287 (1997) - 1994
- [j1]Hasan Pirkul, Ali Amiri:
Routing in packet-switched communication networks. Comput. Commun. 17(5): 307-316 (1994)
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-09-21 02:37 CEST 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:
