A characterization of the weighted Lovász number based on convex quadratic programming

Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/15345

Full metadata record

DC Field	Value	Language
dc.contributor.author	Luz, Carlos J.	pt
dc.date.accessioned	2016-03-21T16:14:30Z	-
dc.date.issued	2016-01	-
dc.identifier.issn	1862-4472	pt
dc.identifier.uri	http://hdl.handle.net/10773/15345	-
dc.description.abstract	Luz and Schrijver (SIAM J Discrete Math 19(2):382–387, 2005) introduced a characterization of the Lovász number based on convex quadratic programming. This characterization is now extended to the weighted version of that number. In consequence, a class of graphs for which the weighted Lovász number coincides with the weighted stability number is characterized. Several examples of graphs of this class are presented.	pt
dc.language.iso	eng	pt
dc.publisher	Springer	pt
dc.relation	FCT - UID/MAT/04106/2013	pt
dc.rights	restrictedAccess	por
dc.subject	Weighted Lovász number	pt
dc.subject	Maximum weight stable set	pt
dc.subject	Combinatorial optimization	pt
dc.subject	Graph theory	pt
dc.subject	Quadratic programming	pt
dc.title	A characterization of the weighted Lovász number based on convex quadratic programming	pt
dc.type	article	pt
dc.peerreviewed	yes	pt
ua.distribution	international	pt
degois.publication.firstPage	19	pt
degois.publication.issue	1	pt
degois.publication.lastPage	31	pt
degois.publication.title	Optimization Letters	pt
degois.publication.volume	10	pt
dc.date.embargo	10000-01-01	-
dc.identifier.doi	10.1007/s11590-015-0911-6	pt
Appears in Collections:	CIDMA - Artigos OGTCG - Artigos

Files in This Item:

File	Description	Size	Format
10.1007_s11590-015-0911-6.pdf	pdf	763.01 kB	Adobe PDF