Concave minimization over a convex polyhedron

Cited In (21)

Maximization of linearly constrained posynomials
A general purpose exact solution method for mixed integer concave minimization problems
Extreme point Quadratic Minimization Problem
Using shortest paths in some transshipment problems with concave costs
Convergence of a subgradient method for computing the bound norm of matrices
COAL: A new heuristic approach for solving the fixed charge problem - computational results
On the global minimization of concave functions
Concave cost minimization on networks
An algorithm for optimizing over the weakly-efficient set
Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
Calculation of bounds on variables satisfying nonlinear inequality constraints
A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem
An algorithm for solving fixed-charge problems using surrogate constraints
Minimum concave-cost network flow problems: Applications, complexity, and algorithms
A computational study of using preprocessing and stronger formulations to solve large general fixed charge problems
Using convex envelopes to solve the interactive fixed-charge linear programming problem
Enumerative techniques for solving some nonconvex global optimization problems
Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual
Separable concave minimization via partial outer approximation and branch and bound

This page was built for publication: Concave minimization over a convex polyhedron

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4773515)