Improved mixed integer linear programing formulations for roman domination problem | Zendy

Marija Ivanović | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Improved mixed integer linear programing formulations for roman domination problem

Author(s) -

Marija Ivanović

Publication year - 2016

Publication title -

publications de l institut mathematique

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.246

H-Index - 17

eISSN - 1820-7405

pISSN - 0350-1302

DOI - 10.2298/pim1613051i

Subject(s) - correctness , integer programming , linear programming , integer (computer science) , relaxation (psychology) , linear programming relaxation , mathematical proof , mathematics , mathematical optimization , combinatorics , discrete mathematics , computer science , algorithm , programming language , psychology , social psychology , geometry

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]

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research