3433 search results - page 229 / 687 » Heuristics for a bidding problem |
175
click to vote
COR
2006
15 years 6 months ago
2006
Crossdocking studies have mostly been concerned with the physical layout of a crossdock or on a single crossdock. In this work, we study a network of crossdocks taking into consid...
194
click to vote
SBP
2011
Springer
15 years 1 months ago
2011
Springer
Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would l...
146
click to vote
RTA
2000
Springer
15 years 10 months ago
2000
Springer
We consider the problem of higher-order matching restricted et of linear -terms (i.e., -terms where each abstraction x. M is such that there is exactly one free occurrence of x in ...
156
click to vote
DISOPT
2006
15 years 6 months ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
177
click to vote
FGCS
2000
15 years 6 months ago
2000
: A general framework for solving combinatorial optimization problems heuristically by the Ant System approach is developed. The framework is based on the concept of a construction...