5331 search results - page 193 / 1067 » Algebraic Methods for Optimization Problems |
117
Voted
GECCO
2007
Springer
15 years 8 months ago
2007
Springer
The bin packing problem (BPP) is a real-world problem that arises in different industrial applications related to minimization of space or time. The aim of this research is to au...
100
click to vote
COR
2007
15 years 2 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
130
click to vote
ICML
2005
IEEE
16 years 3 months ago
2005
IEEE
We discuss the problem of fitting an implicit shape model to a set of points sampled from a co-dimension one manifold of arbitrary topology. The method solves a non-convex optimis...
113
click to vote
ICCAD
1999
IEEE
15 years 6 months ago
1999
IEEE
We introduce the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups of sinks. The associative ...
115
click to vote
EVOW
2008
Springer
15 years 4 months ago
2008
Springer
The bi-objective ring star problem aims to locate a cycle through a subset of nodes of a graph while optimizing two types of cost. The first criterion is to minimize a ring cost, r...