Sciweavers

4430 search results - page 104 / 886
» Solving Optimization Problems with DLL
Sort
View
IJKESDP
2010
149views more  IJKESDP 2010»
15 years 1 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
EVOW
2007
Springer
15 years 9 months ago
Tackling the Container Loading Problem: A Hybrid Approach Based on Integer Linear Programming and Genetic Algorithms
Abstract. This paper presents a novel hybrid approach for solving the Container Loading (CL) problem based on the combination of Integer Linear Programming (ILP) and Genetic Algori...
Napoleão Nepomuceno, Plácido Rog&eac...
DAM
2007
94views more  DAM 2007»
15 years 2 months ago
New formulations for the Kissing Number Problem
Determining the maximum number of D-dimensional spheres of radius r that can be adjacent to a central sphere of radius r is known as the Kissing Number Problem (KNP). The problem ...
Sergei Kucherenko, Pietro Belotti, Leo Liberti, Ne...
GECCO
2010
Springer
211views Optimization» more  GECCO 2010»
15 years 4 months ago
Investigating EA solutions for approximate KKT conditions in smooth problems
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
Rupesh Tulshyan, Ramnik Arora, Kalyanmoy Deb, Joyd...
SCALESPACE
2009
Springer
15 years 9 months ago
On Level-Set Type Methods for Recovering Piecewise Constant Solutions of Ill-Posed Problems
We propose a regularization method for solving ill-posed problems, under the assumption that the solutions are piecewise constant functions with unknown level sets and unknown leve...
Adriano DeCezaro, Antonio Leitão, Xue-Cheng...