14739 search results - page 232 / 2948 » An optimization problem on the sphere |
157
click to vote
CIMCA
2005
IEEE
15 years 11 months ago
2005
IEEE
Minimal Switching Graph (MSG) is a graphical model for the constrained via minimization problem — a combinatorial optimization problem in integrated circuit design automation. F...
150
Voted
ESA
2004
Springer
15 years 11 months ago
2004
Springer
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
145
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
EVITA, standing for Evolutionary Inventory and Transportation Algorithm, aims to be a commercial tool to address the problem of minimising both the transport and inventory costs o...
161
click to vote
GECCO
2000
Springer
15 years 9 months ago
2000
Springer
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
144
click to vote
STOC
1995
ACM
15 years 9 months ago
1995
ACM
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut,...