![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Salah E. Elmaghraby
Person information
- affiliation: North Carolina State University
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j14]Jingwen Zhang, Salah E. Elmaghraby:
The relevance of the "alphorn of uncertainty" to the financial management of projects under uncertainty. Eur. J. Oper. Res. 238(1): 65-76 (2014) - 2010
- [j13]Marie E. Matta, Salah E. Elmaghraby:
Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop. Eur. J. Oper. Res. 201(3): 720-728 (2010)
2000 – 2009
- 2005
- [j12]Abdelhakim Artiba, Salah E. Elmaghraby:
IEPM: Focus on scheduling. Eur. J. Oper. Res. 161(1): 1-2 (2005) - [j11]Salah E. Elmaghraby:
On the fallacy of averages in project risk management. Eur. J. Oper. Res. 165(2): 307-313 (2005) - [j10]Salah E. Elmaghraby:
Mathematical Programming and Financial Objectives for Scheduling Projects. J. Sched. 8(6): 543-546 (2005) - 2001
- [j9]Mani K. Agrawal, Salah E. Elmaghraby:
On computing the distribution function of the sum of independent random variables. Comput. Oper. Res. 28(5): 473-483 (2001) - [j8]Salah E. Elmaghraby, Hanijanto Soewandi, Ming-Jong Yao:
Chance-constrained programming in activity networks: A critical evaluation. Eur. J. Oper. Res. 131(2): 440-458 (2001) - 2000
- [j7]Salah E. Elmaghraby:
On criticality and sensitivity in activity networks. Eur. J. Oper. Res. 127(2): 220-238 (2000)
1990 – 1999
- 1999
- [r1]Beth Novick, S. Louis Hakimi, Sunil Chopra, David Simchi-Levi, Salah E. Elmaghraby, Michael Mesterton-Gibbons, Joseph R. Barr:
Discrete Optimization. Handbook of Discrete and Combinatorial Mathematics 1999 - 1998
- [j6]Fouad Riane, Abdelhakim Artiba, Salah E. Elmaghraby:
A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan. Eur. J. Oper. Res. 109(2): 321-329 (1998) - [j5]Shuzhi Z. Lo, Brad A. Makrucki, Griff L. Bilbro, Salah E. Elmaghraby:
Call admission control schemes and ATM network topological design. Eur. J. Oper. Res. 111(2): 393-404 (1998) - 1993
- [j4]M. Schäffter, Karsten Weihe, Petra Mutzel, Salah E. Elmaghraby:
Book reviews. ZOR Methods Model. Oper. Res. 37(1): 112-117 (1993) - 1991
- [j3]Salah E. Elmaghraby:
Manufacturing capacity and its measurement: A critical evaluation. Comput. Oper. Res. 18(7): 615-627 (1991)
1980 – 1989
- 1985
- [j2]A. A. Elimam, Salah E. Elmaghraby:
On the reduction method for integer linear programs, II. Discret. Appl. Math. 12(3): 241-260 (1985)
1960 – 1969
- 1968
- [j1]Salah E. Elmaghraby:
A Loading Problem in Process Type Production. Oper. Res. 16(5): 902-914 (1968)
Coauthor Index
![](https://dblp1.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:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint