Membros > Colaboradores

Phan Thanh An

Morada Institucional

Instituto Superior Técnico (IST)
Av. Rovisco Pais 1
1049-001 LISBOA

Telefone: | Email:


Investigador, Instituto Superior Técnico, Universidade de Lisboa


Análise Numérica e Aplicações

Área Principal

Computational Geometry, Optimization


  •  PhD


Artigos em Revistas Internacionais

Hoai, T.V. ; An, P. T. ; Hai, N.N.  (2017) Multiple shooting approach for computing approximately shortest paths on convex polytopes. Journal of Computational and Applied Mathematics: 317, 235-246.
Trang, L. H.; Kozma, A. ; An, P. T. ; Diehl, M. (2016) A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints. Optimization Methods and Software: 31, 187-203.
An, P. T. ; Giang, D. T.; Trang, L. H. (2015) An exact algorithm for minimizing a sum of Euclidean norms on rays in 2D and 3D. Numerical Functional Analysis and Optimization: 36(4), 405-418.
An, P. T. ; Hai, N. N.; Hoai, T. V. (2014) The role of graph for solving some geometric shortest path problems in 2D and 3D. Lecture Notes in Electrical Engineering: 279, 179-184.
An, P. T. ; Hai, N. N.; Hoai, T. V. (2013) Direct Multiple Shooting Method for Solving Approximate Shortest Path Problems. Journal of Computational and Applied Mathematics: 244, 67-76.
Nguyen Ngoc Hai; An, P. T.  (2013) A Generalization of Blaschke's Convergence Theorem in Metric Spaces. Journal of Convex Analysis: 20(4), 1013-1024.
An, P. T. ; Trang, L. H. (2013) An Efficient Convex Hull Algorithm for Finite Point Sets in 3D Based on the Method of Orienting Curves. Optimization: A Journal of Mathematical Programming and Operations Research: 62(7), 975-988.
An, P. T. ; Hoai, T.V. (2012) Incremental convex hull as an orientation to solving the shortest path problem. International Journal of Information and Electronics Engineering: 2(5), 652-655.
An, P. T. ; Trang, L. H. (2012) A Parallel Algorithm Based on Convexity for the Computing of Delaunay Tessellation. Numerical Algorithms: 59(3), 347-357.
Hai, N. N.; An, P. T.  (2011) Blaschke-Type Theorem and Separation of Disjoint Closed Geodesic Convex Sets. Journal of Optimization Theory and Applications: 151(3), 541-551.
Phu, H.X.; Pho, V.M.; An, P. T.  (2011) Maximizing strictly convex quadratic functions with bounded perturbation. Journal of Optimization Theory and Applications: 149(1), 1-25.
An, P. T.  (2010) Method of orienting curves for determining the convex hull of a finite set of points in the plane. Optimization: A Journal of Mathematical Programming and Operations Research: 59(2), 175-179.
An, P. T.  (2010) Reachable Grasps on a Polygon of a Robot Arm: Finding Convex Ropes Without Triangulation. International Journal of Robotics & Automation: 25(4), 304-310.
An, P. T. ; Giang, D. T.; Hai, N. N. N. (2010) Some Computational Aspects of Geodesic Convex Sets in a Simple Polygon. Numerical Functional Analysis and Optimization: 31(3), 221-231.

Comunicações em Actas de Conferência

An, P. T. ; Giang, D. T. (2015) A Direct Method for Determining the Lower Convex Hull of a Finite Point Set in 3D. Advances in Intelligent Systems and Computing, Springer, ISBN 978-3-319-17995-7, Proceedings of 3rd International Conference on Computer Science, Applied Mathematics and Applications - ICCSAMA 2015, May 11-13, Metz, France: 358, 15-26 .
An, P. T. ; Hai, N. N.; Hoai, T. V.; Trang, L. H. (2014) On the performance of triangulation-based multiple shooting method for 2D shortest path problems. Proceedings of International Workshop on Advanced Computing and Applications. LNCS Transactions on Large Scale Data and Knowledge Centered Systems: 8960, 45-56.
An, P. T. ; Nguyen Ngoc Hai; Tran Van Hoai (2013) The Role of Convexity for Solving Some Shortest Path Problems in Plane Without Triangulation. Proceedings of International Conference Numerical Analysis and Applied Mathematics, AIP Conference Proceedings (ICNAAM 2013), American Institute of Physics, New York: 1557, 89-93.