Titlebook: Combinatorial Optimization and Applications; 4th International Co Weili Wu,Ovidiu Daescu Conference proceedings 2010 Springer Berlin Heidel

大吃大喝

COST

者变

方便

Tanja Römer,Jean-Pierre Seifertto .. We prove that these restricted cuts still yield good solutions to the original problem: The best restricted cut is a bicriteria approximation to an optimal bisection w.r.t. both the differences in the sizes of the partitions and the number of edges that are cut.

一小块

Pierre-Yvan Liardet,Nele Mentensconstruct MCAs; the novelty in the algorithm is a mixture of three neighborhood functions. We also present a new benchmark for the MCAs problem. The experimental evidence showed that the TS algorithm improves the results obtained by other approaches reported in the literature, finding the optimal solution in some the solved cases.

ABHOR

essential-fats

女上瘾

Construction of Mixed Covering Arrays of Variable Strength Using a Tabu Search Approach,construct MCAs; the novelty in the algorithm is a mixture of three neighborhood functions. We also present a new benchmark for the MCAs problem. The experimental evidence showed that the TS algorithm improves the results obtained by other approaches reported in the literature, finding the optimal solution in some the solved cases.

forager

enumaerate

Pierre-Yvan Liardet,Nele Mentensimit point in finite time, thereby slowing the whole Branch-and-Bound search considerably. In this paper we propose a polynomial time method, based on solving a linear program, for computing the limit point of the Feasibility Based Bounds Tightening algorithm applied to linear equality and inequality constraints.