|
|
|
|
| LEADER |
02829cam a2200565 4500 |
| 001 |
0-668508841 |
| 003 |
DE-627 |
| 005 |
20220710135450.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
110919s2009 gw |||||o 00| ||eng c |
| 035 |
|
|
|a (DE-627)668508841
|
| 035 |
|
|
|a (DE-576)966850884X
|
| 035 |
|
|
|a (DE-599)GBV668508841
|
| 035 |
|
|
|a (OCoLC)838728068
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 044 |
|
|
|c XA-DE
|
| 084 |
|
|
|a 65K05
|2 MSC
|
| 084 |
|
|
|a 90C30
|2 MSC
|
| 084 |
|
|
|a 90C09
|2 MSC
|
| 084 |
|
|
|a 90C10
|2 MSC
|
| 084 |
|
|
|a 31.80
|2 bkl
|
| 100 |
1 |
|
|a Berthold, Timo
|4 aut
|
| 245 |
1 |
0 |
|a Nonlinear pseudo-Boolean optimization
|b relaxation or propagation?
|c Timo Berthold; Stefan Heinz; Marc E. Pfetsch
|
| 264 |
|
1 |
|a Berlin-Dahlem
|b Konrad-Zuse-Zentrum für Informationstechnik
|c 2009
|
| 300 |
|
|
|a Online-Ressource (8 S., 412 KB)
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a Computermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a Online-Ressource
|b cr
|2 rdacarrier
|
| 490 |
1 |
|
|a ZIB-Report / Konrad-Zuse-Zentrum für Informationstechnik Berlin
|v 2009,11
|
| 520 |
|
|
|a Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, and integer programming. In particular, nonlinear constraints in pseudo-Boolean optimization can be handled by methods arising in these different fields: One can either linearize them and work on a linear programming relaxation or one can treat them directly by propagation. In this paper, we investigate the individual strengths of these approaches and compare their computational performance. Furthermore, we integrate these techniques into a branch-and-cut-and-propagate framework, resulting in an efficient nonlinear pseudo-Boolean solver.
|
| 538 |
|
|
|a Systemvoraussetzungen: Acrobat reader.
|
| 583 |
1 |
|
|a Archivierung/Langzeitarchivierung gewährleistet
|2 pdager
|5 DE-89
|
| 700 |
1 |
|
|a Heinz, Stefan
|4 aut
|
| 700 |
1 |
|
|a Pfetsch, Marc E.
|4 aut
|
| 810 |
2 |
|
|a Konrad-Zuse-Zentrum für Informationstechnik Berlin
|t ZIB-Report
|v 2009,11
|9 2009,11
|w (DE-627)478815719
|w (DE-576)433876018
|w (DE-600)2176854-7
|x 2192-7782
|
| 856 |
4 |
0 |
|u https://edocs.tib.eu/files/e01fn11/668508841.pdf
|q application/pdf
|x Verlag
|z kostenfrei
|3 Volltext
|
| 856 |
4 |
0 |
|u http://webdoc.sub.gwdg.de/ebook/serien/ah/ZIB/ZR_09_11.pdf
|q application/pdf
|x Verlag
|z kostenfrei
|3 Volltext
|
| 856 |
4 |
2 |
|u https://edocs.tib.eu/files/e01fn11/668508841l.pdf
|q application/pdf
|x Verlag
|y Leseprobe
|z kostenfrei
|
| 912 |
|
|
|a ZDB-296-TTN
|
| 936 |
b |
k |
|a 31.80
|j Angewandte Mathematik
|0 (DE-627)106419005
|
| 951 |
|
|
|a BO
|
| 856 |
4 |
0 |
|u http://webdoc.sub.gwdg.de/ebook/serien/ah/ZIB/ZR_09_11.pdf
|9 LFER
|
| 852 |
|
|
|a LFER
|z 2019-07-15T00:00:00Z
|
| 970 |
|
|
|c OD
|
| 971 |
|
|
|c EBOOK
|
| 972 |
|
|
|c EBOOK
|
| 973 |
|
|
|c EB
|
| 935 |
|
|
|a lfer
|
| 980 |
|
|
|a 668508841
|b 0
|k 668508841
|o 966850884X
|c lfer
|
SOLR
| _version_ |
1757988581334319104 |
| access_facet |
Electronic Resources |
| author |
Berthold, Timo, Heinz, Stefan, Pfetsch, Marc E. |
| author_facet |
Berthold, Timo, Heinz, Stefan, Pfetsch, Marc E. |
| author_role |
aut, aut, aut |
| author_sort |
Berthold, Timo |
| author_variant |
t b tb, s h sh, m e p me mep |
| callnumber-sort |
|
| collection |
ZDB-296-TTN, lfer |
| contents |
Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, and integer programming. In particular, nonlinear constraints in pseudo-Boolean optimization can be handled by methods arising in these different fields: One can either linearize them and work on a linear programming relaxation or one can treat them directly by propagation. In this paper, we investigate the individual strengths of these approaches and compare their computational performance. Furthermore, we integrate these techniques into a branch-and-cut-and-propagate framework, resulting in an efficient nonlinear pseudo-Boolean solver. |
| ctrlnum |
(DE-627)668508841, (DE-576)966850884X, (DE-599)GBV668508841, (OCoLC)838728068 |
| facet_912a |
ZDB-296-TTN |
| facet_avail |
Online, Free |
| finc_class_facet |
not assigned |
| fincclass_txtF_mv |
science-mathematics |
| format |
eBook |
| format_access_txtF_mv |
Book, E-Book |
| format_de105 |
Ebook |
| format_de14 |
Book, E-Book |
| format_de15 |
Book, E-Book |
| format_del152 |
Buch |
| format_detail_txtF_mv |
text-online-monograph-independent |
| format_dezi4 |
e-Book |
| format_finc |
Book, E-Book |
| format_legacy |
ElectronicBook |
| format_legacy_nrw |
Book, E-Book |
| format_nrw |
Book, E-Book |
| format_strict_txtF_mv |
E-Book |
| geogr_code |
not assigned |
| geogr_code_person |
not assigned |
| hierarchy_parent_id |
0-478815719 |
| hierarchy_parent_title |
Konrad-Zuse-Zentrum für Informationstechnik Berlin: ZIB-Report |
| hierarchy_sequence |
2009,11 |
| hierarchy_top_id |
0-478815719 |
| hierarchy_top_title |
Konrad-Zuse-Zentrum für Informationstechnik Berlin: ZIB-Report |
| id |
0-668508841 |
| illustrated |
Not Illustrated |
| imprint |
Berlin-Dahlem, Konrad-Zuse-Zentrum für Informationstechnik, 2009 |
| imprint_str_mv |
Berlin-Dahlem: Konrad-Zuse-Zentrum für Informationstechnik, 2009 |
| institution |
DE-D117, DE-105, LFER, DE-Ch1, DE-15, DE-14, DE-Zwi2 |
| is_hierarchy_id |
0-668508841 |
| is_hierarchy_title |
Nonlinear pseudo-Boolean optimization: relaxation or propagation? |
| isil_str_mv |
LFER |
| issn_isn_mv |
2192-7782 |
| kxp_id_str |
668508841 |
| language |
English |
| last_indexed |
2023-02-16T11:55:56.32Z |
| match_str |
berthold2009nonlinearpseudobooleanoptimizationrelaxationorpropagation |
| mega_collection |
Verbunddaten SWB, Lizenzfreie Online-Ressourcen |
| misc_de105 |
EBOOK |
| multipart_link |
433876018 |
| multipart_part |
(433876018)2009,11 |
| oclc_num |
838728068 |
| physical |
Online-Ressource (8 S., 412 KB) |
| publishDate |
2009 |
| publishDateSort |
2009 |
| publishPlace |
Berlin-Dahlem |
| publisher |
Konrad-Zuse-Zentrum für Informationstechnik |
| record_format |
marcfinc |
| record_id |
966850884X |
| recordtype |
marcfinc |
| rvk_facet |
No subject assigned |
| series |
Konrad-Zuse-Zentrum für Informationstechnik Berlin, ZIB-Report, 2009,11 |
| series2 |
ZIB-Report / Konrad-Zuse-Zentrum für Informationstechnik Berlin ; 2009,11 |
| source_id |
0 |
| spelling |
Berthold, Timo aut, Nonlinear pseudo-Boolean optimization relaxation or propagation? Timo Berthold; Stefan Heinz; Marc E. Pfetsch, Berlin-Dahlem Konrad-Zuse-Zentrum für Informationstechnik 2009, Online-Ressource (8 S., 412 KB), Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, ZIB-Report / Konrad-Zuse-Zentrum für Informationstechnik Berlin 2009,11, Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, and integer programming. In particular, nonlinear constraints in pseudo-Boolean optimization can be handled by methods arising in these different fields: One can either linearize them and work on a linear programming relaxation or one can treat them directly by propagation. In this paper, we investigate the individual strengths of these approaches and compare their computational performance. Furthermore, we integrate these techniques into a branch-and-cut-and-propagate framework, resulting in an efficient nonlinear pseudo-Boolean solver., Systemvoraussetzungen: Acrobat reader., Archivierung/Langzeitarchivierung gewährleistet pdager DE-89, Heinz, Stefan aut, Pfetsch, Marc E. aut, Konrad-Zuse-Zentrum für Informationstechnik Berlin ZIB-Report 2009,11 2009,11 (DE-627)478815719 (DE-576)433876018 (DE-600)2176854-7 2192-7782, https://edocs.tib.eu/files/e01fn11/668508841.pdf application/pdf Verlag kostenfrei Volltext, http://webdoc.sub.gwdg.de/ebook/serien/ah/ZIB/ZR_09_11.pdf application/pdf Verlag kostenfrei Volltext, https://edocs.tib.eu/files/e01fn11/668508841l.pdf application/pdf Verlag Leseprobe kostenfrei, http://webdoc.sub.gwdg.de/ebook/serien/ah/ZIB/ZR_09_11.pdf LFER, LFER 2019-07-15T00:00:00Z |
| spellingShingle |
Berthold, Timo, Heinz, Stefan, Pfetsch, Marc E., Nonlinear pseudo-Boolean optimization: relaxation or propagation?, Konrad-Zuse-Zentrum für Informationstechnik Berlin, ZIB-Report, 2009,11, Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, and integer programming. In particular, nonlinear constraints in pseudo-Boolean optimization can be handled by methods arising in these different fields: One can either linearize them and work on a linear programming relaxation or one can treat them directly by propagation. In this paper, we investigate the individual strengths of these approaches and compare their computational performance. Furthermore, we integrate these techniques into a branch-and-cut-and-propagate framework, resulting in an efficient nonlinear pseudo-Boolean solver. |
| swb_id_str |
966850884X |
| title |
Nonlinear pseudo-Boolean optimization: relaxation or propagation? |
| title_auth |
Nonlinear pseudo-Boolean optimization relaxation or propagation? |
| title_full |
Nonlinear pseudo-Boolean optimization relaxation or propagation? Timo Berthold; Stefan Heinz; Marc E. Pfetsch |
| title_fullStr |
Nonlinear pseudo-Boolean optimization relaxation or propagation? Timo Berthold; Stefan Heinz; Marc E. Pfetsch |
| title_full_unstemmed |
Nonlinear pseudo-Boolean optimization relaxation or propagation? Timo Berthold; Stefan Heinz; Marc E. Pfetsch |
| title_in_hierarchy |
2009,11. Nonlinear pseudo-Boolean optimization: relaxation or propagation? (2009) |
| title_short |
Nonlinear pseudo-Boolean optimization |
| title_sort |
nonlinear pseudo boolean optimization relaxation or propagation |
| title_sub |
relaxation or propagation? |
| url |
https://edocs.tib.eu/files/e01fn11/668508841.pdf, http://webdoc.sub.gwdg.de/ebook/serien/ah/ZIB/ZR_09_11.pdf, https://edocs.tib.eu/files/e01fn11/668508841l.pdf |
