scientific article; zbMATH DE number 653034

zbMath0821.90118MaRDI QIDQ4308909

Panos M. Pardalos

Publication date: 12 October 1994

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

zbMATH Keywords

partitioningNP-hardpotential reduction algorithminterior point approachesnonconvex linear complementarity problems

Mathematics Subject Classification ID

Integer programming (90C10) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items (11)

A Penalty Branch-and-Bound Method for Mixed Binary Linear Complementarity Problems ⋮ Two-Step Modulus-Based Synchronous Multisplitting Iteration Methods for Nonlinear Complementarity Problems ⋮ On equivalent reformulations for absolute value equations ⋮ On solving linear complementarity problems by DC programming and DCA ⋮ Enumeration-based approach to solving parametric linear complementarity problems ⋮ On linear programs with linear complementarity constraints ⋮ A note on absolute value equations ⋮ A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem ⋮ Inexact non-interior continuation method for monotone semidefinite complementarity problems ⋮ Generalized vector implicit quasi complementarity problems ⋮ Enhanced intersection cutting-plane approach for linear complementarity problems

This page was built for publication: