A near equitable 2-person cake cutting algorithm

Author： Cechlárová Katarína   Pillárová Eva  

Publisher： Taylor & Francis Ltd

ISSN： 0233-1934

Source： Optimization, Vol.61, Iss.11, 2012-11, pp. : 1321-1330

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

Abstract

Related content

N-Person Cake-Cutting: There May Be No Perfect Division

By Brams Steven J.   Jones Michael A.   Klamler Christian  

American Mathematical Monthly, Vol. 120, Iss. 1, 2013-01 ,pp. : 35-47

Mathematical Association of America

Access to resources Recommend Favorite

Cutting a Pie Is Not a Piece of Cake

By Barbanel Julius B.   Brams Steven J.   Stromquist Walter  

American Mathematical Monthly, Vol. 116, Iss. 6, 2009-06 ,pp. : 496-514

Mathematical Association of America

Access to resources Recommend Favorite

Cutting Sphere Algorithm

By Polak E.   Royset J.O.  

Journal of Optimization Theory and Applications, Vol. 119, Iss. 2, 2003-11 ,pp. : 379-385

Springer Publishing Company

Access to resources Recommend Favorite

Two-Person Pie-Cutting: The Fairest Cuts

By Barbanel Julius B.   Brams Steven J.  

The College Mathematics Journal, Vol. 42, Iss. 1, 2011-01 ,pp. : 25-32

Mathematical Association of America

Access to resources Recommend Favorite

A cutting plane algorithm for the capacitated facility location problem

By Avella Pasquale   Boccia Maurizio  

Computational Optimization and Applications, Vol. 43, Iss. 1, 2009-05 ,pp. : 39-65

Springer Publishing Company

Access to resources Recommend Favorite