共 51 条
- [1] Bonami P(2008)An algorithmic framework for convex mixed integer nonlinear programs Discrete Optim 5 186-204
- [2] Biegler LT(1995)A new method for large-scale box constrained convex quadratic minimization problems Optim Methods Softw 5 57-74
- [3] Conn AR(2017)Robust hex-dominant mesh generation using field-guided polyhedral agglomeration ACM Trans Graph (TOG) 36 114-24:16
- [4] Cornuéjols G(2015)Bendfields: regularized curvature fields from rough concept sketches ACM Trans Graph 34 24:1-415
- [5] Grossmann IE(2015)Instant field-aligned meshes ACM Trans Graph 34 189-67
- [6] Laird CD(2013)Globally optimal direction fields ACM Trans Graph (TOG) 32 59-140
- [7] Lee J(2007)On a binary-encoded ILP coloring formulation INFORMS J Comput 19 406-175
- [8] Lodi A(2005)Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation J Comb Optim 9 59-660
- [9] Margot F(2018)Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations Math Program. Ser. B 170 121-1485
- [10] Sawaya N(1976)Computability of global solutions to factorable nonconvex programs: part I—convex underestimating problems Math. Program. 10 147-1253