Loading...
Please wait, while we are loading the content...
Similar Documents
A discrete global minimization algorithm for continuous variational problems (2004).
| Content Provider | CiteSeerX |
|---|---|
| Author | Kirsanov, Danil Gortler, Steven |
| Abstract | In this paper, we apply the ideas from combinatorial optimization to find globally optimal solutions to continuous variational problems. At the heart of our method is an algorithm to solve for globally optimal discrete minimal surfaces. This discrete surface problem is a natural generalization of the planar-graph shortest path problem. |
| File Format | |
| Publisher Date | 2004-01-01 |
| Access Restriction | Open |
| Subject Keyword | Combinatorial Optimization Natural Generalization Discrete Global Minimization Algorithm Optimal Solution Optimal Discrete Minimal Surface Continuous Variational Problem Discrete Surface Problem Planar-graph Shortest Path Problem |
| Content Type | Text |