scientific article; zbMATH DE number 1552036
From MaRDI portal
Publication:4524243
zbMath1052.90600MaRDI QIDQ4524243
Publication date: 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
global optimizationsemidefinite programmingSteiner problemquadratic assignmentinterior point algorithmssatisfiabilityminimax theorygraph problemsmax clique
Semidefinite programming (90C22) Minimax problems in mathematical programming (90C47) Interior-point methods (90C51) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (10)
Annealed replication: A new heuristic for the maximum clique problem ⋮ An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions ⋮ A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems ⋮ A game-theoretic algorithm for non-linear single-path routing problems ⋮ On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date ⋮ An exact penalty function method for nonlinear mixed discrete programming problems ⋮ A new penalty parameter for linearly constrained 0--1 quadratic programming problems ⋮ Penalty parameter for linearly constrained 0--1 quadratic programming ⋮ A discrete dynamic convexized method for nonlinear integer programming ⋮ An algorithm for nonlinear optimization problems with binary variables
This page was built for publication:
