Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem (Q2011610): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Gecode / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SATzilla / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Choco / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: llama / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-59776-8_29 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2618773733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3457209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm portfolios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid backtracking bounded by tree-decomposition of constraint networks / 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: A memetic algorithm for the minimum sum coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Colorings / 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: Graph minors. II. Algorithmic aspects of tree-width / 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: An effective heuristic algorithm for sum coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624141 / rank
 
Normal rank

Latest revision as of 05:03, 14 July 2024

scientific article
Language Label Description Also known as
English
Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem
scientific article

    Statements

    Identifiers