A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming (Q2788727): Difference between revisions

Latest revision as of 10:57, 11 July 2024

scientific article

Language	Label	Description	Also known as
English	A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming	scientific article

Statements

instance of

scholarly article

0 references

title

A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming (English)

0 references

author

Carlos J. Luz

0 references

published in

Discrete Mathematics, Algorithms and Applications

0 references

publication date

22 February 2016

0 references

zbMATH Keywords

Lovász number

0 references

McEliece-Rodemich-Rumsey-Schrijver number

0 references

maximum weight stable set

0 references

combinatorial optimization

0 references

quadratic programming

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Finding independent sets in a graph using continuous multivariable polynomial formulations.

0 references

Q3145799

0 references

A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs

0 references

Approximation of the Stability Number of a Graph via Copositive Programming

0 references

Relaxations of vertex packing

0 references

Geometric algorithms and combinatorial optimization

0 references

Cones of Matrices and Set-Functions and 0–1 Optimization

0 references

An upper bound on the independence number of a graph computable in polynomial-time

0 references

A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph

0 references

A quadratic programming approach to the determination of an upper bound on the weighted stability number

0 references

A Convex Quadratic Characterization of the Lovász Theta Number

0 references

Q4194987

0 references

Maxima for Graphs and a New Proof of a Theorem of Turán

0 references

A comparison of the Delsarte and Lovász bounds

0 references

A review on algorithms for maximum clique problems

0 references

Identifiers

zbMATH Open document ID

1331.05145

0 references

DOI

10.1142/S1793830915500500

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2788727

@@ Property / cites work @@
+Finding independent sets in a graph using continuous multivariable polynomial formulations.
+Normal rank
@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs
+Normal rank
@@ Property / cites work @@
+Approximation of the Stability Number of a Graph via Copositive Programming
+Normal rank
@@ Property / cites work @@
+Relaxations of vertex packing
@@ Property / cites work: Relaxations of vertex packing / rank @@
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+An upper bound on the independence number of a graph computable in polynomial-time
+Normal rank
@@ Property / cites work @@
+A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
+Normal rank
@@ Property / cites work @@
+A quadratic programming approach to the determination of an upper bound on the weighted stability number
+Normal rank
@@ Property / cites work @@
+A Convex Quadratic Characterization of the Lovász Theta Number
+Normal rank
@@ Property / cites work @@
+Q4194987
@@ Property / cites work: Q4194987 / rank @@
+Normal rank
@@ Property / cites work @@
+Maxima for Graphs and a New Proof of a Theorem of Turán
+Normal rank
@@ Property / cites work @@
+A comparison of the Delsarte and Lovász bounds
@@ Property / cites work: A comparison of the Delsarte and Lovász bounds / rank @@
+Normal rank
@@ Property / cites work @@
+A review on algorithms for maximum clique problems
+Normal rank