Convex envelopes for edge-concave functions

Al-Khayyal, F.A., Falk, J.E.: Jointly constrained biconvex programming. Math. Oper. Res. 8 (2), 273–286 (1983)

Bertsekas, D.P., Nedić, A., Ozdaglar, A.E.: Convex Analysis and Optimization. Athena Scientific, Belmont, Massachusetts, 2003

Björner, A., Las Vergnas, M., Sturmfels, B., White, N., Ziegler, G.M.: Oriented Matroids. Volume 46 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, 1993

Cottle, R.W.: Minimal triangulations of the 4-cube. Discrete Math. 40, 25–29 (1982)

Crama, Y.: Concave extensions for nonlinear 0-1 maximization problems. Math. Program. 61, 53–60 (1993)

Floudas, C.A.: Deterministic Global Optimization: Theory, Algorithms and Applications. Kluwer Academic Publishers, 2000

Haiman, M.: A simple and relatively efficient triangulation of the n-cube. Discrete Comput. Geom. 6, 287–289 (1991)

Horst, R., Tuy, H.: Global optimization: deterministic approaches. Springer-Verlag, Berlin, 1993. 2nd. rev. edition

Hughes, R.B., Anderson, M.R.: Simplexity of the cube. Discrete Mathematics. 158, 99–150 (1999)

Hughs, R.B.: Lower bounds on cube simplexity. Discrete Math. 133, 123–138 (1994)

Lee, C.W.: Triangulating the d-cube. In: J.W. Goodman (ed.), Discrete Geometry and Convexity. Volume 440 of Ann. N.Y. Acad. Sci., 1985, pp. 205–212

Mara, P.S.: Triangulations for the cube. J. Comb. Theory Ser. A. 20, 170–176 (1976)

McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part I – convex underestimating problems. Math. Program. 10, 147–175 (1976)

Meyer, C.A.: Convex Relaxations and Convex Envelopes for Deterministic Global Optimization. PhD thesis, Princeton University, Princeton, New Jersey, 2004

Meyer, C.A., Floudas, C.A.: Convex envelopes of trilinear monomials with mixed sign domains. In: C.A. Floudas, P.M. Pardalos (eds.), Frontiers in Global Optimization, Dordrecht, 2003. Kluwer Academic Publishers, pp. 327–352

Meyer, C.A., Floudas, C.A. Convex envelopes of trilinear monomials with positive or negative domains. J. Global Optim. 29, 125–155 (2004)

Rikun, A.D.: A convex envelope formula for multilinear functions. J. Global Optim. 10, 425–437 (1997)

Sallee, J.F.: A triangulation of the n-cube. Discrete Math. 40, 81–86 (1982)

Sherali, H.D.: Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets. Acta Mathematica Vietnamica 22, 245–270 (1997)

Sherali, H.D., Adam, W. P.: A Reformulation-Linearization Technique for Solving Discrete and Continous Nonconvex Problems. Volume 31, Kluwer Academic Publishers, Dordrecht, 1999

Sherali, H.D., Alameddine, A.: A new reformulation-linearization technique for bilinear programming problems. J. Global Optim. 2, 379–410 (1992)

Smith, W.D.: A lower bound on the simplexity of the n-cube via hyperbolic volumes. Europ. J. Combinatorics 21, 131–137 (2000)

Tardella, F.: On the existence of polyhedral convex envelopes. In: C.A. Floudas, P.M. Pardalos (eds.), Frontiers in Global Optimization, Dordrecht, 2003. Kluwer Academic Publishers, pp. 563–574

Tawarmalani, M., Ahmed, S., Sahinidis, N.V.: Product disaggregation in global optimization and relaxations of rational programs. Optimization and Engineering 3, 281–303 (2002)

Tawarmalani, M., Sahinidis, N.V.: Convex extensions and convex envelopes of lower semi-continuous functions. Math. Program. 2, 247–263 (2002)

Ziegler, G.M.: Lectures on Polytopes. Volume 152 of Graduate Texts in Mathematics. Springer Verlag, 1994