3049 search results - page 165 / 610 » On the Convergence of Bound Optimization Algorithms |
191
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity flow formulations, which are bas...
188
click to vote
SODA
2010
ACM
15 years 4 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
191
click to vote
SPIN
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We develop an algorithm to compute timed reachability probabilities for distributed models which are both probabilistic and nondeterministic. To obtain realistic results ...
161
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. The multiple knapsack problem (MKP) is a classical combinatorial optimization problem. A recent algorithm for some classes of the MKP is bin-completion, a bin-oriented, b...
304
click to vote
GIS
2006
ACM
16 years 7 months ago
2006
ACM
Given a query point and a collection of spatial features, a multi-type nearest neighbor (MTNN) query finds the shortest tour for the query point such that only one instance of eac...