Skip navigation
Skip navigation

Can we measure the difficulty of an optimization problem?

Alpcan, Tansu; Everitt, Tom; Hutter, Marcus

Description

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]

CollectionsANU Research Publications
Date published: 2014-11
Type: Conference paper
URI: http://hdl.handle.net/1885/14703
Source: 2014 IEEE Information Theory Workshop (ITW), Hobart, TAS., 2-5 Nov. 2014
DOI: 10.1109/ITW.2014.6970853

Download

There are no files associated with this item.


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  12 November 2018/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator