Global optimization: On pathlengths in min-max graphs
This research paper is devoted to path lengths in Min-Max graphs for some kinds of global optimization problems, starting from pertinent previous results of the authors and being based on the following main result: For every smooth, compact and connected \(n\)-manifold \(X\) without boundary, \(x,y\in X\) arbitrary different points and \(k\in N^*\), there exists a smooth nondegenerate real function \(f\) defined on \(X\) such that \(x,y\) are local minima of \(f\), the corresponding graph to the Riemannian metric is connected and the length of the shortest path in this graph between \(x\) end \(y\) exceeds \(k\).
- scientific article; zbMATH DE number 3920238
- On the minimax path in a network
- Solving min-max shortest-path problems on a network
- The complexity of the computation of a global minimum in certain classes of optimization problems
- Graph path minimization problem
- scientific article; zbMATH DE number 1138299
- Optimal shortest path set problem in undirected graphs
- On fixed-parameter solvability of the minimax path location problem
- On the complexity of minimum-link path problems
- scientific article; zbMATH DE number 6707504
This page was built for publication: Global optimization: On pathlengths in min-max graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5928206)
