Operations Research Center Working Papers: Recent submissions
Now showing items 73-75 of 372
-
A Polyhedral Intersection Theorem for Capacitated Spanning Trees
(Massachusetts Institute of Technology, Operations Research Center, 1989-12)In a two-capacitated spanning tree of a complete graph with a distinguished root vertex v, every component of the induced subgraph on V\{v} has at most two vertices. We give a complete,non-redundant characterization of the ... -
Extremum Properties of Hexagonal Partitioning and the Uniform Distribution in Euclidean Location
(Massachusetts Institute of Technology, Operations Research Center, 1985-01) -
Location Games and Bounds for Median Problems
(Massachusetts Institute of Technology, Operations Research Center, 1985-01)We consider a two-person zero-sum game in which the maximizer selects a point in a given bounded planar region, the minimizer selects K points in that region,.and the payoff is the distance from the maximizer's location ...
