Sciweavers

5331 search results - page 38 / 1067
» Algebraic Methods for Optimization Problems
Sort
View
ANOR
2008
171views more  ANOR 2008»
13 years 10 months ago
A branch and bound method for the job-shop problem with sequence-dependent setup times
This paper deals with the job-shop scheduling problem with sequencedependent setup times. We propose a new method to solve the makespan minimization problem to optimality. The met...
Christian Artigues, Dominique Feillet
ALT
2004
Springer
14 years 7 months ago
Convergence of a Generalized Gradient Selection Approach for the Decomposition Method
The decomposition method is currently one of the major methods for solving the convex quadratic optimization problems being associated with support vector machines. For a special c...
Nikolas List
IJKESDP
2010
149views more  IJKESDP 2010»
13 years 8 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...
SCALESPACE
2009
Springer
14 years 4 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...
JMIV
2010
184views more  JMIV 2010»
13 years 8 months ago
An Optimal Control Formulation of an Image Registration Problem
The basic idea of image registration is to find a reasonable transformation of an image so that the resulting difference between it and another image is made small. We derive an o...
Eunjung Lee, Max Gunzburger