1013 search results - page 26 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
WG
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present hardness results, approximation heuristics, and exact algorithms for bottleneck labeled optimization problems arising in the context of graph theory. This long...
COMPUTING
2006
14 years 9 months ago
2006
Abstract We are dealing with the optimal, i.e. densest packings of congruent circles into the unit square. In the recent years we have built a numerically reliable, verified method...
APPROX
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A fundamental goal of computational complexity (and foundations of cryptography) is to find a polynomial-time samplable distribution (e.g., the uniform distribution) and...
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract- The Pareto optimal solutions to a multiobjective optimization problem often distribute very regularly in both the decision space and the objective space. Most existing ev...
125
click to vote
EVOW
2012
Springer
13 years 5 months ago
2012
Springer
Abstract. We consider the two-echelon location-routing problem (2ELRP), a well-known problem in freight distribution arising when establishing a two-level transport system with lim...