Angel Eric

Eric Angel

Information about the author Eric Angel will soon be added to the site.
Found 6 papers in total
On truthfulness and approximation for scheduling selfish tasks
On truthfulness and approximation for scheduling selfish tasks
2009
We consider the problem of designing truthful mechanisms for scheduling n tasks on a...
How good are shortest processing time (SPT) schedules for fair optimality criteria?
How good are shortest processing time (SPT) schedules for fair optimality criteria?
2008
We consider the following scheduling setting: a set of n tasks have to be executed on...
An exponential (matching based) neighborhood for the vehicle routing problem
An exponential (matching based) neighborhood for the vehicle routing problem
2008
We introduce an exponential neighborhood for the Vehicle Routing Problem with unit...
A note on scheduling to meet two min-sum objectives
A note on scheduling to meet two min-sum objectives
2007
We consider a single machine scheduling problem with two min-sum objective functions:...
On the hardness of the quadratic assignment problem with metaheuristics
On the hardness of the quadratic assignment problem with metaheuristics
2002
Meta-heuristics are a powerful way to approximately solve hard combinatorial...
On the classification of NP-complete problems in terms of their correlation coefficient
On the classification of NP-complete problems in terms of their correlation coefficient
2000
Local search and its variants simulated annealing and tabu search are very popular...
Papers per page: