Constructing test functions for global optimization using continuous formulations of graph problems
From MaRDI portal
Publication:5717533
DOI10.1080/10556780500139641zbMath1134.90044OpenAlexW2014381425MaRDI QIDQ5717533
Balabhaskar Balasundaram, Sergiy I. Butenko
Publication date: 10 January 2006
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500139641
Programming involving graphs or networks (90C35) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10)
Related Items (9)
On characterization of maximal independent sets via quadratic optimization ⋮ New results on the equivalence between zero-one programming and continuous concave programming ⋮ An exact penalty global optimization approach for mixed-integer programming problems ⋮ Continuous reformulations for zero-one programming problems ⋮ On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems ⋮ On a polynomial fractional formulation for independence number of a graph ⋮ Global optimization test problems based on random field composition ⋮ Exact penalty functions for nonlinear integer programming problems ⋮ Continuous cubic formulations for cluster detection problems in networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Test examples for nonlinear programming codes
- Dual quadratic estimates in polynomial and Boolean programming
- Handbook of test problems in local and global optimization
- Global optimization by multilevel coordinate search
- Test case generators and computational results for the maximum clique problem
- A new technique for generating quadratic programming test problems
- A probabilistic lower bound on the independence number of graphs
- Evolution towards the maximum clique
- Ellipsoidal approach to box-constrained quadratic problems
- A lower bound on the independence number of a graph
- A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere
- Generation of disjointly constrained bilinear programming test problems
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- Testing Unconstrained Optimization Software
- Improved lower bounds on k‐independence
- TSPLIB—A Traveling Salesman Problem Library
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Randomized heuristics for the Max-Cut problem
- Some news about the independence number of a graph
- Graph Partitioning and Continuous Quadratic Programming
- On Dominating Sets and Independent Sets of Graphs
- Maxima for Graphs and a New Proof of a Theorem of Turán
- Algorithm 829
- Geometry of cuts and metrics
- On cliques in graphs
- Introduction to global optimization.
- On the chromatic number of graphs
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
- Comments on: Optimization and data mining in biomedicine
This page was built for publication: Constructing test functions for global optimization using continuous formulations of graph problems
