14548 search results - page 115 / 2910 » The Optimal Path-Matching Problem |
TAPIA
2005
ACM
14 years 3 months ago
2005
ACM
We present a numerical experimentation of the global optimization algorithm presented by Velázquez et. al. [3] applied to a nonlinear hyperboloid least squares problem. This prob...
ESA
2006
Springer
14 years 1 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...
AMC
2010
13 years 10 months ago
2010
This work is concerned with the structure of bilinear minimization problems arising in recovering subsampled and modulated images in parallel magnetic resonance imaging. By consid...
ANOR
2005
13 years 10 months ago
2005
This paper presents a review of advances in the mathematical programming approach to discrete/continuous optimization problems. We first present a brief review of MILP and MINLP f...
ASIAN
1999
Springer
14 years 2 months ago
1999
Springer
Abstract. Ant Colony Optimization (ACO) is a paradigm that employs a set of cooperating agents to solve functions or obtain good solutions for combinatorial optimization problems. ...