A Polytope for a Product of Real Linear Functions in 0/1 Variables
暂无分享,去创建一个
Oktay Günlük | Jon Lee | Janny M. Y. Leung | Jon Lee | O. Günlük | J. Leung
[1] Alan J. Hoffman,et al. Integral Boundary Points of Convex Polyhedra , 2010, 50 Years of Integer Programming.
[2] Wieslaw Kubiak,et al. Minimization of ordered, symmetric half-products , 2005, Discret. Appl. Math..
[3] Martin Grötschel,et al. The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..
[4] Wieslaw Kubiak,et al. Positive half-products and scheduling with controllable processing times , 2005, Eur. J. Oper. Res..
[5] Egon Balas,et al. The perfectly matchable subgraph polytope of a bipartite graph , 1983, Networks.
[6] Endre Boros,et al. Minimization of Half-Products , 1998, Math. Oper. Res..
[7] Egon Balas. Projection and Lifting in Combinatorial Optimization , 2001, Computational Combinatorial Optimization.
[8] Erich Steiner,et al. A polynomial case of unconstrained zero-one quadratic optimization , 2001, Math. Program..
[9] Wieslaw Kubiak,et al. A half-product based approximation scheme for agreeably weighted completion time variance , 2005, Eur. J. Oper. Res..
[10] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .
[11] Christophe Meyer,et al. Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem , 2006, J. Comb. Optim..
[12] Thomas M. Liebling,et al. Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm , 2005, Eur. J. Oper. Res..
[13] Manfred W. Padberg,et al. The boolean quadric polytope: Some characteristics, facets and relatives , 1989, Math. Program..
[14] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.
[15] Jon Lee,et al. In situ column generation for a cutting-stock problem , 2007, Comput. Oper. Res..
[16] G. Nemhauser,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2014 .
[17] Martin Grötschel,et al. Corrigendum to our paper “the ellipsoid method and its consequences in combinatorial optimization” , 1984, Comb..
[18] Egon Balas,et al. The perfectly Matchable Subgraph Polytope of an arbitrary graph , 1989, Comb..
[19] Caterina De Simone,et al. The cut polytope and the Boolean quadric polytope , 1990, Discret. Math..
[20] S. Janson,et al. Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .
[21] Itamar Pitowsky,et al. Correlation polytopes: Their geometry and complexity , 1991, Math. Program..
[22] David J. Rader,et al. Maximizing the Product of Two Linear Functions In 0-1 Variables , 2002 .
[23] Michel Deza,et al. Geometry of cuts and metrics , 2009, Algorithms and combinatorics.
[24] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .