Volume 42, Number 4, October-December 2008ALIO/EURO V Conference on Combinatorial Optimization
|Page(s)||455 - 467|
|Published online||04 April 2009|
Acyclic Orientations with Path Constraints
Universidade do Estado do Rio de Janeiro,
Instituto de Matemática e Estatística, 20550-900 Rio de Janeiro - RJ, Brazil; firstname.lastname@example.org
2 Universidade Federal do Rio de Janeiro, Programa de Engenharia de Sistemas e Computação, COPPE, Caixa Postal 68511, 21941-972 Rio de Janeiro - RJ, Brazil; email@example.com firstname.lastname@example.org
3 Universidade Estadual de Campinas, Instituto de Computação, Caixa Postal 6176, 13084-971 Campinas - SP, Brazil; email@example.com
Accepted: 9 January 2008
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.
Mathematics Subject Classification: 90C27 / 90C57
Key words: Acyclic orientations / path constraints / combinatorial optimization problems / facets of polyhedra.
© EDP Sciences, ROADEF, SMAI, 2008
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.