Sökning: "constraint-based local search"
Hittade 2 avhandlingar innehållade orden constraint-based local search.
- Detta är en avhandling från Uppsala : Acta Universitatis Upsaliensis
Sammanfattning : Combinatorial problems are ubiquitous in our society and solving such problems efficiently is often crucial. One technique for solving combinatorial problems is constraint-based local search. Its compositional nature together with its efficiency on large problem instances have made this technique particularly attractive. LÄS MER
- Detta är en avhandling från Uppsala University
Sammanfattning : Combinatorial optimisation problems are ubiquitous in our society and appear in such varied guises as DNA sequencing, scheduling, configuration, airline-crew and nurse rostering, combinatorial auctions, vehicle routing, and financial portfolio design. Their efficient solution is crucial to many people and has been the target for much research during the last decades. LÄS MER