A tutorial on branch and cut algorithms for the maximum stable set problem-Reference-Cited by-同舟云学术

A tutorial on branch and cut algorithms for the maximum stable set problem

Published:2012-01 Issue:1-2 Volume:19 Page:161-199
ISSN:0969-6016
Container-title:International Transactions in Operational Research
language:en
Short-container-title:Intl. Trans. in Op. Res.

Author:

Rebennack Steffen¹,Reinelt Gerhard²,Pardalos Panos M.³

Affiliation:

1. Colorado School of Mines; Division of Economics and Business; Golden; CO; USA

2. Ruprecht-Karls-Universität Heidelberg; Discrete Optimization Research Group; Heidelberg; Germany

3. University of Florida; Department of Industrial and Systems Engineering; Gainesville; FL; USA

Publisher

Wiley

Subject

Management of Technology and Innovation,Management Science and Operations Research,Strategy and Management,Computer Science Applications,Business and International Management

Link

http://onlinelibrary.wiley.com/wol1/doi/10.1111/j.1475-3995.2011.00805.x/fullpdf

Reference61 articles.

1. On maximum clique problems in very large graphs

2. TSP cuts which do not conform to the template paradigm;Applegate;Computational Combinatorial Optimization LNCS,2001

3. Probabilistic checking of proofs; a new characterization of NP

4. Resolution branch and bound and an application: the maximum weighted stable set problem;Avenali;Operations Research,2007

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Stable set reformulations for the degree preserving spanning tree problem;European Journal of Operational Research;2024-11

2. Branch-and-cut-and-price algorithm for the constrained-routing and spectrum assignment problem;Journal of Combinatorial Optimization;2024-04-14

3. Parallel Bounded Search for the Maximum Clique Problem;Journal of Computer Science and Technology;2023-09

4. Polyhedral results and stronger Lagrangean bounds for stable spanning trees;Optimization Letters;2022-11-11

5. Exact Solution Algorithms for the Chordless Cycle Problem;INFORMS Journal on Computing;2022-07