A simple and effective algorithm for the maximum happy vertices problem (Q2121620): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Marco Ghirardi / rank
Normal rank
 
Property / author
 
Property / author: Marco Ghirardi / 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/s11750-021-00610-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3167552940 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the parameterized complexity of happy vertex coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Time Algorithms for Happy Vertex Coloring Problems for Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A single machine scheduling problem with two-dimensional vector packing constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variable neighborhood search based matheuristic for nurse rostering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matheuristic approach for the two-machine total completion time flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding happiness: an analysis of the maximum happy vertices problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on vertex coloring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matheuristics for the irregular bin packing problem with free rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects of homophyly of networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for the maximum happy vertices and edges problems / rank
 
Normal rank

Latest revision as of 13:09, 28 July 2024

scientific article
Language Label Description Also known as
English
A simple and effective algorithm for the maximum happy vertices problem
scientific article

    Statements

    A simple and effective algorithm for the maximum happy vertices problem (English)
    0 references
    0 references
    0 references
    0 references
    4 April 2022
    0 references
    happy coloring
    0 references
    matheuristics
    0 references
    local search
    0 references

    Identifiers