Funder
National Natural Science Foundation of China
Shanghai Municipal People’s Government
Air Force Research Laboratory
Publisher
Springer Science and Business Media LLC
Reference81 articles.
1. Anstreicher, K.M., Burer, S.: Computable representations for convex hulls of low-dimensional quadratic forms. Math. Program. 124(1–2), 33–43 (2010)
2. Arora, S., Puri, M.C., Swarup, K.: The set covering problem with linear fractional functional. Indian J. Pure Appl. Math. 8, 578–588 (1977)
3. Azar, Y., Cohen, E., Fiat, A., Kaplan, H., Racke, H.: Optimal oblivious routing in polynomial time. In: Proceedings of the thirty-fifth annual ACM symposium on Theory of computing, pp. 383–388 (2003)
4. Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discret. Appl. Math. 89(1–3), 3–44 (1998)
5. Barahona, F., Mahjoub, A.R.: On the cut polytope. Math. Program. 36, 157–173 (1986)