Can we measure the difficulty of an optimization problem?
an we measure the difficulty of an optimization problem? Although optimization plays a crucial role in modern science and technology, a formal framework that puts problems and solution algorithms into a broader context has not been established. This paper presents a conceptual approach which gives a positive answer to the question for a broad class of optimization problems. Adopting an information and computational perspective, the proposed framework builds upon Shannon and algorithmic...[Show more]
|Collections||ANU Research Publications|
|Source:||2014 IEEE Information Theory Workshop (ITW), Hobart, TAS., 2-5 Nov. 2014|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.