A filled function method for quadratic programs with binary constraints† (Q5193139): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lagrangian smoothing heuristics for Max-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A filled function method for finding a global minimizer of a function of several variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of filled functions for finding global minimizers of a function of several variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new filled function method for nonlinear integer programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Miniaturized'' linearizations for quadratic 0/1 problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete filled function method for discrete global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization techniques for solving the general quadratic integer programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimality conditions for mixed nonconvex quadratic programs† / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate algorithm for nonlinear integer programming / rank
 
Normal rank

Latest revision as of 20:36, 1 July 2024

scientific article; zbMATH DE number 5593465
Language Label Description Also known as
English
A filled function method for quadratic programs with binary constraints†
scientific article; zbMATH DE number 5593465

    Statements

    A filled function method for quadratic programs with binary constraints† (English)
    0 references
    0 references
    11 August 2009
    0 references
    quadratic programs
    0 references
    binary constraints
    0 references
    filled function method
    0 references
    global optimization
    0 references
    global optimality conditions
    0 references
    0 references
    0 references
    0 references

    Identifiers