3433 search results - page 309 / 687 » Heuristics for a bidding problem |
160
click to vote
WEA
2004
Springer
16 years 3 days ago
2004
Springer
We introduce a metaheuristic framework for combinatorial optimization. Our framework is similar to others (e.g. [1]) in that it is modular enough that important components can be i...
200
click to vote
AE
2003
Springer
16 years 16 hour ago
2003
Springer
Abstract. The graph partitioning problem consists of dividing the vertices of a graph into a set of balanced parts, such that the number of edges connecting vertices in different ...
169
click to vote
ESA
2003
Springer
16 years 4 hour ago
2003
Springer
We report on a project with a German car manufacturer. The task is to compute (approximate) solutions to a specific large-scale packing problem. Given a polyhedral model of a car ...
165
click to vote
EVOW
2010
Springer
15 years 12 months ago
2010
Springer
We present an algorithmic approach to solving the problem of chromatic entropy, a combinatorial optimization problem related to graph coloring. This problem is a component in algor...
192
click to vote
CAV
2001
Springer
15 years 11 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...