On characterization of maximal independent sets via quadratic optimization (Q2359154): Difference between revisions

@@ Property / describes a project that uses @@
+DIMACS
@@ Property / describes a project that uses: DIMACS / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10732-011-9171-5
+Normal rank
@@ Property / OpenAlex ID @@
+W1970740332
@@ Property / OpenAlex ID: W1970740332 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding independent sets in a graph using continuous multivariable polynomial formulations.
+Normal rank
@@ Property / cites work @@
+Constructing test functions for global optimization using continuous formulations of graph problems
+Normal rank
@@ Property / cites work @@
+On a polynomial fractional formulation for independence number of a graph
+Normal rank
@@ Property / cites work @@
+Experiments in quadratic 0-1 programming
@@ Property / cites work: Experiments in quadratic 0-1 programming / rank @@
+Normal rank
@@ Property / cites work @@
+Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
+Normal rank
@@ Property / cites work @@
+Evolution towards the maximum clique
@@ Property / cites work: Evolution towards the maximum clique / rank @@
+Normal rank
@@ Property / cites work @@
+Q3145799
@@ Property / cites work: Q3145799 / rank @@
+Normal rank
@@ Property / cites work @@
+The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
+Normal rank
@@ Property / cites work @@
+Pseudo-Boolean optimization
@@ Property / cites work: Pseudo-Boolean optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Global optimality conditions for quadratic \(0-1\) optimization problems
+Normal rank
@@ Property / cites work @@
+Ellipsoidal approach to box-constrained quadratic problems
+Normal rank
@@ Property / cites work @@
+Q4342632
@@ Property / cites work: Q4342632 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4354785
@@ Property / cites work: Q4354785 / rank @@
+Normal rank
@@ Property / cites work @@
+Diversification-driven tabu search for unconstrained binary quadratic problems
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search: Principles and applications
+Normal rank
@@ Property / cites work @@
+Some news about the independence number of a graph
+Normal rank
@@ Property / cites work @@
+Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
+Normal rank
@@ Property / cites work @@
+Lower bound improvement and forcing rule for quadratic binary programming
+Normal rank
@@ Property / cites work @@
+An unconstrained quadratic binary programming approach to the vertex coloring problem
+Normal rank
@@ Property / cites work @@
+Variable neighborhood search
@@ Property / cites work: Variable neighborhood search / rank @@
+Normal rank
@@ Property / cites work @@
+Maxima for Graphs and a New Proof of a Theorem of Turán
+Normal rank
@@ Property / cites work @@
+Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
+Normal rank
@@ Property / cites work @@
+Computational aspects of a branch and bound algorithm for quadratic zero- one programming
+Normal rank
@@ Property / cites work @@
+The maximum clique problem
@@ Property / cites work: The maximum clique problem / rank @@
+Normal rank
@@ Property / cites work @@
+Global equilibrium search applied to the unconstrained binary quadratic optimization problem
+Normal rank
@@ Property / cites work @@
+Q4793326
@@ Property / cites work: Q4793326 / rank @@
+Normal rank