A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs (Q1370656): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4331736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: APROS: Algorithmic Development Methodology for Discrete-Continuous Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Binary Programming with Application to Capital-Budgeting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved branch and bound algorithm for mixed integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear integer programming algorithms: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and Bound Experiments in Convex Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs / rank
 
Normal rank

Latest revision as of 19:37, 27 May 2024

scientific article
Language Label Description Also known as
English
A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs
scientific article

    Statements

    A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs (English)
    0 references
    0 references
    0 references
    26 October 1997
    0 references
    0 references
    convex 0-1 mixed integer nonlinear programs
    0 references
    test problems
    0 references
    branch-and-bound
    0 references
    0 references
    0 references