A simple and effective algorithm for the maximum happy vertices problem
From MaRDI portal
Publication:2121620
DOI10.1007/s11750-021-00610-4zbMath1490.90246OpenAlexW3167552940MaRDI QIDQ2121620
Publication date: 4 April 2022
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-021-00610-4
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Cites Work
- A single machine scheduling problem with two-dimensional vector packing constraints
- Construct, Merge, Solve \& Adapt A new general algorithm for combinatorial optimization
- A variable neighborhood search based matheuristic for nurse rostering problems
- Algorithmic aspects of homophyly of networks
- Two-level decomposition-based matheuristic for airline crew rostering problems with fair working time
- A matheuristic approach for the two-machine total completion time flow shop problem
- Finding happiness: an analysis of the maximum happy vertices problem
- On the parameterized complexity of happy vertex coloring
- An energy-efficient green-vehicle routing problem with mixed vehicle fleet, partial battery recharging and time windows
- Improved approximation algorithms for the maximum happy vertices and edges problems
- Matheuristics for the irregular bin packing problem with free rotations
- Models and matheuristics for the unrelated parallel machine scheduling problem with additional resources
- Formulation and a two-phase matheuristic for the roaming salesman problem: application to election logistics
- Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
- A survey on vertex coloring problems
This page was built for publication: A simple and effective algorithm for the maximum happy vertices problem
