Lower bound improvement and forcing rule for quadratic binary programming (Q2506180): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Ellipsoidal approach to box-constrained quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in quadratic 0-1 programming / 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: Quadratic knapsack problems / 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: Q3758559 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Methods of Nonlinear 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to global optimization. / 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: Q3048590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implicit Enumeration Algorithm for Quadratic Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of test problems in quadratic bivalent programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of uniqueness and local search in quadratic 0-1 programming / 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: Convex Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating quadratic programming with bound and quadratic constraints / rank
 
Normal rank

Latest revision as of 20:59, 24 June 2024

scientific article
Language Label Description Also known as
English
Lower bound improvement and forcing rule for quadratic binary programming
scientific article

    Statements

    Lower bound improvement and forcing rule for quadratic binary programming (English)
    0 references
    0 references
    0 references
    0 references
    28 September 2006
    0 references
    0 references
    0 references
    0 references
    0 references
    quadratic binary programming
    0 references
    lower bound
    0 references
    forcing rule
    0 references
    branch and bound algorithm
    0 references
    0 references