#### Filter Results:

#### Publication Year

2006

2016

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

The problem of routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength to each of them, such that light-paths whose routes share a common fiber are assigned different wavelengths. This problem was shown to be NP-hard when the objective is to… (More)

An equitable k-coloring of a graph is defined by a partition of its vertices into k disjoint stable subsets, such that the difference between the cardinalities of any two subsets is at most one. The equitable coloring problem consists of finding the minimum value of k such that a given graph can be equitably k-colored. We present two new integer programming… (More)

The Chilean soccer championship follows the structure of a compact single round robin tournament. Good schedules are of major importance for the success of the tournament, making them more balanced , profitable, and attractive. The schedules were prepared by ad hoc procedures until 2004, when a rough integer programming strategy was proposed. In this work,… (More)

The problem of Routing and Wavelength Assignment in Wavelength Division Multiplexing (WDM) optical networks consists in routing a set of lightpaths and assigning a wavelength to each of them, such that light-paths whose routes share a common fiber are assigned to different wavelengths. When the objective is to minimize the total number of wavelengths used,… (More)