Min-max relations and combinatorial algorithms
Abstract
- Min-max relations and combinatorial algorithms
Recommendations
Quadratic Combinatorial Optimization Using Separable Underestimators
Binary programs with a quadratic objective function are NP-hard in general, even if the linear optimization problem over the same feasible set is tractable. In this paper, we address such problems by computing quadratic global underestimators of the ...
Solving Max-Cut to optimality by intersecting semidefinite and polyhedral relaxations
We present a method for finding exact solutions of Max-Cut, the problem of finding a cut of maximum weight in a weighted graph. We use a Branch-and-Bound setting that applies a dynamic version of the bundle method as bounding procedure. This approach ...
On relaxations of the max k-cut problem formulations
AbstractA tight continuous relaxation is a crucial factor in solving mixed integer formulations of many NP-hard combinatorial optimization problems. The (weighted) max k-cut problem is a fundamental combinatorial optimization problem with multiple ...
Highlights- A review of existing formulations of the max k-cut problem.
- Theoretical comparisons between the continuous relaxation of the max k-cut models.
- A set of computational experiments that corroborate our theoretical results.
Comments
Information & Contributors
Information
Published In
Sponsors
- AFIPS: American Federation of Information Processing Societies
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0