The following pages link to (Q5342287):
Displaying 50 items.
- A generalization of \(\omega \)-subdivision ensuring convergence of the simplicial algorithm (Q286595) (← links)
- A convergent simplicial algorithm with \(\omega \)-subdivision and \(\omega \)-bisection strategies (Q427360) (← links)
- On the relation between concavity cuts and the surrogate dual for convex maximization problems (Q427376) (← links)
- Degeneracy removal in cutting plane methods for disjoint bilinear programming (Q519763) (← links)
- An improved column generation algorithm for minimum sum-of-squares clustering (Q662300) (← links)
- Minimization of a quasi-concave function over an efficient set (Q689154) (← links)
- A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision (Q721144) (← links)
- A level set algorithm for a class of reverse convex programs (Q751513) (← links)
- A branch and bound-outer approximation algorithm for concave minimization over a convex set (Q757243) (← links)
- Global optimization from concave minimization to concave mixed variational inequality (Q778156) (← links)
- Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
- Depth-optimized convexity cuts (Q817181) (← links)
- On the use of cuts in reverse convex programs (Q913668) (← links)
- Jointly constrained bilinear programs and related problems: An overview (Q918873) (← links)
- Convergence of a subgradient method for computing the bound norm of matrices (Q1057619) (← links)
- Convex programs with an additional reverse convex constraint (Q1071651) (← links)
- An algorithm for optimizing over the weakly-efficient set (Q1077330) (← links)
- A branch and bound algorithm for extreme point mathematical programming problems (Q1078072) (← links)
- Quadratic functions with exponential number of local maxima (Q1079496) (← links)
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization (Q1090607) (← links)
- Utility, probabilistic constraints, mean and variance of discounted rewards in Markov decision processes (Q1091281) (← links)
- Using convex envelopes to solve the interactive fixed-charge linear programming problem (Q1093525) (← links)
- A finite procedure to generate feasible points for the extreme point mathematical programming problem (Q1103529) (← links)
- On a class of functions attaining their maximum at the vertices of a polyhedron (Q1115347) (← links)
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems (Q1122325) (← links)
- Linear programs with an additional reverse convex constraint (Q1140531) (← links)
- Reverse convex programming (Q1147072) (← links)
- Membership functions, some mathematical programming models and production scheduling (Q1165156) (← links)
- Efficient algorithms for solving rank two and rank three bilinear programming problems (Q1186269) (← links)
- Polyhedral annexation, dualization and dimension reduction technique in global optimization (Q1200635) (← links)
- A new reformulation-linearization technique for bilinear programming problems (Q1201905) (← links)
- A linear programming approach to solving bilinear programmes (Q1207310) (← links)
- Linear multiplicative programming (Q1207311) (← links)
- Maximization of linearly constrained posynomials (Q1245683) (← links)
- Concave cost minimization on networks (Q1257417) (← links)
- A low-rank bilinear programming approach for sub-optimal solution of the quadratic assignment problem (Q1278325) (← links)
- Parallel computing in nonconvex programming (Q1309859) (← links)
- A penalty function approach for solving bi-level linear programs (Q1310974) (← links)
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems (Q1321233) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- A Lagrangean heuristic for the capacitated concave minimum cost network flow problem (Q1341992) (← links)
- General purpose heuristics for integer programming. I (Q1365114) (← links)
- Penalty function approach to linear trilevel programming (Q1379973) (← links)
- Convexity cuts for multiple choice problems (Q1393350) (← links)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) (← links)
- Generalized \(\gamma\)-valid cut procedure for concave minimization (Q1807817) (← links)
- A heuristic for the continuous capacity and flow assignment (Q1869661) (← links)
- An algebra-based approach for linearly constrained concave minimization (Q1876470) (← links)
- Least trimmed squares regression, least median squares regression, and mathematical program\-ming (Q1876766) (← links)
- Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
