Eleni Hadjiconstantinou

According to our database1, Eleni Hadjiconstantinou authored at least 18 papers between 1995 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Preface: advances in theoretical and practical combinatorial optimization.
Ann. Oper. Res., 2019

2018
Relationship archetypes in aftermarkets.
Int. J. Prod. Res., 2018

2010
A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations.
Comput. Oper. Res., 2010

A new path-based cutting plane approach for the discrete time-cost tradeoff problem.
Comput. Manag. Sci., 2010

2008
Evaluation of operational plans in container terminal yards using Discrete-Event Simulation.
OR Insight, 2008

2007
A hybrid genetic algorithm for the two-dimensional single large object placement problem.
Eur. J. Oper. Res., 2007

2006
A Branch-and-Bound Algorithm for Concave Network Flow Problems.
J. Glob. Optim., 2006

Lower Bounds from State Space Relaxations for Concave Cost Network Flow Problems.
J. Glob. Optim., 2006

A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems.
Eur. J. Oper. Res., 2006

2004
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation.
Oper. Res., 2004

An Ant Colony Heuristic for the Design of Two-Edge Connected Flow Networks.
Proceedings of the Ant Colony Optimization and Swarm Intelligence, 2004

2003
Upper bounds for single-source uncapacitated concave minimum-cost network flow problems.
Networks, 2003

An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections.
Networks, 2003

2002
A new method for solving capacitated location problems based on a set partitioning approach.
Comput. Oper. Res., 2002

Routing under Uncertainty: An Application in the Scheduling of Field Service Engineers.
Proceedings of the Vehicle Routing Problem., 2002

1999
An efficient implementation of an algorithm for finding K shortest simple paths.
Networks, 1999

1998
A multi-depot period vehicle routing problem arising in the utilities sector.
J. Oper. Res. Soc., 1998

1995
A new exact algorithm for the vehicle routing problem based on<i>q</i>-paths and<i>k</i>-shortest paths relaxations.
Ann. Oper. Res., 1995


  Loading...