Efficient enumeration of optimal and approximate solutions of a scheduling problem

Sergey Sevastyanov, Bertrand M.T. Lin

研究成果: Paper同行評審

摘要

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, Italy
持續時間: 14 6月 201116 6月 2011

Conference

Conference10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011
國家/地區Italy
城市Frascati
期間14/06/1116/06/11

指紋

深入研究「Efficient enumeration of optimal and approximate solutions of a scheduling problem」主題。共同形成了獨特的指紋。

引用此