Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Matthias Miltenberger"'
Autor:
Gerald Gamrath, Ambros M. Gleixner, Matthias Miltenberger, Dominik Schlögel, Dieter Weninger, Dimitri Kniasew, Alex Martin, Thorsten Koch
Publikováno v:
Journal of Computational Mathematics. 37:866-888
SAP's decision support systems for optimized supply network planning rely on mixed-integer programming as the core engine to compute optimal or near-optimal solutions. The modeling flexibility and the optimality guarantees provided by mixed-integer p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5374ad0bbd5fb99c87c0d608df4fd83d
https://doi.org/10.4208/jcm.1905-m2019-0055
https://doi.org/10.4208/jcm.1905-m2019-0055
Publikováno v:
Operations Research Proceedings ISBN: 9783030184995
OR
OR
State-of-the-art solvers for mixed integer programs (MIP) govern a variety of algorithmic components. Ideally, the solver adaptively learns to concentrate its computational budget on those components that perform well on a particular problem, especia
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a8f6d1b6f43c6b134cb6c7a9b98559af
https://doi.org/10.1007/978-3-030-18500-8_64
https://doi.org/10.1007/978-3-030-18500-8_64
Publikováno v:
Operations Research Proceedings ISBN: 9783319899190
We investigate how the numerical properties of the LP relaxations evolve throughout the solution procedure in a solver employing the branch-and-cut algorithm. The long-term goal of this work is to determine whether the effect on the numerical conditi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87610e196285b2ae0981228304be2e64
https://doi.org/10.1007/978-3-319-89920-6
https://doi.org/10.1007/978-3-319-89920-6
Publikováno v:
Operations Research Proceedings ISBN: 9783319899190
OR
OR
We investigate how the numerical properties of the LP relaxations evolve throughout the solution procedure in a solver employing the branch-and-cut algorithm. The long-term goal of this work is to determine whether the effect on the numerical conditi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0854c7992f5e544b548537071fbb6dec
https://doi.org/10.1007/978-3-319-89920-6_21
https://doi.org/10.1007/978-3-319-89920-6_21
Publikováno v:
Mathematical Programming Computation. 7:367-398
This paper describes three presolving techniques for solving mixed integer programming problems (MIPs) that were implemented in the academic MIP solver SCIP. The task of presolving is to reduce the problem size and strengthen the formulation, mainly
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d344623ad9ca14d7c178170e7591c779
https://doi.org/10.1007/s12532-015-0083-5
https://doi.org/10.1007/s12532-015-0083-5
Autor:
Daniel Rehfeldt, Matthias Miltenberger, Felipe Serrano, Stephen J. Maher, João Pedro Pedroso, Robert Schwarz
Publikováno v:
Mathematical Software – ICMS 2016 ISBN: 9783319424316
ICMS
ICMS
SCIP is a solver for a wide variety of mathematical optimization problems. It is written in C and extendable due to its plug-in based design. However, dealing with all C specifics when extending SCIP can be detrimental to development and testing of n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::6386bda32eea22da8fc2b3797c9378b2
https://doi.org/10.1007/978-3-319-42432-3_37
https://doi.org/10.1007/978-3-319-42432-3_37