Pages that link to "Item:Q3738933"
From MaRDI portal
The following pages link to Methods for Global Concave Minimization: A Bibliographic Survey (Q3738933):
Displayed 50 items.
- 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)
- Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
- Global optimization algorithms for linearly constrained indefinite quadratic problems (Q810370) (← links)
- Concave minimization via conical partitions and polyhedral outer approximation (Q811411) (← links)
- On the use of cuts in reverse convex programs (Q913668) (← links)
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds (Q922953) (← links)
- Allocating procurement to capacitated suppliers with concave quantity discounts (Q924901) (← links)
- To be fair or efficient or a bit of both (Q925820) (← links)
- Conditions for boundedness in concave programming under reverse convex and convex constraints (Q1006541) (← 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)
- Global minimization of indefinite quadratic problems (Q1092620) (← links)
- Enumerative techniques for solving some nonconvex global optimization problems (Q1102205) (← links)
- Quadratic problems defined on a convex hull of points (Q1102708) (← links)
- On the global minimization of a convex function under general nonconvex constraints (Q1111474) (← links)
- A parallel algorithm for constrained concave quadratic global minimization (Q1116888) (← links)
- Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems (Q1122325) (← links)
- The interactive fixed charge inhomogeneous flows optimization problem (Q1173721) (← links)
- Normal conical algorithm for concave minimization over polytopes (Q1177231) (← links)
- Quadratic programming with one negative eigenvalue is NP-hard (Q1177910) (← links)
- An all-linear programming relaxation algorithm for optimizing over the efficient set (Q1177916) (← links)
- An interior point algorithm to solve computationally difficult set covering problems (Q1181917) (← links)
- Global optimization of concave functions subject to quadratic constraints: An application in nonlinear bilevel programming (Q1184526) (← links)
- Reduction of indefinite quadratic programs to bilinear programs (Q1187369) (← links)
- A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case (Q1207046) (← links)
- Construction of test problems for concave minimization under linear and nonlinear constraints (Q1265043) (← links)
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints (Q1310977) (← links)
- A finite, nonadjacent extreme-point search algorithm for optimization over the efficient set (Q1321160) (← links)
- Primal-relaxed dual global optimization approach (Q1321372) (← links)
- A finite concave minimization algorithm using branch and bound and neighbor generation (Q1330802) (← links)
- On the role of continuously differentiable exact penalty functions in constrained global optimization (Q1330806) (← 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)
- Generalized \(\gamma\)-valid cut procedure for concave minimization (Q1807817) (← links)
- An algorithm for a class of nonlinear fractional problems using ranking of the vertices (Q1824995) (← links)
- Extremist vs. centrist decision behavior: Quasi-convex utility functions for interactive multi-objective linear programming problems (Q1867097) (← 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)
- On the solution of concave knapsack problems (Q2276878) (← links)
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms (Q2277131) (← links)
- Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
- A numerical approach for solving some convex maximization problems (Q2505559) (← links)
- Lagrangian duality of concave minimization subject to linear constraints and an additional facial reverse convex constraint (Q2564166) (← links)
- Generalized primal-relaxed dual approach for global optimization (Q2565021) (← links)
- On the equivalence between some discrete and continuous optimization problems (Q2640444) (← links)
- An implicit enumeration method for global optimization problems (Q2641085) (← links)
- Global minimization algorithms for concave quadratic programming problems (Q3534648) (← links)
- Global minimization of large-scale constrained concave quadratic problems by separable programming (Q3731373) (← links)
- Solution of a non-linear programming problem with quadratic functions (Q4764883) (← links)
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions (Q5925734) (← links)