The capacitated max k-cut problem
From MaRDI portal
Publication:930343
DOI10.1007/S10107-007-0139-ZzbMATH Open1145.90058OpenAlexW2004699374MaRDI QIDQ930343FDOQ930343
Ramesh Krishnamurti, Daya Ram Gaur, Rajeev Kohli
Publication date: 30 June 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0139-z
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximation algorithms for maximization problems arising in graph partitioning
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- How easy is local search?
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Stowage planning for container ships to reduce the number of shifts
- Container ship stowage problem complexity and connection to the coloring of circle graphs
- Scheduling Commercials on Broadcast Television
- A .699-approximation algorithm for Max-Bisection.
- Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming
- Approximate Local Search in Combinatorial Optimization
- On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function
- A 0. 5-approximation algorithm for MAX DICUT with given sizes of parts
Cited In (6)
- A VNS metaheuristic with stochastic steps for Max 3-cut and Max 3-section
- A linear time algorithm for the maximum capacity path problem
- Computational study of valid inequalities for the maximum \(k\)-cut problem
- New formulations for the conflict resolution problem in the scheduling of television commercials
- \(p\)-Laplace operators for oriented hypergraphs
- On Integrality in Semidefinite Programming for Discrete Optimization
This page was built for publication: The capacitated max \(k\)-cut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930343)
