Tuy Hoang

Hoang Tuy

Information about the author Hoang Tuy will soon be added to the site.
Found 10 papers in total
D(C)-optimization and robust global optimization
D(C)-optimization and robust global optimization
2010
For solving global optimization problems with nonconvex feasible sets existing methods...
On solving nonconvex optimization problems by reducing the duality gap
On solving nonconvex optimization problems by reducing the duality gap
2005
Lagrangian bounds, i.e. bounds computed by Lagrangian relaxation, have been used...
Optimization of polynomial fractional functions
Optimization of polynomial fractional functions
2004
A new approach is proposed for optimizing a polynomial fractional function under...
Tabu meta-heuristic based on local search for the concave production–transportation problem
Tabu meta-heuristic based on local search for the concave production–transportation problem
1996
Recently, strongly polynomial time algorithms have been developed for special concave...
Solution of the multisource Weber and conditional Weber problems by d.-c. programming
Solution of the multisource Weber and conditional Weber problems by d.-c. programming
1998
D.-c. programming is a recent technique of global optimization that allows the...
A strongly polynomial algorithm for a convave production-transportation problem with a fixed number of nonlinear variables
A strongly polynomial algorithm for a convave production-transportation problem with a fixed number of nonlinear variables
1996
The authors show that the production-transportation problem involving an arbitrary...
Canonical DC programming problem: Quter approximation methods revisited
Canonical DC programming problem: Quter approximation methods revisited
1995
For solving the canonical DC programming problem (i.e. a convex program with an...
Heuristics based on tabu search and Lagrangean relaxation for the concave production-transportation problem
Heuristics based on tabu search and Lagrangean relaxation for the concave production-transportation problem
1994
Recently, strongly polynomial time algorithms have been developed for special concave...
Strongly polynomial time algorithms for certain concave minimization problems on networks
Strongly polynomial time algorithms for certain concave minimization problems on networks
1993
A parametric method is proposed for solving a special production-transportation...
Normal conical algorithm for concave minimization over polytopes
Normal conical algorithm for concave minimization over polytopes
1991
A new conical algorithm is developed for finding the global minimum of a concave...
Papers per page: