Constructing test functions for global optimization using continuous formulations of graph problems (Q5717533): Difference between revisions

Latest revision as of 14:57, 11 June 2024

scientific article; zbMATH DE number 2244914

Language	Label	Description	Also known as
English	Constructing test functions for global optimization using continuous formulations of graph problems	scientific article; zbMATH DE number 2244914

Statements

instance of

scholarly article

0 references

title

Constructing test functions for global optimization using continuous formulations of graph problems (English)

0 references

zbMATH Open document ID

1134.90044

0 references

DOI

10.1080/10556780500139641

0 references

author

Balabhaskar Balasundaram

0 references

Sergiy I. Butenko

0 references

published in

Optimization Methods and Software

0 references

publication date

10 January 2006

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

maximum independent set

0 references

maximum clique

0 references

MAX CUT

0 references

constrained global optimization

0 references

test problems

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1080/10556780500139641

0 references

0 references

0 references

Testing Unconstrained Optimization Software

0 references

Q4068464

0 references

Test examples for nonlinear programming codes

0 references

Handbook of test problems in local and global optimization

0 references

Generation of disjointly constrained bilinear programming test problems

0 references

A new technique for generating quadratic programming test problems

0 references

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

0 references

Algorithm 829

0 references

Q4198056

0 references

Geometry of cuts and metrics

0 references

Randomized heuristics for the Max-Cut problem

0 references

Graph Partitioning and Continuous Quadratic Programming

0 references

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

0 references

Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs

0 references

A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere

0 references

Ellipsoidal approach to box-constrained quadratic problems

0 references

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

0 references

A lower bound on the independence number of a graph

0 references

Some news about the independence number of a graph

0 references

On Dominating Sets and Independent Sets of Graphs

0 references

Evolution towards the maximum clique

0 references

On cliques in graphs

0 references

Improved lower bounds on <i>k</i>‐independence

0 references

A probabilistic lower bound on the independence number of graphs

0 references

Global optimization by multilevel coordinate search

0 references

Test case generators and computational results for the maximum clique problem

0 references

Comments on: Optimization and data mining in biomedicine

0 references

TSPLIB—A Traveling Salesman Problem Library

0 references

Introduction to global optimization.

0 references

Dual quadratic estimates in polynomial and Boolean programming

0 references

On the chromatic number of graphs

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5717533

@@ Property / describes a project that uses @@
+minpack
@@ Property / describes a project that uses: minpack / 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.1080/10556780500139641
+Normal rank
@@ Property / OpenAlex ID @@
+W2014381425
@@ Property / OpenAlex ID: W2014381425 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4788645
@@ Property / cites work: Q4788645 / rank @@
+Normal rank
@@ Property / cites work @@
+Testing Unconstrained Optimization Software
@@ Property / cites work: Testing Unconstrained Optimization Software / rank @@
+Normal rank
@@ Property / cites work @@
+Q4068464
@@ Property / cites work: Q4068464 / rank @@
+Normal rank
@@ Property / cites work @@
+Test examples for nonlinear programming codes
@@ Property / cites work: Test examples for nonlinear programming codes / rank @@
+Normal rank
@@ Property / cites work @@
+Handbook of test problems in local and global optimization
+Normal rank
@@ Property / cites work @@
+Generation of disjointly constrained bilinear programming test problems
+Normal rank
@@ Property / cites work @@
+A new technique for generating quadratic programming test problems
+Normal rank
@@ Property / cites work @@
+Maxima for Graphs and a New Proof of a Theorem of Turán
+Normal rank
@@ Property / cites work @@
+Algorithm 829
@@ Property / cites work: Algorithm 829 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Geometry of cuts and metrics
@@ Property / cites work: Geometry of cuts and metrics / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized heuristics for the Max-Cut problem
@@ Property / cites work: Randomized heuristics for the Max-Cut problem / rank @@
+Normal rank
@@ Property / cites work @@
+Graph Partitioning and Continuous Quadratic Programming
+Normal rank
@@ Property / cites work @@
+Finding independent sets in a graph using continuous multivariable polynomial formulations.
+Normal rank
@@ Property / cites work @@
+Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
+Normal rank
@@ Property / cites work @@
+A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
+Normal rank
@@ Property / cites work @@
+Ellipsoidal approach to box-constrained quadratic problems
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+A lower bound on the independence number of a graph
+Normal rank
@@ Property / cites work @@
+Some news about the independence number of a graph
+Normal rank
@@ Property / cites work @@
+On Dominating Sets and Independent Sets of Graphs
@@ Property / cites work: On Dominating Sets and Independent Sets of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Evolution towards the maximum clique
@@ Property / cites work: Evolution towards the maximum clique / rank @@
+Normal rank
@@ Property / cites work @@
+On cliques in graphs
@@ Property / cites work: On cliques in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Improved lower bounds on <i>k</i>‐independence
@@ Property / cites work: Improved lower bounds on <i>k</i>‐independence / rank @@
+Normal rank
@@ Property / cites work @@
+A probabilistic lower bound on the independence number of graphs
+Normal rank
@@ Property / cites work @@
+Global optimization by multilevel coordinate search
+Normal rank
@@ Property / cites work @@
+Test case generators and computational results for the maximum clique problem
+Normal rank
@@ Property / cites work @@
+Comments on: Optimization and data mining in biomedicine
+Normal rank
@@ Property / cites work @@
+TSPLIB—A Traveling Salesman Problem Library
@@ Property / cites work: TSPLIB—A Traveling Salesman Problem Library / rank @@
+Normal rank
@@ Property / cites work @@
+Introduction to global optimization.
@@ Property / cites work: Introduction to global optimization. / rank @@
+Normal rank
@@ Property / cites work @@
+Dual quadratic estimates in polynomial and Boolean programming
+Normal rank
@@ Property / cites work @@
+On the chromatic number of graphs
@@ Property / cites work: On the chromatic number of graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5717533