A branch-and-cut algorithm for scheduling the highly-constrained Chilean soccer tournament

Título:

A branch-and-cut algorithm for scheduling the highly-constrained Chilean soccer tournament

Autor:

Celso da Cruz Carneiro Ribeiro

Ano:

2007

Revista:

Lecture Notes in Computer Science

ISSN:

03029743

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

Heuristics for the generalized median graph problem

A Multi-Criteria Tabu Search Approach to Cell Formation Problems in Group Technology

A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits

Scheduling the Brazilian soccer tournament with fairness and broadcast objectives

Probabilistic stopping rules for GRASP heuristics and extensions

A branch-and-cut algorithm for equitable coloring based on a formulation by representatives

A Parallel GRASP for the Steiner Problem in Graphs Using a Hybrid Local Search Strategy

Edge Coloring: A Natural Model for Sports Scheduling

An exact algorithm for the maximum quasi-clique problem

A hybrid bin-packing heuristic to multiprocessor scheduling