Search Results - subject:"Stable set problem"

Exactness of parrilo's conic approximations for copositive matrices and associated low order bounds for the stability number of a graph

Laurent, Monique; Vargas, Luis Felipe - In: Mathematics of operations research 48 (2023) 2, pp. 1017-1043

Persistent link: https://www.econbiz.de/10014314973

Optimizing over the closure of rank inequalities with a small right-hand side for the maximum stable set problem via bilevel programming

Coniglio, Stefano; Gualandi, Stefano - In: INFORMS journal on computing : JOC ; charting new … 34 (2022) 2, pp. 1006-1023

Persistent link: https://www.econbiz.de/10013361401

Strengthened clique-family inequalities for the stable set polytope

Letchford, Adam N.; Ventura, Paolo - In: Operations research letters 49 (2021) 4, pp. 586-589

Persistent link: https://www.econbiz.de/10012649044

The stable set problem : clique and nodal inequalities revisited

Letchford, Adam N.; Rossi, Fabrizio; Smriglio, Stefano - In: Computers & operations research : and their … 123 (2020), pp. 1-16

Persistent link: https://www.econbiz.de/10012286300

Theoretical and computational study of several linearisation techniques for binary quadratic problems

Furini, Fabio; Traversi, Emiliano - 2019

Persistent link: https://www.econbiz.de/10012109562

A branch-and-bound algorithm for the knapsack problem with conflict graph

Bettinelli, Andrea; Cacchiani, Valentina; Malaguti, Enrico - In: INFORMS journal on computing : JOC 29 (2017) 3, pp. 457-473

Persistent link: https://www.econbiz.de/10011743447

Handelman’s hierarchy for the maximum stable set problem

Laurent, Monique; Sun, Zhao - In: Journal of Global Optimization 60 (2014) 3, pp. 393-423

The maximum stable set problem is a well-known NP-hard problem in combinatorial optimization, which can be formulated …

Persistent link: https://www.econbiz.de/10010938216

The 0-1 inverse maximum stable set problem

Chung, Yerim; Demange, Marc - HAL - 2006

approximation results of the 0-1 inverse maximum stable set problem against the algorithms. Greedy and 2-opt. Secondly, we identify … classes of graphs for which the 0-1 inverse maximum stable set problem can be polynomially solvable. We prove the tractability … that the fixed solution becomes optimal in the new instance. In this paper, we consider the 0-1 inverse maximum stable set …

Persistent link: https://www.econbiz.de/10010750736

The 0-1 inverse maximum stable set problem.

Chung, Yerim; Demange, Marc - Maison des Sciences Économiques, Université Paris 1 … - 2006

approximation results of the 0-1 inverse maximum stable set problem against the algorithms Greedy and 2-opt. Secondly, we identify … classes of graphs for which the 0-1 inverse maximum stable set problem can be polynomially solvable. We prove the tractability … that the fixed solution becomes optimal in the new instance. In this paper, we consider the 0-1 inverse maximum stable set …

Persistent link: https://www.econbiz.de/10005797812

Handelman rank of zero-diagonal quadratic programs over a hypercube and its applications

Park, Myoung-Ju; Hong, Sung-Pil - In: Journal of Global Optimization 56 (2013) 2, pp. 727-736

It has been observed that the Handelman’s certificate of positivity of a polynomial over a compact polyhedron offers a hierarchical relaxation scheme for polynomial programs. The Handelman hierarchy seems particularly suitable for a class of combinatorial optimizations that are formulated as a...

Persistent link: https://www.econbiz.de/10010896415