An algorithmic framework for convex mixed integer nonlinear programs (Q951092): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: filterSQP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Bonmin / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Ipopt / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MIPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: COIN-OR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: DICOPT / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2006.10.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2170213261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in mixed-integer linear programming / 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: Solving mixed integer nonlinear programs by outer approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Review of nonlinear mixed-integer and disjunctive programming techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized convex disjunctive programming: Nonlinear convex hull relaxation / 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: Computational combinatorial optimization. Optimal of probably near-optimal solutions / 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: A Computational Study of Search Strategies for Mixed Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut method for 0-1 mixed convex programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4254875 / rank
 
Normal rank

Latest revision as of 18:21, 28 June 2024

scientific article
Language Label Description Also known as
English
An algorithmic framework for convex mixed integer nonlinear programs
scientific article

    Statements

    An algorithmic framework for convex mixed integer nonlinear programs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    29 October 2008
    0 references
    branch-and-bound
    0 references
    outer-approximation
    0 references
    open-source
    0 references
    MINLP test problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers