ILP models and column generation for the minimum sum coloring problem (Q1742227): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.endm.2018.01.023 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2018.01.023 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2789976508 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57659006 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on the chromatic sum of a connected graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum-weight stable sets and safe lower bounds for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A memetic algorithm for the minimum sum coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary search for the minimum sum coloring problem of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and hybrid simulated annealing heuristics for the parallel-machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Minimal Sum Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on vertex coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Column Generation Approach for Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cost-chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On sum coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a graph partition problem with application to VLSI layout / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new \textsf{DSATUR}-based algorithm for exact vertex coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective heuristic algorithm for sum coloring of graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.ENDM.2018.01.023 / rank
 
Normal rank

Latest revision as of 07:28, 11 December 2024

scientific article
Language Label Description Also known as
English
ILP models and column generation for the minimum sum coloring problem
scientific article

    Statements

    Identifiers