Disjunctive Cuts for Nonconvex MINLP (Q2897296): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: BARON / 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.1007/978-1-4614-1927-3_5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W138692475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching rules revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Split closure and intersection cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjunctive programming: Properties of the convex hull of feasible points / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing / 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: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimizing over the split closure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branching and bounds tighteningtechniques for non-convex MINLP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experiments in mixed-integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound / 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: On the separation of split cuts and related inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cuts for mixed 0-1 conic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4778692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal closures 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: Q3394516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspective cuts for a class of convex 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4889854 / 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: A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving planning and design problems in the process industry using mixed integer and global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation in mathematical programming: An application to quantum chemistry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex envelopes of monomials of odd degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3207999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A disjunctive cutting plane procedure for general mixed-integer linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4833815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the quadratic assignment problem using the bundle method / 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: Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity / 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: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications / 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: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:26, 5 July 2024

scientific article
Language Label Description Also known as
English
Disjunctive Cuts for Nonconvex MINLP
scientific article

    Statements

    Disjunctive Cuts for Nonconvex MINLP (English)
    0 references
    0 references
    10 July 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    disjunctions
    0 references
    MINLP
    0 references
    couenne
    0 references
    disjunctive cuts
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references