Acyclic orientations with path constraints - Archive ouverte HAL Access content directly
Journal Articles RAIRO - Operations Research Year : 2009

Acyclic orientations with path constraints


Many well-known combinatorial optimization problems can be stated over the set of acyclic orientations of an undirected graph. For example, acyclic orientations with certain diameter constraints are closely related to the optimal solutions of the vertex coloring and frequency assignment problems. In this paper we introduce a linear programming formulation of acyclic orientations with path constraints, and discuss its use in the solution of the vertex coloring problem and some versions of the frequency assignment problem. A study of the polytope associated with the formulation is presented, including proofs of which constraints of the formulation are facet-defining and the introduction of new classes of valid inequalities.
Fichier principal
Vignette du fichier
aopolytope.pdf (167.23 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive

Dates and versions

hal-02184964 , version 1 (16-07-2019)



Rosa Figueiredo, Valmir C Barbosa, Nelson Maculan, Cid C de Souza. Acyclic orientations with path constraints. RAIRO - Operations Research, 2009, 42 (4), pp.455-467. ⟨10.1051/ro:2008028⟩. ⟨hal-02184964⟩
23 View
80 Download



Gmail Facebook Twitter LinkedIn More