new heuristic algorithm 
We give a new heuristic algorithm for minimum matching problems and apply it to the Euclidean problem with random vertices in 2 dimensions.


This paper presents a new heuristic algorithm for the pallet loading problem, the problem of packing the maximum number of identical rectangular boxes onto a rectangular pallet.


This paper presents a new heuristic algorithm for computing a compact hierarchical representation of the objects contained in a 3D static scene.


Moreover, in Part II a new heuristic algorithm for solving both versions of the 2BP is presented and computational results on test problems from the literature are given in order to evaluate the effectiveness of the proposed lower bounds.


This paper proposes a new heuristic algorithm that triangulates a set ofn points inO(n3) time and that never produces a triangulation whose weight is greater than that of a greedy triangulation.


We report a new heuristic algorithm useful for developing leastcost expansion plans for leased telecommunications networks in which there is a hierarchy of possible transmission facilities.


A new heuristic algorithm to perform tabu search on the Quadratic Assignment Problem (QAP) is developed.


After drawing up a synthesis of existing work which addresses this type of problems, we propose a new heuristic algorithm which is based on the machine workload to find an efficient permutation schedule.


A new heuristic algorithm, based on the tabu search methodology, is proposed for constrained redundancy optimization in series and in complex systems.


This manuscript presents a new heuristic algorithm to find near optimal integer solutions for the singly constrained assignment problem.


A new heuristic algorithm solving the linear ordering problem


In this paper, wegive examples of applications of this problem and propose for thegeneral case a new heuristic algorithm and an exactalgorithm.


This paper presents a new heuristic algorithm for designing leastcost telecommunications networks to carry cell site traffic to wireless switches while meeting survivability, capacity, and technical compatibility constraints.


In addition the new heuristic algorithm for solving a bimatrix game problem is investigated.


By discreteevent simulation we compare various routing strategies in terms of blocking probability and we propose a new heuristic algorithm based on an occupancy cost function which takes several possible causes of blocking into account.


This article proposes a new heuristic algorithm, called Shared Multisubbackuppaths Reprovisioning (SMR), to improve the survivability for multilink failures in WDM mesh networks.


A new heuristic algorithm for this problem is proposed in section 3.


Both lightpath routing and wavelength assignment are obtained through a new heuristic algorithm, called GDAP, and described in Section IV.


For solving the dominating set problem we developed a new heuristic algorithm.


We show the relevance of a particular novel class of ordering problems, and then introduce a nontrivial new heuristic algorithm for this class.

