Skip navigation
Skip navigation

Can we measure the difficulty of an optimization problem?

Alpcan, Tansu; Everitt, Tom; Hutter, Marcus

Description

Can 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
Type: Conference paper
URI: http://hdl.handle.net/1885/58203
DOI: 10.1109/ITW.2014.6970853

Download

File Description SizeFormat Image
01_Alpcan_Can_we_measure_the_difficulty_2014.pdf143.85 kBAdobe PDF    Request a copy


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

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator