Galli, Laura and Kaparis, Konstantinos and Letchford, Adam (2012) Gap inequalities for the max-cut problem: a cutting-plane algorithm. In: Combinatorial Optimization. Lecture Notes in Computer Science . Springer, Berlin, pp. 178-188. ISBN 978-3-642-32146-7
Full text not available from this repository.Abstract
Laurent & Poljak introduced a class of valid inequalities for the max-cut problem, called gap inequalities, which include many other known inequalities as special cases. The gap inequalities have received little attention and are poorly understood. This paper presents the first ever computational results. In particular, we describe a cutting-plane scheme based on an effective heuristic separation algorithm for gap inequalities, and show that these yield extremely strong upper bounds in practice.
| Item Type: | Contribution in Book/Report/Proceedings |
|---|---|
| Uncontrolled Keywords: | combinatorial optimisation ; max-cut problem |
| Subjects: | H Social Sciences > HB Economic Theory |
| Departments: | Lancaster University Management School > Management Science |
| ID Code: | 52430 |
| Deposited By: | ep_importer_pure |
| Deposited On: | 31 Jan 2012 11:48 |
| Refereed?: | No |
| Published?: | Published |
| Last Modified: | 26 Jul 2012 23:13 |
| Identification Number: | |
| URI: | http://eprints.lancs.ac.uk/id/eprint/52430 |
Actions (login required)
| View Item |
