Sciweavers

269 search results - page 6 / 54
» A branch and bound method for stochastic global optimization
Sort
View
AIPS
2006
14 years 9 days ago
Exploiting the Power of Local Search in a Branch and Bound Algorithm for Job Shop Scheduling
This paper presents three techniques for using an iterated local search algorithm to improve the performance of a state-of-the-art branch and bound algorithm for job shop scheduli...
Matthew J. Streeter, Stephen F. Smith
CVPR
2012
IEEE
12 years 1 months ago
Linear solution to scale invariant global figure ground separation
We propose a novel linear method for scale invariant figure ground separation in images and videos. Figure ground separation is treated as a superpixel labeling problem. We optim...
Hao Jiang
AAAI
1998
14 years 7 days 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
CCE
2006
13 years 11 months ago
Global optimization for the synthesis of integrated water systems in chemical processes
In this paper, we address the problem of optimal synthesis of an integrated water system, where water using processes and water treatment operations are combined into a single net...
Ramkumar Karuppiah, Ignacio E. Grossmann
WSC
2001
14 years 8 days ago
Global random optimization by simultaneous perturbation stochastic approximation
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
John L. Maryak, Daniel C. Chin