Showing 1 - 4 of 4
For most computationally intractable problems there exists no heuristic that is equally effective on all instances. Rather, any given heuristic may do well on some instances but will do worse on others. Indeed, even the 'best' heuristics will be dominated by others on at least some subclasses of...
Persistent link: https://www.econbiz.de/10011734733
It is well-known that for many project scheduling problems the Space AS of active schedules contains at least one optimal solution for each feasible instance, so restricting heuristic construction methods to AS will improve algorithmic efficiency without foresaking the chance to eventually find...
Persistent link: https://www.econbiz.de/10011735063
Persistent link: https://www.econbiz.de/10011787499
Persistent link: https://www.econbiz.de/10014265740