The maximum saving partition problem
From MaRDI portal
Publication:1779697
DOI10.1016/J.ORL.2004.07.007zbMATH Open1274.90312OpenAlexW2093134385MaRDI QIDQ1779697FDOQ1779697
Authors: Refael Hassin, Jérôme Monnot 
Publication date: 1 June 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.07.007
Recommendations
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Cites Work
- Approximation results for the minimum graph coloring problem
- \(z\)-approximations
- Graph colorings with local constraints -- a survey
- On chromatic sums and distributed resource allocation
- Bridging gap between standard and differential polynomial approximation: The case of bin-packing
- Title not available (Why is that?)
- Scheduling with incompatible jobs
- Title not available (Why is that?)
- Maximizing the number of unused colors in the vertex coloring problem
- Approximation Results for the Optimum Cost Chromatic Partition Problem
- Chromatic scheduling and frequency assignment
- Three-quarter approximation for the number of unused colors in graph coloring
- A hypocoloring model for batch scheduling
Cited In (8)
- Theoretical Aspects of Computing – ICTAC 2005
- A better differential approximation ratio for symmetric TSP
- Saving colors and max coloring: some fixed-parameter tractability results
- New differential approximation algorithm for \(k\)-customer vehicle routing problem
- A survey on the structure of approximation classes
- Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
- On the differential approximation of MIN SET COVER
- Saving colors and max coloring: some fixed-parameter tractability results
This page was built for publication: The maximum saving partition problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779697)
