What makes an optimization problem hard?.
From MaRDI portal
Publication:960453
DOI10.1002/cplx.6130010511zbMath1455.90156OpenAlexW2279189561MaRDI QIDQ960453
William G. Macready, David H. Wolpert
Publication date: 21 December 2008
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/cplx.6130010511
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (8)
Generating new test instances by evolving in instance space ⋮ Exploring the role of graph spectra in graph coloring algorithm performance ⋮ Discovering the suitability of optimisation algorithms by learning from evolved instances ⋮ What Is Important About the No Free Lunch Theorems? ⋮ Unrelated parallel machine scheduling -- perspectives and progress ⋮ Global optimization test problems based on random field composition ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Theory versus practice in annealing-based quantum computing
This page was built for publication: What makes an optimization problem hard?.
