83 search results - page 9 / 17 » Exact methods for combinatorial auctions |
229
click to vote
SMA
2008
ACM
15 years 7 months ago
2008
ACM
An algorithm and implementation is presented to compute the exact arrangement induced by arbitrary algebraic surfaces on a parametrized ring Dupin cyclide. The family of Dupin cyc...
194
click to vote
COMPGEOM
2003
ACM
16 years 28 days ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
196
click to vote
BMCBI
2006
15 years 7 months ago
2006
Background:Receptors and scaffold proteins possess a number of distinct domains and bind multiple partners. A common problem in modeling signaling systems arises from a combinator...
216
Voted
ANOR
2005
15 years 7 months ago
2005
An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem. The algori...
216
Voted
ESA
2000
Springer
15 years 11 months ago
2000
Springer
The resource constrained shortest path problem (CSP) asks for the computation of a least cost path obeying a set of resource constraints. The problem is NP-complete. We give theore...