Acyclic Orientations with Path Constraints
RAIRO-Oper. Res., 42 4 (2008) 455-467
Published online: 2009-04-04
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Symmetry-breaking inequalities for ILP with structured sub-symmetry
Pascale Bendotti, Pierre Fouilhoux and Cécile RottnerMathematical Programming 183 (1-2) 61 (2020)
https://doi.org/10.1007/s10107-020-01491-4
11480 57 (2019)
https://doi.org/10.1007/978-3-030-17953-3_5
Scheduled-Asynchronous Distributed Algorithm for Optimal Power Flow
Chin-Yao Chang, Jorge Cortes and Sonia MartinezIEEE Transactions on Control of Network Systems 6 (1) 261 (2019)
https://doi.org/10.1109/TCNS.2018.2809963
Length of the Longest Path and Diameter in Orientations of Graphs
Bing ZhouOpen Journal of Discrete Mathematics 07 (02) 65 (2017)
https://doi.org/10.4236/ojdm.2017.72007
3968 (2017)
https://doi.org/10.23919/ACC.2017.7963563
A note on orientation and chromatic number of graphs
Manouchehr ZakerJournal of Combinatorial Optimization 34 (2) 605 (2017)
https://doi.org/10.1007/s10878-016-0094-9
A branch‐and‐cut algorithm for partition coloring
Yuri Frota, Nelson Maculan, Thiago F. Noronha and Celso C. RibeiroNetworks 55 (3) 194 (2010)
https://doi.org/10.1002/net.20365