The following pages link to Hoang Tuy (Q166199):
Displayed 50 items.
- On an outer approximation concept in global optimization (Q3830824) (← links)
- Minimizing the sum of a convex function and a specially structured nonconvex function (Q3835636) (← links)
- Strongly polynomial algorithm for a production-transportation problem with concave production cost (Q3835663) (← links)
- (Q3873970) (← links)
- (Q3881428) (← links)
- Three improved yersions of scarf's method using conventional subsimplices and allowing eestart and continuation procedures (Q3895256) (← links)
- (Q3917433) (← links)
- (Q3921011) (← links)
- Convergent Algorithms for Minimizing a Concave Function (Q3927058) (← links)
- A fixed point theorem involving a hybrid inwardness-contraction condition (Q3938875) (← links)
- (Q3962781) (← links)
- Pivotal methods for computing equilibrium points: Unified approach and new restart algorithm (Q3962790) (← links)
- (Q3974977) (← links)
- (Q3976082) (← links)
- (Q3997222) (← links)
- On the convex approximation of nonlinear inequalities (Q4052812) (← links)
- (Q4074698) (← links)
- On the general minimax theorem (Q4085514) (← links)
- (Q4100597) (← links)
- (Q4109466) (← links)
- On the Convex Approximation of Nonlinear Inequalities (Q4110245) (← links)
- (Q4123103) (← links)
- (Q4164273) (← links)
- (Q4177357) (← links)
- A modification of scarf's algorithm allowing restarting (Q4178806) (← links)
- (Q4191874) (← links)
- (Q4302068) (← links)
- (Q4313254) (← links)
- An efficient solution method for rank two quasiconcave minimization problems (Q4327903) (← links)
- (Q4394603) (← links)
- (Q4394606) (← links)
- D.C. optimization approach to robust control: Feasibility problems (Q4485350) (← links)
- (Q4495147) (← links)
- (Q4495727) (← links)
- (Q4527207) (← links)
- (Q4539989) (← links)
- LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION (Q4548044) (← links)
- (Q4550783) (← links)
- (Q4666754) (← links)
- (Q4667360) (← links)
- (Q4721870) (← links)
- Conical algorithms for solving a concave programming problem and some generalizations (Q4735041) (← links)
- Strongly polynomial algorithm for two special minimum concave cost network flow problems (Q4764587) (← links)
- (Q4777069) (← links)
- (Q4826163) (← links)
- (Q4833805) (← links)
- (Q4889854) (← links)
- (Q4942595) (← links)
- (Q5184680) (← links)
- (Q5336852) (← links)