Optimization Theory, Decision Making, and Operations Research Applications
Tahun : 2013Pengarang : Athanasios Migdalas • Angelo Sifaleras Christos K. Georgiadis • Jason Papathanasiou Emmanuil Stiakakis
Penerbit : springer
Ket : The two most known paradigms to come up with NP-hard problems are either the exact computation (i.e., the computation of optimal solutions for them) or the heuristic resolution, i.e., the development of fast algorithms that hopefully compute near-optimal solutions. Notable part of the heuristic paradigm is the so-called polynomial approximation where one tries to devise polynomial algorithms computing feasible solutions that are close to optimal under an a priori criterion called approximation ratio.
Ketegori : OPERATIONAL RESEARCH
