heuristic algorithm 
A heuristic algorithm is proposed for determining the maximum size of these domains of attraction.


A heuristic algorithm MMPSolver is then proposed to solve the problem.


Then a heuristic algorithm is proposed to yield nearoptimal solution efficiently.


We present an efficient heuristic algorithm that combines two criteria for optimization: throughput maximization, as well as total flow minimization.


Based on this, a heuristic algorithm is proposed to solve the problem.


This paper proposes an effective heuristic algorithm for dynamic multicast routing with delayconstrained DDMR.


Heuristic algorithm for offlattice protein folding problem


Enlightened by the law of interactions among objects in the physical world, we propose a heuristic algorithm for solving the threedimensional (3D) offlattice protein folding problem.


A heuristic algorithm to solve the task partition problem in MDOCEM


We first present a formal method to describe the task partition problem, then give a heuristic algorithm to solve the task partition problem that gives an approximate optimum solution.


The delay constrained least cost path problem with imprecise delay information is discussed, and a distributed heuristic algorithm without any assumption of imprecise state information is presented.


An effective heuristic algorithm for solving the minimum makespan problem of job shop scheduling is presented.


Then, a heuristic algorithm is developed to locate the optimal or near optimal solutions of the model based on the Tabu search mechanism.


A twostage heuristic algorithm is proposed for the solution of the problem.


The first fit decreasing (FFD) heuristic algorithm is one of the most famous and most studied methods for an approximative solution of the binpacking problem.


A heuristic algorithm is developed for the problems with the objective of minimizing the sum of rectilinear distances weighted by flow amounts between the facilities.


In this paper we develop an optimal and a heuristic algorithm for the problem of designing a flexible assembly line when several equipment alternatives are available.


The BCP Max, recently proposed, appears as the first efficient heuristic algorithm to perform the particular neuron training in the Sequential Learning.


In this Letter, a novel heuristic algorithm is proposed.


By this algorithm, the local optimum solution can be obtained certainly, and a method is provided to judge whether or not the approximate optimum solution obtained by heuristic algorithm is an optimum solution.

