论文信息 - Improved mixed integer linear programing formulations for roman domination problem

Improved mixed integer linear programing formulations for roman domination problem

The Roman domination problem is considered. An improvement of two existing Integer Linear Programing (ILP) formulations is proposed and a comparison between the old and new ones is given. Correctness proofs show that improved linear programing formulations are equivalent to the existing ones regardless of the variables relaxation and usage of lesser number of constraints. [Projekat Ministarstva nauke Republike Srbije, br. TR36006]

Marija Ivanovic

[1] Paul A. Dreyer. APPLICATIONS AND VARIATIONS OF DOMINATION IN GRAPHS , 2000 .

[2] Polona Pavlic,et al. Roman Domination Number of the Cartesian Products of Paths and Cycles , 2012, Electron. J. Comb..

[3] Charles S. Revelle,et al. Defendens Imperium Romanum: A Classical Problem in Military Strategy , 2000, Am. Math. Mon..

[4] Gerard J. Chang,et al. Roman domination on strongly chordal graphs , 2013, J. Comb. Optim..

[5] Mostafa Blidia,et al. Criticality indices of Roman domination of paths and cycles , 2013, Australas. J Comb..

[6] I. Stewart. Defend the Roman Empire , 1999 .

[7] Weiping Shang,et al. The Roman Domination Problem in Unit Disk Graphs , 2007, International Conference on Computational Science.

[8] Ivona Puljić,et al. Some results for Roman domination number on Cardinal product of paths and cycles , 2014 .

[9] Burger Ap,et al. A binary programming approach towards achieving effective graph protection , 2013 .