A Local Search Framework for Compiling Relaxed Decision Diagrams

Römer M (2018)
In: Integration of Constraint Programming, Artificial Intelligence, and Operations Research. van Hoeve W-J (Ed); Lecture Notes in Computer Science, 10848. Cham: Springer International Publishing: 512-520.

Sammelwerksbeitrag | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Herausgeber*in
van Hoeve, Willem-Jan
Abstract / Bemerkung
This paper presents a local search framework for constructing and improving relaxed decision diagrams (DDs). The framework consists of a set of elementary DD manipulation operations including a redirect operation introduced in this paper and a general algorithmic scheme. We show that the framework can be used to reproduce several standard DD compilation schemes and to create new compilation and improvement strategies. In computational experiments for the 0–1 knapsack problem, the multidimensional knapsack problem and the set covering problem we compare different compilation methods. It turns out that a new strategy based on the local search framework consistently yields better bounds, in many cases far better bounds, for limited-width DDs than previously published heuristic strategies.
Erscheinungsjahr
2018
Buchtitel
Integration of Constraint Programming, Artificial Intelligence, and Operations Research
Serientitel
Lecture Notes in Computer Science
Band
10848
Seite(n)
512-520
ISBN
978-3-319-93030-5
eISBN
978-3-319-93031-2
ISSN
0302-9743
eISSN
1611-3349
Page URI
https://pub.uni-bielefeld.de/record/2958573

Zitieren

Römer M. A Local Search Framework for Compiling Relaxed Decision Diagrams. In: van Hoeve W-J, ed. Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Lecture Notes in Computer Science. Vol 10848. Cham: Springer International Publishing; 2018: 512-520.
Römer, M. (2018). A Local Search Framework for Compiling Relaxed Decision Diagrams. In W. - J. van Hoeve (Ed.), Lecture Notes in Computer Science: Vol. 10848. Integration of Constraint Programming, Artificial Intelligence, and Operations Research (pp. 512-520). Cham: Springer International Publishing. https://doi.org/10.1007/978-3-319-93031-2_36
Römer, M. (2018). “A Local Search Framework for Compiling Relaxed Decision Diagrams” in Integration of Constraint Programming, Artificial Intelligence, and Operations Research, van Hoeve, W. - J. ed. Lecture Notes in Computer Science, vol. 10848, (Cham: Springer International Publishing), 512-520.
Römer, M., 2018. A Local Search Framework for Compiling Relaxed Decision Diagrams. In W. - J. van Hoeve, ed. Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Lecture Notes in Computer Science. no.10848 Cham: Springer International Publishing, pp. 512-520.
M. Römer, “A Local Search Framework for Compiling Relaxed Decision Diagrams”, Integration of Constraint Programming, Artificial Intelligence, and Operations Research, W.-J. van Hoeve, ed., Lecture Notes in Computer Science, vol. 10848, Cham: Springer International Publishing, 2018, pp.512-520.
Römer, M.: A Local Search Framework for Compiling Relaxed Decision Diagrams. In: van Hoeve, W.-J. (ed.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Lecture Notes in Computer Science. 10848, p. 512-520. Springer International Publishing, Cham (2018).
Römer, Michael. “A Local Search Framework for Compiling Relaxed Decision Diagrams”. Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Ed. Willem-Jan van Hoeve. Cham: Springer International Publishing, 2018.Vol. 10848. Lecture Notes in Computer Science. 512-520.

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar
ISBN Suche