Pages that link to "Item:Q3770289"

The following pages link to Concave Minimization Via Collapsing Polytopes (Q3770289):

Displaying 12 items.

• On a class of functions attaining their maximum at the vertices of a polyhedron (Q1115347) (← links)
• On the minimization of a quasi-concave function subject to linear constraints (Q1178718) (← links)
• On-line and off-line vertex enumeration by adjacency lists (Q1180822) (← links)
• A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
• Extremist vs. centrist decision behavior: Quasi-convex utility functions for interactive multi-objective linear programming problems (Q1867097) (← links)
• Nonconvex optimization over a polytope using generalized capacity improvement (Q1904646) (← links)
• Construction of large-scale global minimum concave quadratic test problems (Q2265952) (← links)
• A note on adapting methods for continuous global optimization to the discrete case (Q2276877) (← links)
• An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes (Q2276885) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
• Improved convex and concave relaxations of composite bilinear forms (Q2697000) (← links)
• Reverse polyblock approximation for optimization over the weakly efficient set and efficient set. (Q5942841) (← links)