Rankings
Publications
Search Publications
Cited-by Search
Sources
Publishers
Scholars
Scholars
Top Cited Scholars
Organizations
About
Scilit
About Us
Advisory Board
Data Sources
Career
Support / Contact
User Guide
Publisher User
Search Function
Rankings Function
API Resource
Scilit Knowledge
Metrics
Scilit Recognitions
Publications Classification
Media
News
Blog
Login
Register
Home
Publications
The stable set problem and the lift-and-project ranks of graphs
Home
Publications
The stable set problem and the lift-and-project ranks of graphs
The stable set problem and the lift-and-project ranks of graphs
Authors:
LL
László Lipták
László Lipták
LT
Levent Tunçel
Levent Tunçel
Article Alert
Citation Alert
Add to Library
Cite
Download
Share
Download
Download PDF
Download
Publisher website
Google Scholar
1 September 2003
journal article
Published by
Springer Nature
in
Mathematical Programming
Vol. 98
(1-3)
,
319-353
DOI:
10.1007/s10107-003-0407-5
Abstract
No abstract available
Keywords
STABLE SET PROBLEM
LIFT-AND-PROJECT
SEMIDEFINITE LIFTING
SEMIDEFINITE PROGRAMMING
INTEGER PROGRAMMING
Cited
Cited by 51 articles
Scroll to top