On a recognition problem on cut polytope relaxations (original) (raw)

Access this article

Log in via an institution

Subscribe and save

• Starting from 10 chapters or articles per month
• Access and download chapters and articles from more than 300k books and 2,500 journals
• Cancel anytime View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

1. Bondarenko, V.A. and Uryvaev, B.V., On One Problem of Integer Optimization, Autom. Remote Control, 2007, vol. 68, no. 6, pp. 948–953.
   Article MathSciNet MATH Google Scholar
2. Boss, V., Lektsii po matematike, tom 10: Perebor i effektivnye algoritmy (Lectures in Mathematics, vol. 10: Enumeration and Efficient Algorithms), Moscow: LKI, 2008.
   Google Scholar
3. Bondarenko, V.A., On One Combinatorial Polytope, in Modeling and Analysis of Computational Systems, Yaroslavl: Yaroslav. Gos. Univ., 1987, pp. 133–134.
   Google Scholar
4. Padberg, M.V., The Boolean Quadratic Polytope: Some Characteristics, Facets and Relatives, Math. Program., 1989, vol. 45, pp. 139–172.
   Article MathSciNet MATH Google Scholar
5. Deza, M.M. and Laurent, M., Geometry of Cuts and Metrics (Algorithms and Combinatorics), Berlin: Springer, 2009, 2nd ed.
   Google Scholar
6. Bondarenko, V.A. and Nikolaev, A.V., A Class of Hypergraphs and Vertices of Cut Polytope Relaxations, Dokl. Math., 2012, vol. 85, no. 1, pp. 46–47.
   Article MathSciNet MATH Google Scholar
7. Ziegler, G.M., Lectures on 0–1 Polytopes, in Polytopes-Combinatorics and Computation, DMV Seminars Series, Kalai, G. and Ziegler, G.M., Eds., Basel: Birkhauser, 2000.
   Google Scholar
8. Nikolaev, A.V., Hypergraphs of a Special Form and Analyzing the Properties of Cut Polytope Relaxations, Modelir. Anal. Inform. Sist., 2011, vol. 18, no. 3, pp. 82–100.
   Google Scholar
9. Gawrilow, E. and Joswig, M., Polymake: A Framework for Analyzing Convex Polytopes, in Polytopes-Combinatorics and Computation (Oberwolfach, 1997), DMV Sem., 29, Basel: Birkhauser, 2000, pp. 43–73.
   Chapter Google Scholar
10. Christof, T. and Loebel, A., PORTA: Polyhedron Representation Transformation Algorithm, Version 1.4.1, The Konrad-Zuse-Zentrum fur Informationstechnik Berlin, http://www.zib.de/Optimization/Software/Porta/.
11. Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NP-Completeness, A Series of Books in the Mathematical Sciences, San Francisco: W.H. Freeman and Co., 1979.
    MATH Google Scholar
12. Gebser, M., Kaufmann, B., Neumann, A., and Schaub, T., Conflict-Driven Answer Set Solving, Proc. Twentieth Int. Joint Conf. Artificial Intelligence (IJCAI’07), Hyderabad, India: AAAI Press/MIT Press, 2007, pp. 386–392.
    Google Scholar
13. Biere, A. and Kepler, J., Plingeling, Linz: Univ. of Linz, Austria, http://fmv.jku.at/lingeling/.
14. Berkelaar, M., Eikland, K., and Notebaert, P., lp solve 5.5.2.0. Open Source (Mixed-Integer) Linear Programming System, http://lpsolve.sourceforge.net/5.5/.
15. Makhorin, A.O., GLPK: GNU Linear Programming Kit 4.53, http://www.gnu.org/software/glpk/.

Download references