Hadjiconstantinou Eleni

Eleni Hadjiconstantinou

Information about the author Eleni Hadjiconstantinou will soon be added to the site.
Found 10 papers in total
A new path-based cutting plane approach for the discrete time-cost tradeoff problem
A new path-based cutting plane approach for the discrete time-cost tradeoff problem
2010
Determining discrete time-cost tradeoffs in project networks allows for the control of...
Evaluation of operational plans in container terminal yards using Discrete-Event Simulation
Evaluation of operational plans in container terminal yards using Discrete-Event Simulation
2008
As the world container volumes are soaring, container terminals form a very important...
An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation
An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation
2004
The capacitated vehicle routing problem (CVRP) is the problem in which a set of...
New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
2002
The two-dimensional orthogonal non-guillotine cutting stock problem (NGCP) appears in...
Lower bounds from state space relaxations for concave cost network flow problems
Lower bounds from state space relaxations for concave cost network flow problems
2006
In this paper we obtain Lower Bounds (LBs) to concave cost network flow problems. The...
An efficient implementation of an algorithm for finding K shortest simple paths
An efficient implementation of an algorithm for finding K shortest simple paths
1999
In this article, we present an efficient computational implementation of an algorithm...
A new method for solving capacitated location problems based on a set partitioning approach
A new method for solving capacitated location problems based on a set partitioning approach
2002
We consider the capacitated p -median problem (CPMP) in which a set of n customers...
An exact algorithm for general, orthogonal, two-dimensional knapsack problems
An exact algorithm for general, orthogonal, two-dimensional knapsack problems
1995
We present a new exact tree-search procedure for solving two-dimensional knapsack...
An exact algorithm of orthogonal 2-D cutting problems using guillotine cuts
An exact algorithm of orthogonal 2-D cutting problems using guillotine cuts
1995
We consider the two-dimensional cutting problem which requires cutting a number of...
A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations
A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations
1995
The authors consider the basic Vehicle Routing Problem (VRP) in which a fleet of M...
Papers per page: