The coolest path problem

DOI10.3934/NHM.2010.5.143MaRDI QIDQ1943808zbMATH OpenOpenAlexFDO

Authors Martin Frank, Armin Fügenschuh, Lars Schewe, Michael Herty

Publication date 21 March 2013

Published in Networks and Heterogeneous Media (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3934/nhm.2010.5.143

zbMATH Keywords

integer programmingshortest path

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Integer programming (90C10) Heat equation (35K05) PDEs in connection with control and optimization (35Q93) Theoretical approximation in context of PDEs (35A35)

Recommendations

• An applicable method for solving the shortest path problems
• Complexity analysis and optimization of the shortest path tour problem
• Continuous-Time Shortest Path Problems and Linear Programming
• scientific article; zbMATH DE number 1783111
• Continuous-time shortest path problems with stopping and starting costs

Cited in

(2)

• Mixed integer PDE constrained optimization for the control of a wildfire hazard
• A solution framework for linear PDE-constrained mixed-integer problems

This page was built for publication: The coolest path problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1943808)