67 search results - page 3 / 14 » A heuristic method for the minimum toll booth problem |
DSOM
2007
Springer
14 years 12 days ago
2007
Springer
Abstract. We investigate the problem of ensuring and maximizing performance guarantees for applications suering software aging. Our focus is the optimization of the minimum and av...
AAAI
1996
13 years 7 months ago
1996
Two methods are described for enhancing performance of branch and bound methods for overconstrained CSPS. These methods improve either the upper or lower bound, respectively, duri...
EOR
2002
13 years 6 months ago
2002
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
GECCO
2009
Springer
14 years 24 days ago
2009
Springer
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
GECCO
2007
Springer
14 years 12 days ago
2007
Springer
Constrained continuous optimization is still an interesting field of research. Many heuristics have been proposed in the last decade. Most of them are based on penalty functions....