Abstract
Many problems in engineering, planning and manufacturing can be modeled as that of minimizing or maximizing a cost function over a finite set of discrete variables. This class of so-called combinatorial optimization problems has received much attention over the years and major achievements have been made in its analysis (Ausiello et al.
Original language | English |
---|---|
Title of host publication | Search methodologies |
Place of Publication | Boston |
Publisher | Springer |
Pages | 265-286 |
Number of pages | 22 |
ISBN (Print) | 978-1-4614-6939-1 |
DOIs | |
Publication status | Published - 1 Jan 2014 |
Externally published | Yes |