On the cut polyhedron

Author： Conforti M.   Rinaldi G.   Wolsey L.  

Publisher： Elsevier

ISSN： 0012-365X

Source： Discrete Mathematics, Vol.277, Iss.1, 2004-02, pp. : 279-285

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Generating All Vertices of a Polyhedron Is Hard

By Khachiyan Leonid   Boros Endre   Borys Konrad   Elbassioni Khaled   Gurvich Vladimir  

Discrete & Computational Geometry, Vol. 39, Iss. 1-3, 2008-03 ,pp. : 174-190

Springer Publishing Company

Access to resources Recommend Favorite

Successive Approximate Algorithm for Best Approximation from a Polyhedron

By deutsch S.F.  

Journal of Approximation Theory, Vol. 93, Iss. 3, 1998-06 ,pp. : 415-433

Academic Press

Access to resources Recommend Favorite

Law of cosines generalised for any polygon and any polyhedron

By  

The Mathematical Gazette, Vol. 95, Iss. 533, 2011-07 ,pp. : 240-243

Cambridge University Press

Access to resources Recommend Favorite

Analytic cut

By  

The Journal of Symbolic Logic, Vol. 33, Iss. 4, 1969-01 ,pp. : 560-564

Cambridge University Press

Access to resources Recommend Favorite

Monomial Cut Ideals

By Olteanu Anda  

Communications in Algebra, Vol. 41, Iss. 3, 2013-03 ,pp. : 955-970

Taylor & Francis Ltd

Access to resources Recommend Favorite