Polyhedral studies for minimum-span graph labelling with integer distance constraints-Reference-Cited by-同舟云学术

Polyhedral studies for minimum-span graph labelling with integer distance constraints

Published:2007-03 Issue:2 Volume:14 Page:105-121
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Int Trans Operational Res

Author:

Mak Vicky

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/j.1475-3995.2007.00577.x/fullpdf

Reference25 articles.

1. K.I. Aardal, A. Hipolito, S.P.M. Van Hoesel, and B. Jansen , 1996 . A branch-and-cut algorithm for frequency assignment problem, http://www-edocs.unimaas.nl/index/FDEWB.METEOR.Hoesel.titels.htm.

2. K.I. Aardal, S.P.M. Van Hoesel, A.M.C.A. Koster, C. Mannino, and A. Sassano , 2001 . Models and solution techniques for frequency assignment problems. ZIB-Report 0140 Konrad-Zuse-Zentrum fur Informationstechnik Berlin.

3. Generation of lower bounds for minimum span frequency assignment

4. Minimizing the span of d -walks to compute optimum frequency assignments

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

1. Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem;RAIRO - Operations Research;2021

2. The Distance Polytope for the Vertex Coloring Problem;Lecture Notes in Computer Science;2018

3. Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model;Electronic Notes in Discrete Mathematics;2017-11

4. A Quick Practical Guide to Polyhedral Analysis in Integer Programming;Lecture Notes in Management and Industrial Engineering;2017-07-28