Titlebook: Experimental and Efficient Algorithms; Third International Celso C. Ribeiro,Simone L. Martins Conference proceedings 2004 Springer-Verlag

Malicious

书目名称Experimental and Efficient Algorithms影响因子(影响力)




书目名称Experimental and Efficient Algorithms影响因子(影响力)学科排名




书目名称Experimental and Efficient Algorithms网络公开度




书目名称Experimental and Efficient Algorithms网络公开度学科排名




书目名称Experimental and Efficient Algorithms被引频次




书目名称Experimental and Efficient Algorithms被引频次学科排名




书目名称Experimental and Efficient Algorithms年度引用




书目名称Experimental and Efficient Algorithms年度引用学科排名




书目名称Experimental and Efficient Algorithms读者反馈




书目名称Experimental and Efficient Algorithms读者反馈学科排名

美食家

Itinerant

Ingenuity

精美食品

Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop e instances, so we propose an original cooperation between this exact method and a Genetic Algorithm to obtain good results on large instances. Results obtained are promising and show that cooperation between antagonist optimization methods could be very efficient.

鄙视

鄙视

Fibrillation

Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem, of Skutella [19] for congestion and cost, which is the best known bicriteria approximation. We study experimentally the quality of approximation achieved by the algorithms and the effect of heuristics on their performance. We also compare these algorithms against the previous best ones by Kolliopoulos and Stein [15].

Employee

Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases,operties that make the heuristics efficient are established. We also present a mixed integer programming formulation of the problem whose linear relaxation yields tighter lower bounds than known formulations. Computational results obtained with our algorithms are compared with those from existing constructive heuristics on several types of graphs.

Frenetic

Solving Chance-Constrained Programs Combining Tabu Search and Simulation,obust solutions. However, the efficiency of algorithms based on Local Search, such as Tabu Search, suffers from the complexity of evaluating the objective function after each move..In this paper, we propose alternative methods of dealing with uncertainties which are suitable to be implemented within a Tabu Search framework.