On the combinatorial structure of chromatic scheduling polytopes
Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Cycle-based facets of chromatic scheduling polytopes
Discrete Optimization
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
Discrete Optimization
The maximum saving partition problem
Operations Research Letters
Hi-index | 0.00 |