Acyclic orientations with path constraints

Abstract : 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.
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02184964
Contributor : Rosa Figueiredo <>
Submitted on : Tuesday, July 16, 2019 - 12:44:15 PM
Last modification on : Thursday, July 18, 2019 - 1:46:33 PM

File

aopolytope.pdf
Publisher files allowed on an open archive

Identifiers

Collections

Citation

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

Share

Metrics

Record views

8

Files downloads

10