The coolest path problem

We introduce the coolest path problem, which is a mixture of two problems from distinct mathematical fields: The shortest path problem from combinatorial optimization and the heat conduction problem from the field of partial differential equations. Together, they make up a control problem, where some geometrical object traverses a digraph in an optimal way, with constraints on intermediate or the final state. We discuss some properties of the problem and demonstrate that it can be formulated and solved as a linear mixed-integer program.

Partners

  • TU Kaiserslautern
  • TU Darmstadt

Funding

  • Hausdorff Institute for Mathematics, Bonn, Germany

Related talks

  • The Coolest Path Problem, Seminar Nichtlineare Optimierung und Inverse Probleme, WIAS, Berlin, Germany, 2.11.2010.
  • The Coolest Path Problem, 23rd European Conference on Operational Research EURO 2009, Bonn, Germany, 8.7.2009.

Related publications

  • Martin Frank, Armin Fügenschuh, Michael Herty, Lars Schewe, MIP-PDE: Solving Discrete-Continuous Nonlinear Optimal Control Problems with Linear Mixed-Integer Programming Techniques , Hausdorff Research Institute for Mathematics, Bonn, 2011.
  • Martin Frank, Armin Fügenschuh, Michael Herty, Lars Schewe, The Coolest Path Problem , Networks and Heterogeneous Media, Vol. 5, No. 1, pp. 143 – 162, 2010.
  • Martin Frank, Armin Fügenschuh, Michael Herty, Lars Schewe, The Coolest Path Problem , ZIB Technical Report ZR-0937,2009.

This website uses cookies. There are two types of cookies: The first type supports the basic functionality of our website. The second allows us to improve our content for you by saving and analyzing pseudonymised user data. Since this second type is technically not required to run the website, you can withdraw your consent to those cookies at any time. For more information please visit our pages on data protection.

Mandatory

These cookies are needed for a smooth operation of our website.

Statistic

For statistical reasons, we use the platform Matomo to analyse the user flow with the help of website users‘ pseudonymised data. This allows us to optimize website content.

Name Purpose Lifetime Type Provider
_pk_id Used to store a few details about the user such as the unique visitor ID. 13 months HTML Matomo
_pk_ref Used to store the attribution information, the referrer initially used to visit the website. 6 months HTML Matomo
_pk_ses Short lived cookie used to temporarily store data for the visit. 30 minutes HTML Matomo