20 search results - page 3 / 4 » mp 1998 |
MP
1998
13 years 9 months ago
1998
We define the base polytope B(P, g) of a partially ordered set P and a supermodular function g on the ideals ofP as the convex hull of the incidence vectors of all linear extensio...
MP
1998
13 years 9 months ago
1998
A practical warm-start procedure is described for the infeasible primal-dualinterior-point method employed to solve the restricted master problem within the cutting-plane method. ...
MP
1998
13 years 9 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
MP
1998
13 years 9 months ago
1998
In this paper we consider the problem of ^-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the obje...
INFOCOM
1998
IEEE
1998
IEEE
Performance Bounds for Dynamic Channel Assignment Schemes Operating under Varying Re-Use Constraints
14 years 2 months ago
-We derive bounds for the performance of dynamic channel assignment (DCA) schemeswhich strengthenthe existing Erlang bound. The construction of the bounds is based on a reward para...