Eintrag weiter verarbeiten

Experiments with nonlinear extensions to SCIP

Gespeichert in:

Personen und Körperschaften: Bley, Andreas (Sonstige), Koch, Thorsten (Sonstige), Niu, Lingfeng (Sonstige)
Titel: Experiments with nonlinear extensions to SCIP/ Andreas Bley; Thorsten Koch; Lingfeng Niu
Format: E-Book
Sprache: Englisch
veröffentlicht:
Berlin-Dahlem Konrad-Zuse-Zentrum für Informationstechnik 2009
Gesamtaufnahme: Konrad-Zuse-Zentrum für Informationstechnik Berlin: ZIB-Report ; 2008,28
Schlagwörter:
Quelle: Verbunddaten SWB
Lizenzfreie Online-Ressourcen
LEADER 03738cam a2200577 4500
001 0-607882492
003 DE-627
005 20220706122405.0
007 cr uuu---uuuuu
008 090831s2009 gw |||||ot 00| ||eng c
035 |a (DE-627)607882492 
035 |a (DE-576)9607882490 
035 |a (DE-599)GBV607882492 
035 |a (OCoLC)837187740 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
044 |c XA-DE 
082 0 |a 510  |q OCLC 
082 0 4 |a 510 
084 |a 31.80  |2 bkl 
245 1 0 |a Experiments with nonlinear extensions to SCIP  |c Andreas Bley; Thorsten Koch; Lingfeng Niu 
264 1 |a Berlin-Dahlem  |b Konrad-Zuse-Zentrum für Informationstechnik  |c 2009 
300 |a Online-Ressource (31 S., 229 KB)  |b graph. Darst. 
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 2008,28 
500 |a Unterschiede zwischen dem gedruckten Dokument und der elektronischen Ressource können nicht ausgeschlossen werden. - Auch als gedr. Ausg. vorhanden 
520 |a This paper describes several experiments to explore the options for solving a class of mixed integer nonlinear programming problems that stem from a real-world mine production planning project. The only type of nonlinear constraints in these problems are bilinear equalities involving continuous variables, which enforce the ratios between elements in mixed material streams. A branch-and-bound algorithm to handle the integer variables has been tried in another project. However, this branch-and-bound algorithm is not effective for handling the nonlinear constraints. Therefore state-of-the-art nonlinear solvers are utilized to solve the resulting nonlinear subproblems in this work. The experiments were carried out using the NEOS server for optimization. After finding that current nonlinear programming solvers seem to lack suitable preprocessing capabilities, we preprocess the instances beforehand and use an heuristic approach to solve the nonlinear subproblems. In the appendix, we explain how to add a polynomial constraint handler that uses IPOPT as embedded nonlinear programming solver for the constraint programming framework SCIP. This is one of the crucial steps for implementing our algorithm in SCIP. We briefly described our approach and give an idea of the work involved. 
538 |a Systemvoraussetzungen: Acrobat reader. 
583 1 |a Archivierung/Langzeitarchivierung gewährleistet  |2 pdager  |5 DE-89 
655 7 |a Forschungsbericht  |0 (DE-588)4155043-2  |0 (DE-627)10467444X  |0 (DE-576)209815833  |2 gnd-content 
700 1 |a Bley, Andreas  |4 oth 
700 1 |a Koch, Thorsten  |4 oth 
700 1 |a Niu, Lingfeng  |4 oth 
810 2 |a Konrad-Zuse-Zentrum für Informationstechnik Berlin  |t ZIB-Report  |v 2008,28  |9 2008,28  |w (DE-627)478815719  |w (DE-576)433876018  |w (DE-600)2176854-7  |x 2192-7782 
856 4 0 |u http://webdoc.sub.gwdg.de/ebook/serien/ah/ZIB/ZR-08-28.pdf  |q application/pdf  |x Verlag  |z kostenfrei  |3 Volltext 
856 4 0 |u https://edocs.tib.eu/files/e01fn09/607882492.pdf  |q application/pdf  |x Verlag  |z kostenfrei  |3 Volltext 
856 4 2 |u https://edocs.tib.eu/files/e01fn09/607882492l.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 
852 |d DE-Zi4  |x epn:4127056002 del:202308180132 
856 4 0 |u https://edocs.tib.eu/files/e01fn09/607882492.pdf  |9 LFER 
970 |c OD 
971 |c EBOOK 
972 |c EBOOK 
973 |c EB 
935 |a lfer 
852 |a LFER  |x epn:3472085878  |z 2019-05-07T00:00:00Z 
980 |a 607882492  |b 0  |k 607882492  |o 9607882490  |c lfer 
openURL url_ver=Z39.88-2004&ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fvufind.svn.sourceforge.net%3Agenerator&rft.title=Experiments+with+nonlinear+extensions+to+SCIP&rft.date=2009&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rft.creator=&rft.pub=Konrad-Zuse-Zentrum+f%C3%BCr+Informationstechnik&rft.format=eBook&rft.language=English
SOLR
_version_ 1795509201684922368
author2 Bley, Andreas, Koch, Thorsten, Niu, Lingfeng
author2_role oth, oth, oth
author2_variant a b ab, t k tk, l n ln
author_facet Bley, Andreas, Koch, Thorsten, Niu, Lingfeng
collection ZDB-296-TTN, lfer
contents This paper describes several experiments to explore the options for solving a class of mixed integer nonlinear programming problems that stem from a real-world mine production planning project. The only type of nonlinear constraints in these problems are bilinear equalities involving continuous variables, which enforce the ratios between elements in mixed material streams. A branch-and-bound algorithm to handle the integer variables has been tried in another project. However, this branch-and-bound algorithm is not effective for handling the nonlinear constraints. Therefore state-of-the-art nonlinear solvers are utilized to solve the resulting nonlinear subproblems in this work. The experiments were carried out using the NEOS server for optimization. After finding that current nonlinear programming solvers seem to lack suitable preprocessing capabilities, we preprocess the instances beforehand and use an heuristic approach to solve the nonlinear subproblems. In the appendix, we explain how to add a polynomial constraint handler that uses IPOPT as embedded nonlinear programming solver for the constraint programming framework SCIP. This is one of the crucial steps for implementing our algorithm in SCIP. We briefly described our approach and give an idea of the work involved.
ctrlnum (DE-627)607882492, (DE-576)9607882490, (DE-599)GBV607882492, (OCoLC)837187740
dewey-full 510
dewey-hundreds 500 - Natural sciences and mathematics
dewey-ones 510 - Mathematics
dewey-raw 510
dewey-search 510
dewey-sort 3510
dewey-tens 510 - Mathematics
facet_912a ZDB-296-TTN
facet_avail Online, Free
finc_class_facet Mathematik
fincclass_txtF_mv science-mathematics
footnote Unterschiede zwischen dem gedruckten Dokument und der elektronischen Ressource können nicht ausgeschlossen werden. - Auch als gedr. Ausg. vorhanden
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
genre Forschungsbericht (DE-588)4155043-2 (DE-627)10467444X (DE-576)209815833 gnd-content
genre_facet Forschungsbericht
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 2008,28
hierarchy_top_id 0-478815719
hierarchy_top_title Konrad-Zuse-Zentrum für Informationstechnik Berlin: ZIB-Report
id 0-607882492
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-607882492
is_hierarchy_title Experiments with nonlinear extensions to SCIP
issn_isn_mv 2192-7782
kxp_id_str 607882492
language English
last_indexed 2024-04-05T15:30:06.892Z
marc_error [geogr_code]Unable to make public java.lang.AbstractStringBuilder java.lang.AbstractStringBuilder.append(java.lang.String) accessible: module java.base does not "opens java.lang" to unnamed module @7838f2f1
match_str bley2009experimentswithnonlinearextensionstoscip
mega_collection Verbunddaten SWB, Lizenzfreie Online-Ressourcen
misc_de105 EBOOK
multipart_link 433876018
multipart_part (433876018)2008,28
oclc_num 837187740
physical Online-Ressource (31 S., 229 KB); graph. Darst
publishDate 2009
publishDateSort 2009
publishPlace Berlin-Dahlem
publisher Konrad-Zuse-Zentrum für Informationstechnik
record_format marcfinc
record_id 9607882490
recordtype marcfinc
rvk_facet No subject assigned
series Konrad-Zuse-Zentrum für Informationstechnik Berlin, ZIB-Report, 2008,28
series2 ZIB-Report / Konrad-Zuse-Zentrum für Informationstechnik Berlin ; 2008,28
source_id 0
spelling Experiments with nonlinear extensions to SCIP Andreas Bley; Thorsten Koch; Lingfeng Niu, Berlin-Dahlem Konrad-Zuse-Zentrum für Informationstechnik 2009, Online-Ressource (31 S., 229 KB) graph. Darst., Text txt rdacontent, Computermedien c rdamedia, Online-Ressource cr rdacarrier, ZIB-Report / Konrad-Zuse-Zentrum für Informationstechnik Berlin 2008,28, Unterschiede zwischen dem gedruckten Dokument und der elektronischen Ressource können nicht ausgeschlossen werden. - Auch als gedr. Ausg. vorhanden, This paper describes several experiments to explore the options for solving a class of mixed integer nonlinear programming problems that stem from a real-world mine production planning project. The only type of nonlinear constraints in these problems are bilinear equalities involving continuous variables, which enforce the ratios between elements in mixed material streams. A branch-and-bound algorithm to handle the integer variables has been tried in another project. However, this branch-and-bound algorithm is not effective for handling the nonlinear constraints. Therefore state-of-the-art nonlinear solvers are utilized to solve the resulting nonlinear subproblems in this work. The experiments were carried out using the NEOS server for optimization. After finding that current nonlinear programming solvers seem to lack suitable preprocessing capabilities, we preprocess the instances beforehand and use an heuristic approach to solve the nonlinear subproblems. In the appendix, we explain how to add a polynomial constraint handler that uses IPOPT as embedded nonlinear programming solver for the constraint programming framework SCIP. This is one of the crucial steps for implementing our algorithm in SCIP. We briefly described our approach and give an idea of the work involved., Systemvoraussetzungen: Acrobat reader., Archivierung/Langzeitarchivierung gewährleistet pdager DE-89, Forschungsbericht (DE-588)4155043-2 (DE-627)10467444X (DE-576)209815833 gnd-content, Bley, Andreas oth, Koch, Thorsten oth, Niu, Lingfeng oth, Konrad-Zuse-Zentrum für Informationstechnik Berlin ZIB-Report 2008,28 2008,28 (DE-627)478815719 (DE-576)433876018 (DE-600)2176854-7 2192-7782, http://webdoc.sub.gwdg.de/ebook/serien/ah/ZIB/ZR-08-28.pdf application/pdf Verlag kostenfrei Volltext, https://edocs.tib.eu/files/e01fn09/607882492.pdf application/pdf Verlag kostenfrei Volltext, https://edocs.tib.eu/files/e01fn09/607882492l.pdf application/pdf Verlag Leseprobe kostenfrei, DE-Zi4 epn:4127056002 del:202308180132, https://edocs.tib.eu/files/e01fn09/607882492.pdf LFER, LFER epn:3472085878 2019-05-07T00:00:00Z
spellingShingle Experiments with nonlinear extensions to SCIP, Konrad-Zuse-Zentrum für Informationstechnik Berlin, ZIB-Report, 2008,28, This paper describes several experiments to explore the options for solving a class of mixed integer nonlinear programming problems that stem from a real-world mine production planning project. The only type of nonlinear constraints in these problems are bilinear equalities involving continuous variables, which enforce the ratios between elements in mixed material streams. A branch-and-bound algorithm to handle the integer variables has been tried in another project. However, this branch-and-bound algorithm is not effective for handling the nonlinear constraints. Therefore state-of-the-art nonlinear solvers are utilized to solve the resulting nonlinear subproblems in this work. The experiments were carried out using the NEOS server for optimization. After finding that current nonlinear programming solvers seem to lack suitable preprocessing capabilities, we preprocess the instances beforehand and use an heuristic approach to solve the nonlinear subproblems. In the appendix, we explain how to add a polynomial constraint handler that uses IPOPT as embedded nonlinear programming solver for the constraint programming framework SCIP. This is one of the crucial steps for implementing our algorithm in SCIP. We briefly described our approach and give an idea of the work involved., Forschungsbericht
swb_id_str 9607882490
title Experiments with nonlinear extensions to SCIP
title_auth Experiments with nonlinear extensions to SCIP
title_full Experiments with nonlinear extensions to SCIP Andreas Bley; Thorsten Koch; Lingfeng Niu
title_fullStr Experiments with nonlinear extensions to SCIP Andreas Bley; Thorsten Koch; Lingfeng Niu
title_full_unstemmed Experiments with nonlinear extensions to SCIP Andreas Bley; Thorsten Koch; Lingfeng Niu
title_in_hierarchy 2008,28. Experiments with nonlinear extensions to SCIP (2009)
title_short Experiments with nonlinear extensions to SCIP
title_sort experiments with nonlinear extensions to scip
title_unstemmed Experiments with nonlinear extensions to SCIP
topic Forschungsbericht
topic_facet Forschungsbericht
url http://webdoc.sub.gwdg.de/ebook/serien/ah/ZIB/ZR-08-28.pdf, https://edocs.tib.eu/files/e01fn09/607882492.pdf, https://edocs.tib.eu/files/e01fn09/607882492l.pdf
work_keys_str_mv AT bleyandreas experimentswithnonlinearextensionstoscip, AT kochthorsten experimentswithnonlinearextensionstoscip, AT niulingfeng experimentswithnonlinearextensionstoscip