scientific article; zbMATH DE number 956845
From MaRDI portal
Publication:5687252
zbMath0864.90119MaRDI QIDQ5687252
Luana E. Gibbons, Donald W. Hearn, Panos M. Pardalos
Publication date: 11 December 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Combinatorial optimization (90C27) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Discrete location and assignment (90B80)
Related Items
Annealed replication: A new heuristic for the maximum clique problem ⋮ Continuous quadratic programming formulations of optimization problems on graphs ⋮ A General Regularized Continuous Formulation for the Maximum Clique Problem ⋮ On a polynomial fractional formulation for independence number of a graph ⋮ A nonconvex quadratic optimization approach to the maximum edge weight clique problem ⋮ Variable neighborhood search for the maximum clique ⋮ Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers ⋮ A generalization of the Motzkin-Straus theorem to hypergraphs ⋮ Continuous cubic formulations for cluster detection problems in networks ⋮ A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem
