Acyclic Orientations with Path Constraints-Reference-Cited by-同舟云学术

Acyclic Orientations with Path Constraints

Published:2008-10 Issue:4 Volume:42 Page:455-467
ISSN:0399-0559
Container-title:RAIRO - Operations Research
language:
Short-container-title:RAIRO-Oper. Res.

Author:

Figueiredo Rosa M. V.,Barbosa Valmir C.,Maculan Nelson,de Souza Cid C.

Publisher

EDP Sciences

Subject

Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science

Link

http://www.rairo-ro.org/10.1051/ro:2008028/pdf

Reference10 articles.

1. K. Aardal, A. Hipolito, C. van Hoesel, B. Jansen, C. Roos, and T. Terlaky,EUCLID CALMA radio link frequency assignment project: A branch-and-cut algorithm for the frequency assignment problem. Technical report, Delft and Eindhoven Universities of Technology, The Netherlands (1995).

2. OPTIMAL ORIENTATIONS OF ANNULAR NETWORKS

3. J. Bermond, M. Di Ianni, M. Flammini, and S. Perennes, Acyclic orientations for deadlock prevention in interconnection networks, inProceedings of the Workshop on Graph-Theoretic Concepts in Computer Science(1997) 52–64.

4. R. Borndörfer, A. Eisenblätter, M. Grötschel, and A. Martin,The orientation model for frequency assignment problems. Technical Report 98-01, Zuse Institute Berlin, Germany (1998).

5. Acyclic orientations of a graph and chromatic and independence numbers

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Symmetry-breaking inequalities for ILP with structured sub-symmetry;Mathematical Programming;2020-03-30

2. Scheduled-Asynchronous Distributed Algorithm for Optimal Power Flow;IEEE Transactions on Control of Network Systems;2019-03

3. Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry;Integer Programming and Combinatorial Optimization;2019

4. A note on orientation and chromatic number of graphs;Journal of Combinatorial Optimization;2016-11-11

5. A branch-and-cut algorithm for partition coloring;Networks;2009