Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Experiments in mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712822 / 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: MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree-search algorithm for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarking optimization software with performance profiles. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An outer-approximation algorithm for a class of mixed-integer nonlinear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Experience with Lower Bounds for MIQP Branch-And-Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear programming without a penalty function. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2724100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approach to the Optimal Positioning of a New Product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739659 / 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: Different transformations for solving non-convex trim-loss problems by MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating SQP and branch-and-bound for mixed integer nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: BARON: A general purpose global optimization software package / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sequential cutting plane algorithm for solving convex NLP problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving pseudo-convex mixed integer optimization problems by cutting plane techniques / rank
 
Normal rank

Revision as of 20:00, 24 June 2024

scientific article
Language Label Description Also known as
English
Solving convex MINLP optimization problems using a sequential cutting plane algorithm
scientific article

    Statements

    Solving convex MINLP optimization problems using a sequential cutting plane algorithm (English)
    0 references
    0 references
    0 references
    28 September 2006
    0 references
    convex programming
    0 references
    branch and bound
    0 references
    cutting plane algorithms
    0 references
    mixed integer nonlinear programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers