It is well known, and it is easy to prove that any problem can be formulated and tackled as an optimization problem since solving it means basically making deci- sions. Every day each of us continually makes decisions during own daily activities, from simple and automatic ones (e.g., choose a food or dress to wear), to more challenging and complex ones (e.g., in which stock market to invest), and, further, such decisions must be taken quickly and effectively. Making decisions, mean choosing an action or an option from several alternatives according to an expected utility, that is, select among all available options the one that optimize a given goal, such as for example the classical goal of maximizing profits and minimizing costs.
Metaheuristics for Combinatorial Optimization / Greco S, Pavone M.F., Talbi E.-G., Vigo D.. - STAMPA. - 1332:(2021), pp. 1-60.
Metaheuristics for Combinatorial Optimization
Vigo D.Membro del Collaboration Group
2021
Abstract
It is well known, and it is easy to prove that any problem can be formulated and tackled as an optimization problem since solving it means basically making deci- sions. Every day each of us continually makes decisions during own daily activities, from simple and automatic ones (e.g., choose a food or dress to wear), to more challenging and complex ones (e.g., in which stock market to invest), and, further, such decisions must be taken quickly and effectively. Making decisions, mean choosing an action or an option from several alternatives according to an expected utility, that is, select among all available options the one that optimize a given goal, such as for example the classical goal of maximizing profits and minimizing costs.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
