An efficient branch and bound algorithm to solve the quadratic integer programming problem (Q1169260): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5648149 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Verfahren znr lösung ganzzahliger nichtlinearer optimierungsprobleme / rank
 
Normal rank
Property / cites work
 
Property / cites work: There Cannot be any Algorithm for Integer Programming with Quadratic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ein Branch-and-Bound-Verfahren-Generator. (A branch-and-bound method generator) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4118986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5584922 / rank
 
Normal rank

Latest revision as of 16:52, 13 June 2024

scientific article
Language Label Description Also known as
English
An efficient branch and bound algorithm to solve the quadratic integer programming problem
scientific article

    Statements

    An efficient branch and bound algorithm to solve the quadratic integer programming problem (English)
    0 references
    0 references
    0 references
    1983
    0 references
    integer quadratic programming
    0 references
    branch and bound
    0 references
    numerical tests
    0 references

    Identifiers