Sciweavers

139 search results - page 1 / 28
» A Grid-enabled Branch and Bound Algorithm for Solving Challe...
Sort
View
IPPS
2007
IEEE
13 years 10 months ago
A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems
Solving optimally large instances of combinatorial optimization problems requires a huge amount of computational resources. In this paper, we propose an adaptation of the parallel...
Mohand-Said Mezmaz, Nouredine Melab, El-Ghazali Ta...
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
14 years 1 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor
ICCV
2011
IEEE
12 years 3 months ago
Optimal Landmark Detection using Shape Models and Branch and Bound
Fitting statistical 2D and 3D shape models to images is necessary for a variety of tasks, such as video editing and face recognition. Much progress has been made on local fitting...
Brian Amberg, Thomas Vetter
AAAI
1998
13 years 5 months ago
Branch and Bound Algorithm Selection by Performance Prediction
Wepropose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Boundalgorithm from amo...
Lionel Lobjois, Michel Lemaître
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 3 months ago
A Dynamic Programming Framework for Combinatorial Optimization Problems on Graphs with Bounded Pathwidth
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
Mugurel Ionut Andreica