Sciweavers

14739 search results - page 76 / 2948
» An optimization problem on the sphere
Sort
View
ESA
2006
Springer
131views Algorithms» more  ESA 2006»
15 years 1 months ago
Finding Total Unimodularity in Optimization Problems Solved by Linear Programs
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...
Christoph Dürr, Mathilde Hurand
AMC
2010
116views more  AMC 2010»
14 years 10 months ago
On a bilinear optimization problem in parallel magnetic resonance imaging
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...
Christian Clason, Gregory von Winckel
ANOR
2005
89views more  ANOR 2005»
14 years 9 months ago
Logic-Based Modeling and Solution of Nonlinear Discrete/Continuous Optimization Problems
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...
Sangbum Lee, Ignacio E. Grossmann
ACL
2010
14 years 8 months ago
WSD as a Distributed Constraint Optimization Problem
This work models Word Sense Disambiguation (WSD) problem as a Distributed Constraint Optimization Problem (DCOP). To model WSD as a DCOP, we view information from various knowledg...
Siva Reddy, Abhilash Inumella
ASIAN
1999
Springer
186views Algorithms» more  ASIAN 1999»
15 years 2 months ago
Ant Colony Optimization for the Ship Berthing Problem
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. ...
Chia Jim Tong, Hoong Chuin Lau, Andrew Lim