scientific article; zbMATH DE number 5064931

zbMath1129.90047MaRDI QIDQ5494211

Stanislav Busygin, Oleg A. Prokopyev, Panos M. Pardalos

Publication date: 17 October 2006

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

global optimizationsemidefinite programminglinear complementarity problemSteiner problemnon-convex optimizationdiscrete optimizationsatisfiabilityminimax theorymax clique

Mathematics Subject Classification ID

Semidefinite programming (90C22) Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Combinatorial optimization (90C27)

Related Items (17)

New results on the equivalence between zero-one programming and continuous concave programming ⋮ Building an iterative heuristic solver for a quantum annealer ⋮ Manifold relaxations for integer programming ⋮ A gradient-based approach for discrete optimum design ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ An exact penalty function method for nonlinear mixed discrete programming problems ⋮ An exact penalty global optimization approach for mixed-integer programming problems ⋮ Continuous reformulations for zero-one programming problems ⋮ Adaptive randomization in network data ⋮ A new penalty parameter for linearly constrained 0--1 quadratic programming problems ⋮ On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems ⋮ Continuous representations and functional extensions in combinatorial optimization ⋮ Continuous relaxation for discrete DC programming ⋮ A continuous approach to combinatorial optimization: application of water system pump operations ⋮ Exact penalty functions for nonlinear integer programming problems ⋮ Unnamed Item ⋮ Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation

This page was built for publication: