摘要
When dealing with optimization problems, one normally searches for a "best solution" with respect to a certain objective function. But in reality, the decisionmaking process is not that simple, and while solving a real life problem, we choose a "proper" solution from among those ones that are good enough with respect to a given criterion, while our ultimate choice depends on a variety of difficult-toformalize conditions. In that case we may be interested in enumerating (without repetition) the set of all approximate solutions that meet a given bound on inaccuracy.
原文 | English |
---|---|
頁面 | 248-251 |
頁數 | 4 |
出版狀態 | Published - 14 6月 2011 |
事件 | 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011 - Frascati, 意大利 持續時間: 14 6月 2011 → 16 6月 2011 |
Conference
Conference | 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011 |
---|---|
國家/地區 | 意大利 |
城市 | Frascati |
期間 | 14/06/11 → 16/06/11 |