default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmanuel Melachrinoudis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j23]José A. Santiváñez
, Emanuel Melachrinoudis:
Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions. Ann. Oper. Res. 286(1): 669-701 (2020)
2010 – 2019
- 2017
- [j22]Ruhollah Heydari, Emanuel Melachrinoudis:
A path-based capacitated network flow model for empty railcar distribution. Ann. Oper. Res. 253(2): 773-798 (2017) - 2016
- [j21]Mohammad Hajian, Emanuel Melachrinoudis, Peter Kubat:
Modeling wildfire propagation with the stochastic shortest path: A fast simulation approach. Environ. Model. Softw. 82: 73-88 (2016) - [j20]Nizar Zaarour, Emanuel Melachrinoudis, Marius M. Solomon:
Maximizing revenue of end of life items in retail stores. Eur. J. Oper. Res. 255(1): 133-141 (2016) - 2013
- [c4]Nizar Zaarour, Emanuel Melachrinoudis, Marius M. Solomon, Hokey Min:
Optimal Collection Period for Returned Products in the Reverse Supply Chain. MIM 2013: 123-127 - 2012
- [j19]Ruhollah Heydari, Emanuel Melachrinoudis:
Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives. Eur. J. Oper. Res. 223(2): 452-460 (2012)
2000 – 2009
- 2009
- [j18]José A. Santiváñez, Emanuel Melachrinoudis, Mary E. Helander:
Network location of a reliable center using the most reliable route policy. Comput. Oper. Res. 36(5): 1437-1460 (2009) - 2008
- [j17]Emanuel Melachrinoudis, Hokey Min:
The hybrid queuing and bi-objective integer programming model for scheduling frontline employees in a retail organisation. Int. J. Serv. Technol. Manag. 9(1): 33-50 (2008) - [j16]Stefano Basagni, Alessio Carosi, Emanuel Melachrinoudis, Chiara Petrioli, Z. Maria Wang:
Controlled sink mobility for prolonging wireless sensor networks lifetime. Wirel. Networks 14(6): 831-858 (2008) - 2007
- [j15]Emanuel Melachrinoudis, Ahmet B. Ilhan, Hokey Min:
A dial-a-ride problem for client transportation in a health-care organization. Comput. Oper. Res. 34(3): 742-759 (2007) - [j14]Emanuel Melachrinoudis, Hokey Min:
Redesigning a warehouse network. Eur. J. Oper. Res. 176(1): 210-229 (2007) - [j13]José A. Santiváñez, Emanuel Melachrinoudis:
Location of a reliable center on a tree network. Oper. Res. 7(3): 419-445 (2007) - 2006
- [j12]Stefano Basagni, Alessio Carosi, Emanuel Melachrinoudis, Chiara Petrioli, Z. Maria Wang:
Protocols and model for sink mobility in wireless sensor networks. ACM SIGMOBILE Mob. Comput. Commun. Rev. 10(4): 28-30 (2006) - [c3]Stefano Basagni, Alessio Carosi, Emanuel Melachrinoudis, Chiara Petrioli, Z. Maria Wang:
A New MILP Formulation and Distributed Protocols for Wireless Sensor Networks Lifetime Maximization. ICC 2006: 3517-3524 - 2005
- [c2]Z. Maria Wang, Stefano Basagni, Emanuel Melachrinoudis, Chiara Petrioli:
Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime. HICSS 2005 - 2004
- [j11]George Kozanidis, Emanuel Melachrinoudis:
A branch & bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints. Comput. Oper. Res. 31(5): 695-711 (2004) - [c1]Jennifer Black, Emanuel Melachrinoudis, David R. Kaeli:
Bi-Criteria Models for All-Uses Test Suite Reduction. ICSE 2004: 106-115 - 2003
- [j10]Emanuel Melachrinoudis, Zaharias Xanthopulos:
Semi-obnoxious single facility location in Euclidean space. Comput. Oper. Res. 30(14): 2191-2209 (2003) - 2001
- [j9]Emanuel Melachrinoudis, Bakhtiar Rosyidi:
Optimizing the Design of a CDMA Cellular System Configuration with Multiple Criteria. Ann. Oper. Res. 106(1-4): 307-329 (2001) - [j8]Frank GuangSheng Zhang, Emanuel Melachrinoudis:
The Maximin-Maxisum Network Location Problem. Comput. Optim. Appl. 19(2): 209-234 (2001) - 2000
- [j7]Emanuel Melachrinoudis, Hokey Min:
The dynamic relocation and phase-out of a hybrid, two-echelon plant/warehousing facility: A multiple objective approach. Eur. J. Oper. Res. 123(1): 1-15 (2000)
1990 – 1999
- 1999
- [j6]Emanuel Melachrinoudis, Frank GuangSheng Zhang:
An O(mn) Algorithm for the 1-maximin problem on a network. Comput. Oper. Res. 26(9): 849-869 (1999) - 1997
- [j5]Mary E. Helander, Emanuel Melachrinoudis:
Facility Location and Reliable Route Planning in Hazardous Material Transportation. Transp. Sci. 31(3): 216-226 (1997) - 1996
- [j4]Emanuel Melachrinoudis, Mary E. Helander:
A single facility location problem on a tree with unreliable edges. Networks 27(4): 219-237 (1996) - 1995
- [j3]Emanuel Melachrinoudis, J. MacGregor Smith:
An O(mn2) algorithm for the Maximin problem in E2. Oper. Res. Lett. 18(1): 25-30 (1995) - 1994
- [j2]Surendra M. Gupta, Emanuel Melachrinoudis:
Complementarity and equivalence in finite source queueing models with spares. Comput. Oper. Res. 21(3): 289-296 (1994)
1980 – 1989
- 1988
- [j1]Emanuel Melachrinoudis:
An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem. Transp. Sci. 22(3): 217-223 (1988)
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-04-26 18:26 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:
