DASH

Dynamic approach for switching heuristics

Giovanni Di Liberto, Serdar Kadioglu, Kevin Leo, Yuri Malitsky

Research output: Contribution to conferenceAbstractOther

Abstract

Complete tree search is a highly effective method for tackling combinatorial optimization and satisfaction problems. Over the years, a plethora of branching heuristics have been introduced to further refine the technique for varying problems. Yet while each new approach continued to push the state-of-the-art, parallel research began to repeatedly demonstrate that there is no single method that would perform the best on all problem instances. Tackling this issue, portfolio algorithms took the process a step further, by trying to predict the best heuristic for each instance at hand. However, the motivation behind algorithm selection can be taken further still, and used to dynamically choose the most appropriate algorithm for each encountered sub-problem.

Original languageEnglish
Pages886
Number of pages1
DOIs
Publication statusPublished - 2016
Externally publishedYes
EventInternational Conference on Principles and Practice of Constraint Programming 2016 - Toulouse, France
Duration: 5 Sep 20169 Sep 2016
Conference number: 22d
http://cp2016.a4cp.org/

Conference

ConferenceInternational Conference on Principles and Practice of Constraint Programming 2016
Abbreviated titleCP 2016
CountryFrance
CityToulouse
Period5/09/169/09/16
Internet address

Cite this

Di Liberto, G., Kadioglu, S., Leo, K., & Malitsky, Y. (2016). DASH: Dynamic approach for switching heuristics. 886. Abstract from International Conference on Principles and Practice of Constraint Programming 2016, Toulouse, France. https://doi.org/10.1007/978-3-319-44953-1
Di Liberto, Giovanni ; Kadioglu, Serdar ; Leo, Kevin ; Malitsky, Yuri. / DASH : Dynamic approach for switching heuristics. Abstract from International Conference on Principles and Practice of Constraint Programming 2016, Toulouse, France.1 p.
@conference{d99b367af15f4a41ab26a1307517f106,
title = "DASH: Dynamic approach for switching heuristics",
abstract = "Complete tree search is a highly effective method for tackling combinatorial optimization and satisfaction problems. Over the years, a plethora of branching heuristics have been introduced to further refine the technique for varying problems. Yet while each new approach continued to push the state-of-the-art, parallel research began to repeatedly demonstrate that there is no single method that would perform the best on all problem instances. Tackling this issue, portfolio algorithms took the process a step further, by trying to predict the best heuristic for each instance at hand. However, the motivation behind algorithm selection can be taken further still, and used to dynamically choose the most appropriate algorithm for each encountered sub-problem.",
author = "{Di Liberto}, Giovanni and Serdar Kadioglu and Kevin Leo and Yuri Malitsky",
year = "2016",
doi = "10.1007/978-3-319-44953-1",
language = "English",
pages = "886",
note = "International Conference on Principles and Practice of Constraint Programming 2016, CP 2016 ; Conference date: 05-09-2016 Through 09-09-2016",
url = "http://cp2016.a4cp.org/",

}

Di Liberto, G, Kadioglu, S, Leo, K & Malitsky, Y 2016, 'DASH: Dynamic approach for switching heuristics' International Conference on Principles and Practice of Constraint Programming 2016, Toulouse, France, 5/09/16 - 9/09/16, pp. 886. https://doi.org/10.1007/978-3-319-44953-1

DASH : Dynamic approach for switching heuristics. / Di Liberto, Giovanni; Kadioglu, Serdar; Leo, Kevin; Malitsky, Yuri.

2016. 886 Abstract from International Conference on Principles and Practice of Constraint Programming 2016, Toulouse, France.

Research output: Contribution to conferenceAbstractOther

TY - CONF

T1 - DASH

T2 - Dynamic approach for switching heuristics

AU - Di Liberto, Giovanni

AU - Kadioglu, Serdar

AU - Leo, Kevin

AU - Malitsky, Yuri

PY - 2016

Y1 - 2016

N2 - Complete tree search is a highly effective method for tackling combinatorial optimization and satisfaction problems. Over the years, a plethora of branching heuristics have been introduced to further refine the technique for varying problems. Yet while each new approach continued to push the state-of-the-art, parallel research began to repeatedly demonstrate that there is no single method that would perform the best on all problem instances. Tackling this issue, portfolio algorithms took the process a step further, by trying to predict the best heuristic for each instance at hand. However, the motivation behind algorithm selection can be taken further still, and used to dynamically choose the most appropriate algorithm for each encountered sub-problem.

AB - Complete tree search is a highly effective method for tackling combinatorial optimization and satisfaction problems. Over the years, a plethora of branching heuristics have been introduced to further refine the technique for varying problems. Yet while each new approach continued to push the state-of-the-art, parallel research began to repeatedly demonstrate that there is no single method that would perform the best on all problem instances. Tackling this issue, portfolio algorithms took the process a step further, by trying to predict the best heuristic for each instance at hand. However, the motivation behind algorithm selection can be taken further still, and used to dynamically choose the most appropriate algorithm for each encountered sub-problem.

UR - http://www.scopus.com/inward/record.url?scp=84986215088&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-44953-1

DO - 10.1007/978-3-319-44953-1

M3 - Abstract

SP - 886

ER -

Di Liberto G, Kadioglu S, Leo K, Malitsky Y. DASH: Dynamic approach for switching heuristics. 2016. Abstract from International Conference on Principles and Practice of Constraint Programming 2016, Toulouse, France. https://doi.org/10.1007/978-3-319-44953-1