Bibliothek

X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • ZIB Katalog  (2)
  • Opus-Repositorium ZIB  (5)
  • Englisch  (7)
Datenquelle
  • ZIB Katalog  (2)
  • Opus-Repositorium ZIB  (5)
Materialart
Erscheinungszeitraum
Person/Organisation
Sprache
  • Englisch  (7)
  • 1
    Buch
    Buch
    ¬The¬ traveling salesman problem / (2006)
    Princeton [u.a.] :Princeton Univ. Press,
    Details
    Titel: ¬The¬ traveling salesman problem /
    Beteiligte Person(en): Applegate, David L. , Bixby, Robert E. , Chvatal, Vasek , Cook, William J.
    Verlag: Princeton [u.a.] :Princeton Univ. Press,
    Erscheinungsjahr: 2006
    Seiten: IX, 593 S. : , Ill., graph. Darst.
    Serie: Princeton series in applied mathematics
    ISBN: 0-691-12993-2 , 978-0-691-12993-8
    Materialart: Buch
    Sprache: Englisch
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    ZIB Katalog
    Zuse-Institut Berlin get availability status
  • 2
    Buch
    Buch
    Research trends in combinatorial optimization / (2009)
    Berlin ; Heidelberg :Springer,
    Details
    Titel: Research trends in combinatorial optimization /
    Beteiligte Person(en): Cook, William J.
    Verlag: Berlin ; Heidelberg :Springer,
    Erscheinungsjahr: 2009
    Seiten: XVIII, 562 S. : , Ill., graph. Darst.
    ISBN: 978-3-540-76795-4
    Materialart: Buch
    Sprache: Englisch
    URL: Inhaltsverzeichnis
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    ZIB Katalog
    Zuse-Institut Berlin get availability status
  • 3
    facet.materialart.
    Unbekannt
    A Hybrid Branch-and-Bound Approach for Exact Rational Mixed-Integer Programming (2012)
    Details
    Publikationsdatum: 2021-02-01
    Beschreibung: We present an exact rational solver for mixed-integer linear programming that avoids the numerical inaccuracies inherent in the floating-point computations used by existing software. This allows the solver to be used for establishing theoretical results and in applications where correct solutions are critical due to legal and financial consequences. Our solver is a hybrid symbolic/numeric implementation of LP-based branch-and-bound, using numerically-safe methods for all binding computations in the search tree. Computing provably accurate solutions by dynamically choosing the fastest of several safe dual bounding methods depending on the structure of the instance, our exact solver is only moderately slower than an inexact floating-point branch-and-bound solver. The software is incorporated into the SCIP optimization framework, using the exact LP solver QSopt_ex and the GMP arithmetic library. Computational results are presented for a suite of test instances taken from the MIPLIB and Mittelmann libraries and for a new collection of numerically difficult instances.
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    OPUS
  • 4
    facet.materialart.
    Unbekannt
    An Exact Rational Mixed-Integer Programming Solver (2011)
    Details
    Publikationsdatum: 2021-02-01
    Sprache: Englisch
    Materialart: conferenceobject , doc-type:conferenceObject
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    OPUS
  • 5
    facet.materialart.
    Unbekannt
    Mathematical Programming Computation: A New MPS Journal (2008)
    Details
    Publikationsdatum: 2020-02-11
    Sprache: Englisch
    Materialart: article , doc-type:article
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    OPUS
  • 6
    facet.materialart.
    Unbekannt
    An Exact Rational Mixed-Integer Programming Solver (2011)
    Details
    Publikationsdatum: 2021-02-01
    Beschreibung: We present an exact rational solver for mixed-integer linear programming that avoids the numerical inaccuracies inherent in the floating-point computations used by existing software. This allows the solver to be used for establishing theoretical results and in applications where correct solutions are critical due to legal and financial consequences. Our solver is a hybrid symbolic/numeric implementation of LP-based branch-and-bound, using numerically-safe methods for all binding computations in the search tree. Computing provably accurate solutions by dynamically choosing the fastest of several safe dual bounding methods depending on the structure of the instance, our exact solver is only moderately slower than an inexact floating-point branch-and-bound solver. The software is incorporated into the SCIP optimization framework, using the exact LP solver QSopt_ex and the GMP arithmetic library. Computational results are presented for a suite of test instances taken from the MIPLIB and Mittelmann collections.
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    OPUS
  • 7
    facet.materialart.
    Unbekannt
    A hybrid branch-and-bound approach for exact rational mixed-integer programming (2013)
    Details
    Publikationsdatum: 2021-02-01
    Beschreibung: We present an exact rational solver for mixed-integer linear programming that avoids the numerical inaccuracies inherent in the floating-point computations used by existing software. This allows the solver to be used for establishing theoretical results and in applications where correct solutions are critical due to legal and financial consequences. Our solver is a hybrid symbolic/numeric implementation of LP-based branch-and-bound, using numerically-safe methods for all binding computations in the search tree. Computing provably accurate solutions by dynamically choosing the fastest of several safe dual bounding methods depending on the structure of the instance, our exact solver is only moderately slower than an inexact floating-point branch-and-bound solver. The software is incorporated into the SCIP optimization framework, using the exact LP solver QSopt_ex and the GMP arithmetic library. Computational results are presented for a suite of test instances taken from the MIPLIB and Mittelmann libraries and for a new collection of numerically difficult instances.
    Sprache: Englisch
    Materialart: article , doc-type:article
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    OPUS
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...