Open AccessTwo lagrangian relaxation based heuristics for vertex coloring problem
Author(s) -
Ali İrfan Mahmutoğulları
Publication year - 2020
Publication title -
cumhuriyet science journal
Language(s) - English
Resource type - Journals
eISSN - 2587-246X
pISSN - 2587-2680
DOI - 10.17776/csj.628518
Subject(s) - heuristics , lagrangian relaxation , relaxation (psychology) , vertex (graph theory) , adjacency list , graph coloring , computer science , upper and lower bounds , mathematical optimization , set (abstract data type) , mathematics , lagrangian , graph , combinatorics , algorithm , psychology , social psychology , mathematical analysis , programming language
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom