ON GROTSCHEL-LOVASZ-SCHRIJVER'S RELAXATION OF STABLE SET POLYTOPES
From MaRDI portal
Publication:4797033
DOI10.15807/jorsj.45.285zbMath1140.90514OpenAlexW96673193MaRDI QIDQ4797033
Publication date: 20 May 2003
Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.15807/jorsj.45.285
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (2)
Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms ⋮ A New Approach to the Stable Set Problem Based on Ellipsoids
This page was built for publication: ON GROTSCHEL-LOVASZ-SCHRIJVER'S RELAXATION OF STABLE SET POLYTOPES