default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAgha Iqbal Ali
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j16]Agha Iqbal Ali, Guven Ince:
Distress among disaster-affected populations: delay in relief provision. J. Oper. Res. Soc. 68(5): 533-543 (2017)- [j15]Ahmed Ghoniem
, Agha Iqbal Ali, Mohammed Al-Salem, Wael K. M. Alhajyaseen:
Prescriptive analytics for FIFA World Cup lodging capacity planning. J. Oper. Res. Soc. 68(10): 1183-1194 (2017) - 2014
- [j14]Agha Iqbal Ali, Ahmed Ghoniem, Alexander Franke:
Evaluating capacity management tactics for a legacy manufacturing plant. J. Oper. Res. Soc. 65(9): 1361-1370 (2014) - 2010
- [j13]Agha Iqbal Ali, Debra J. O'Connor:
The impact of distribution system characteristics on computational tractability. Eur. J. Oper. Res. 200(2): 323-333 (2010)
2000 – 2009
- 2004
- [j12]Yao Chen, Agha Iqbal Ali:
DEA Malmquist productivity measure: New insights with an application to computer industry. Eur. J. Oper. Res. 159(1): 239-249 (2004) - 2002
- [j11]Yao Chen, Agha Iqbal Ali:
Output-input ratio analysis and DEA frontier. Eur. J. Oper. Res. 142(3): 476-479 (2002)
1990 – 1999
- 1998
- [j10]Agha Iqbal Ali:
Reformulation of the set partitioning problem as apure network with special order set constraints. Ann. Oper. Res. 81: 233-250 (1998) - [j9]Agha Iqbal Ali, Tom blanco, Ben Buclatin:
Goal network programs: A specialized algorithm and an application. Eur. J. Oper. Res. 106(1): 191-197 (1998) - [j8]Agha Iqbal Ali, Hyun-Soo Han:
Computational implementation of Fujishige's graph realizability algorithm. Eur. J. Oper. Res. 108(2): 452-463 (1998) - 1997
- [j7]Agha Iqbal Ali, Catherine S. Lerme:
Comparative advantage and disadvantage in DEA. Ann. Oper. Res. 73: 215-232 (1997) - 1996
- [j6]Agha Iqbal Ali, Shirley Shmerling:
Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies. Oper. Res. Lett. 18(4): 177-184 (1996) - 1995
- [c1]Agha Iqbal Ali, Hyun-Soo Han, Jeffery L. Kennington:
Use of Hidden Network Structure in the Set Partitioning Problem. IPCO 1995: 172-184 - 1991
- [j5]Agha Iqbal Ali, Chung-Hsing Huang:
Balanced spanning forests and trees. Networks 21(6): 667-687 (1991)
1980 – 1989
- 1989
- [j4]Agha Iqbal Ali, Rema Padman, Hemalatha Thiagarajan:
Dual Algorithms for Pure Network Problems. Oper. Res. 37(1): 159-171 (1989) - 1986
- [j3]Agha Iqbal Ali, Jeff L. Kennington:
The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm. Discret. Appl. Math. 13(2-3): 259-276 (1986) - 1980
- [j2]Agha Iqbal Ali, Richard V. Helgason, Jeffery L. Kennington, H. S. Lall:
Technical Note - Computational Comparison among Three Multicommodity Network Flow Algorithms. Oper. Res. 28(4): 995-1000 (1980)
1970 – 1979
- 1978
- [j1]Agha Iqbal Ali, Richard V. Helgason, Jeffery L. Kennington, H. S. Lall:
Primal simplex network codes: State-of-the-art implementation technology. Networks 8(4): 315-339 (1978)
Coauthor Index
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-05-08 21:43 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:
