CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Generalized Ham-Sandwich Cuts for Well Separated Point Sets William Steiger ∗

First Page		Document Content
Date: 2008-10-29 00:10:20 Mathematical analysis Ham sandwich theorem K-set Convex set Mathematics Geometry Convex geometry		CCCG 2008, Montr´eal, Qu´ebec, August 13–15, 2008 Generalized Ham-Sandwich Cuts for Well Separated Point Sets William Steiger ∗ Add to Reading List Source URL: cccg.ca Download Document from Source Website File Size: 159,80 KB Share Document on Facebook

	MathQuest: Linear Algebra Affine and Convex Combinations 1. How do you describe the set of all affine combinations of the vectors (1, 0) and (0, 1)? (a) A point (b) A line segment DocID: 1v0rO - View Document
	A disjunctive convex programming approach to the pollution routing problem Ricardo Fukasawa∗, Qie He†, Yongjia Song‡ Abstract The pollution routing problem (PRP) aims to determine a set of routes and speed over eac DocID: 1sYbq - View Document
	III.2 Convex Set Systems III.2 53 DocID: 1sWmE - View Document
	Many data analysis applications require the solution of optimization problems involving a sum of large number of functions. We consider the problem of minimizing a sum of n functions over a convex constraint set. Algorit DocID: 1sry5 - View Document
	Many data analysis applications require the solution of optimization problems involving a sum of large number of functions. We consider the problem of minimizing a sum of n functions over a convex constraint set. Algorit DocID: 1rkf9 - View Document