Pages that link to "Item:Q4773515"

The following pages link to Concave minimization over a convex polyhedron (Q4773515):

Displaying 21 items.

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