Zobrazeno 1 - 10
of 150
pro vyhledávání: '"Josef Kallrath"'
Autor:
Josef Kallrath
Publikováno v:
Galaxies, Vol 10, Iss 1, p 17 (2022)
The Wilson–Devinney model has—over the last 50 years—become the standard in analyzing eclipsing binary observations. To provide orientation for both active binary and non-binary researchers, it is presented here in historical and on-going as we
Externí odkaz:
https://doaj.org/article/09a7757c6bdd4e2e922ef7be553be5a5
Publikováno v:
Journal of Global Optimization. 85:39-59
Autor:
Steffen Klosterhalfen, Josef Kallrath, Robert Blackburn, Jan Buchmann, M. Frey, Felix Weidner, Anna Schreieck
Publikováno v:
European Journal of Operational Research. 279:605-619
Accurate and detailed cost information is crucial for decision makers when deciding about important long-term business aspects, such as capacity investments, the product range to offer or the markets to serve. The economic assessment of these options
Publikováno v:
Journal of Global Optimization.
The minimal convex hulls of disks problem is to find such arrangements of circular disks in the plane that minimize the length of the convex hull boundary. The mixed-integer non-linear programming model, named MinPerim [17], works only for small to m
Publikováno v:
International Journal of Production Research. 58:2677-2695
We propose a polylithic method for medium-term scheduling of a large-scale industrial plant operating in a continuous mode. The method combines a decomposition approach, a genetic algorithm (GA) an...
Autor:
Josef Kallrath, M. Frey
Publikováno v:
Journal of Global Optimization. 73:723-759
We present and solve a new computational geometry optimization problem in which a set of circles with given radii is to be arranged in unspecified area such that the length of the boundary, i.e., the perimeter, of the convex hull enclosing the non-ov
Autor:
Josef Kallrath, M. Frey
Publikováno v:
Vietnam Journal of Mathematics. 46:883-913
We present and solve a new computational geometry optimization problem. Spheres with given radii should be arranged such that (a) they do not overlap and (b) the surface area of the boundary of the convex hull enclosing the spheres is minimized. An a
Autor:
Josef Kallrath
Publikováno v:
International Series in Operations Research & Management Science ISBN: 9783030732363
Global optimization techniques, cf. Horst & Pardalos (1995), Floudas (2000), Floudas & Gounaris (2009), or Misener & Floudas (2012), are suitable for solving non-convex NLP or MINLP problems. When in this book we refer to global optimization, we mean
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5fa08192c0d42eacf39cb7b4f8c35a7f
https://doi.org/10.1007/978-3-030-73237-0_13
https://doi.org/10.1007/978-3-030-73237-0_13
Autor:
Josef Kallrath
Publikováno v:
International Series in Operations Research & Management Science ISBN: 9783030732363
This chapter guides the reader into the field of mathematical optimization, distinguishes optimization from simulation, and introduces the key objects used in optimization models. It sketches how simple linear programming (LP) problems may be solved
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ed81a826a492a1d0e7bd5b27207974ae
https://doi.org/10.1007/978-3-030-73237-0_1
https://doi.org/10.1007/978-3-030-73237-0_1
Autor:
Josef Kallrath
Publikováno v:
International Series in Operations Research & Management Science ISBN: 9783030732363
This chapter provides some of the mathematical and algorithmic backgrounds to solving LP and MILP problems.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dc02b7aca7b3d7bc9cfe2bb8123748c1
https://doi.org/10.1007/978-3-030-73237-0_3
https://doi.org/10.1007/978-3-030-73237-0_3