Acyclic Orientations with Path Constraints
From MaRDI portal
Publication:3163668
DOI10.1051/ro:2008028zbMath1198.90336OpenAlexW3098235223MaRDI QIDQ3163668
Valmir C. Barbosa, Nelson F. Maculan, Cid Carvalho De Souza, Rosa M. V. Figueiredo
Publication date: 26 October 2010
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/105414
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (3)
A note on orientation and chromatic number of graphs ⋮ Symmetry-breaking inequalities for ILP with structured sub-symmetry ⋮ A branch-and-cut algorithm for partition coloring
Uses Software
Cites Work
This page was built for publication: Acyclic Orientations with Path Constraints