Sciweavers

850 search results - page 72 / 170
» heuristics 2006
Sort
View
101
Voted
MP
2006
123views more  MP 2006»
15 years 20 days ago
New interval methods for constrained global optimization
Abstract. Interval analysis is a powerful tool which allows to design branch-and-bound algorithms able to solve many global optimization problems. In this paper we present new adap...
Mihály Csaba Markót, J. Ferná...
MP
2006
73views more  MP 2006»
15 years 20 days ago
On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
We present a primal-dual interior-point algorithm with a filter line-search method for nonlinear programming. Local and global convergence properties of this method were analyzed i...
Andreas Wächter, Lorenz T. Biegler
IJAIT
2007
119views more  IJAIT 2007»
15 years 19 days ago
Minimizing the makespan for Unrelated Parallel Machines
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Liang Ya...
IJCSA
2007
110views more  IJCSA 2007»
15 years 19 days ago
Multiprocessor Scheduling Using Hybrid Particle Swarm Optimization with Dynamically Varying Inertia
The problem of task assignment in heterogeneous computing systems has been studied for many years with many variations. We have developed a new hybrid approximation algorithm. The...
S. N. Sivanandam, P. Visalakshi, A. Bhuvaneswari
INFORMATICALT
2000
125views more  INFORMATICALT 2000»
15 years 16 days ago
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
Gintaras Palubeckis