8949 search results - page 1587 / 1790 » is 1998 |
183
click to vote
MP
1998
15 years 6 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...
167
click to vote
MP
1998
15 years 6 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. ...
163
click to vote
MP
1998
15 years 6 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...
176
click to vote
MST
1998
15 years 6 months ago
1998
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
163
click to vote
MST
1998
15 years 6 months ago
1998
We consider the problem of merging two sorted sequences on constant degree networks using comparators only. The classical solution to the problem are the networks based on Batcherâ...