The following pages link to Eleni Hadjiconstantinou (Q237399):
Displayed 20 items.
- Item:Q237399 (redirect page) (← links)
- A decomposition-based stochastic programming approach for the project scheduling problem under time/cost trade-off settings and uncertain durations (Q991368) (← links)
- A new path-based cutting plane approach for the discrete time-cost tradeoff problem (Q993703) (← links)
- A linear and discrete programming framework for representing qualitative knowledge (Q1309850) (← links)
- Tools for reformulating logical forms into zero-one mixed integer programs (Q1317155) (← links)
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts (Q1388926) (← links)
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems (Q1388927) (← links)
- A new exact algorithm for the vehicle routing problem based on \(q\)-paths and \(k\)-shortest paths relaxations (Q1908292) (← links)
- Lower bounds from state space relaxations for concave cost network flow problems (Q2494472) (← links)
- A branch-and-bound algorithm for concave network flow problems (Q2494473) (← links)
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems (Q2503087) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- A multi-depot period vehicle routing problem arising in the utilities sector (Q3157801) (← links)
- (Q4267389) (← links)
- Upper bounds for single-source uncapacitated concave minimum-cost network flow problems (Q4419278) (← links)
- An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections (Q4422622) (← links)
- (Q4532236) (← links)
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem (Q4814179) (← links)
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation (Q5321991) (← links)
- A new method for solving capacitated location problems based on a set partitioning approach (Q5959081) (← links)