Constraint programming for the diameter constrained minimum spanning tree problem

Título:

Constraint programming for the diameter constrained minimum spanning tree problem

Autor:

Celso da Cruz Carneiro Ribeiro

Ano:

2008

DOI:

10.1016/j.endm.2008.01.017

Revista:

ELECTRONIC NOTES IN DISCRETE MATHEMATICS

ISSN:

15710653

Idioma:

Inglês

Buscar essa publicação no Google Acadêmico

Publicações com a mesma autoria

A Tabu Search Approach to Task Scheduling on Heterogeneous Processors under Precedence Constraints

A Case Study on Parallel Synchronous Implementations of Tabu Search Based on Neighborhood Decomposition

Multiprocessor scheduling under precedence constraints

Uma proposta de framework para desenvolvimento de aplicações paralelas com mobilidade

Heuristics for the generalized median graph problem

Edge Coloring: A Natural Model for Sports Scheduling

Randomized Heuristics for the Max-Cut Problem

The Traveling Tournament Problem with Predefined Venues

On the use of run time distributions to to evaluate and compare stochastic local search algorithms

A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model