Emanuel Melachrinoudis

According to our database1, Emanuel Melachrinoudis authored at least 27 papers between 1988 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2020
Reliable maximin-maxisum locations for maximum service availability on tree networks vulnerable to disruptions.
Ann. Oper. Res., 2020

2017
A path-based capacitated network flow model for empty railcar distribution.
Ann. Oper. Res., 2017

2016
Maximizing revenue of end of life items in retail stores.
Eur. J. Oper. Res., 2016

Modeling wildfire propagation with the stochastic shortest path: A fast simulation approach.
Environ. Model. Softw., 2016

2013
Optimal Collection Period for Returned Products in the Reverse Supply Chain.
Proceedings of the 7th IFAC Conference on Manufacturing Modelling, Management, and Control, 2013

2012
Location of a semi-obnoxious facility with elliptic maximin and network minisum objectives.
Eur. J. Oper. Res., 2012

2009
Network location of a reliable center using the most reliable route policy.
Comput. Oper. Res., 2009

2008
Controlled sink mobility for prolonging wireless sensor networks lifetime.
Wirel. Networks, 2008

The hybrid queuing and bi-objective integer programming model for scheduling frontline employees in a retail organisation.
Int. J. Serv. Technol. Manag., 2008

2007
Location of a reliable center on a tree network.
Oper. Res., 2007

Redesigning a warehouse network.
Eur. J. Oper. Res., 2007

A dial-a-ride problem for client transportation in a health-care organization.
Comput. Oper. Res., 2007

2006
Protocols and model for sink mobility in wireless sensor networks.
ACM SIGMOBILE Mob. Comput. Commun. Rev., 2006

A New MILP Formulation and Distributed Protocols for Wireless Sensor Networks Lifetime Maximization.
Proceedings of IEEE International Conference on Communications, 2006

2005
Exploiting Sink Mobility for Maximizing Sensor Networks Lifetime.
Proceedings of the 38th Hawaii International Conference on System Sciences (HICSS-38 2005), 2005

2004
A branch & bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints.
Comput. Oper. Res., 2004

Bi-Criteria Models for All-Uses Test Suite Reduction.
Proceedings of the 26th International Conference on Software Engineering (ICSE 2004), 2004

2003
Semi-obnoxious single facility location in Euclidean space.
Comput. Oper. Res., 2003

2001
The Maximin-Maxisum Network Location Problem.
Comput. Optim. Appl., 2001

Optimizing the Design of a CDMA Cellular System Configuration with Multiple Criteria.
Ann. Oper. Res., 2001

2000
The dynamic relocation and phase-out of a hybrid, two-echelon plant/warehousing facility: A multiple objective approach.
Eur. J. Oper. Res., 2000

1999
An <i>O</i>(<i>mn</i>) Algorithm for the 1-maximin problem on a network.
Comput. Oper. Res., 1999

1997
Facility Location and Reliable Route Planning in Hazardous Material Transportation.
Transp. Sci., 1997

1996
A single facility location problem on a tree with unreliable edges.
Networks, 1996

1995
An O(mn<sup>2</sup>) algorithm for the Maximin problem in E<sup>2</sup>.
Oper. Res. Lett., 1995

1994
Complementarity and equivalence in finite source queueing models with spares.
Comput. Oper. Res., 1994

1988
An Efficient Computational Procedure for the Rectilinear MAXIMIN Location Problem.
Transp. Sci., 1988


  Loading...