A note on cake cutting
β Scribed by S. Even; A. Paz
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 694 KB
- Volume
- 7
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
What is the minimum number of cuts needed to divide a cake among IZ players so that each player receives at least l/n of the whole cake? The simple "one cuts -the other chooses" shows that one cut suffices for 2 players. It was previously known that 3 players require 3 cuts and 4 players require 4 c
In this paper, we propose a methodology for branch-and-cut-and-price when cuts and columns are generated simultaneously. The methodology is illustrated with two application cases: the Split Delivery Vehicle Routing Problem (SDVRP) and the Bus Rapid Transit Route Design Problem (BRTRDP).
Let be a positive measure deΓΏned on the product of two vector spaces E = E 1 Γ E 2 . Let F = F( ) be a natural exponential family (NEF) generated by such that the projection of F on E 1 constitutes a NEF on E 1 . This property, called a cut on E 1 , has been deΓΏned and characterized by Barndor -Niel