Search Sciweavers | Sciweavers

930 search results - page 8 / 186

» An Improved Approximation Algorithm for the Traveling Tourna...

click to vote

EOR
2007

174views more EOR 2007»

A Benders approach for the constrained minimum break problem

13 years 8 months ago

Download mat.gsia.cmu.edu

This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...

Rasmus V. Rasmussen, Michael A. Trick

claim paper

Read More »

click to vote

FSTTCS
2009
Springer

130views Software Engineering» more FSTTCS 2009»

Kernels for Feedback Arc Set In Tournaments

14 years 3 months ago

Download www.lirmm.fr

A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...

Stéphane Bessy, Fedor V. Fomin, Serge Gaspe...

claim paper

Read More »

click to vote

ICNC
2009
Springer

196views Applied Computing» more ICNC 2009»

An Improved Greedy Genetic Algorithm for Solving Travelling Salesman Problem

14 years 3 months ago

Download hbduan.buaa.edu.cn

—Genetic algorithm (GA) is too dependent on the initial population and a lack of local search ability. In this paper, an improved greedy genetic algorithm (IGAA) is proposed to o...

Zhenchao Wang, Haibin Duan, Xiangyin Zhang

claim paper

Read More »

click to vote

JACIII
2007

108views more JACIII 2007»

Improving Ant Colony Optimization Algorithms for Solving Traveling Salesman Problems

13 years 8 months ago

Download www.fujipress.jp

Kuo-Sheng Hung, Shun-Feng Su, Zne-Jung Lee

claim paper

Read More »