4114 search results - page 40 / 823 » Efficient Algorithms for the 2-Center Problems |
121
click to vote
DAC
1996
ACM
15 years 8 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
157
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
155
click to vote
GECCO
2010
Springer
15 years 1 months ago
2010
Springer
Large software companies have to plan their project portfolio to maximize potential portfolio return and strategic alignment, while balancing various preferences, and considering ...
133
click to vote
INFORMATICALT
2006
15 years 4 months ago
2006
Recently, genetic algorithms (GAs) and their hybrids have achieved great success in solving difficult combinatorial optimization problems. In this paper, the issues related to the ...
120
click to vote
IOR
2008
15 years 4 months ago
2008
In 1958, Wagner and Whitin published a seminal paper on the deterministic uncapacitated lot-sizing problem, a fundamental model that is embedded in many practical production plann...