Simulation results indicate that the proposed distributed heuristic provides near optimal schedule and an integer linear programming (ILP) formulation for the MAC-layer scheduling problem and find an optimal schedule are indicated.Expand

It is demonstrated that Kuhn's convergence theorem is not always correct and it is conjecture that if this algorithm is initiated at the affine subspace spanned by them given points, the convergence is ensured for all but a denumerable number of starting points.Expand

This paper shows how to force a lower bound of $\sqrt{3\,}-\epsilon $ for any positive $\ep silon $ and reduces the gap between the performance of known algorithms.Expand

A strongly polynomial algorithm is provided for this problem, called the maximum residual flow problem, and various extensions of this basic model are considered, which help implement an efficient scheme for solving this problem.Expand

This paper considers a game between two players who choose from a collection of objects and formulates and solves three problems, each one having practical significance for the draft of professional football players.Expand

This work exhibits an explicit solution to the strong separation problem associated with the Fermat-Weber model and shows that anε-approximation solution can be constructed in polynomial time using the standard Ellipsoid Method.Expand