Disjunctive Cuts for Nonconvex MINLP (Q2897296)

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Disjunctive Cuts for Nonconvex MINLP (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-1-4614-1927-3_5

0 references

0 references

Mixed Integer Nonlinear Programming

0 references

publication date

10 July 2012

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

zbMATH Keywords

disjunctions

0 references

MINLP

0 references

couenne

0 references

disjunctive cuts

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-1-4614-1927-3_5

0 references

0 references

Branching rules revisited

0 references

Split closure and intersection cuts

0 references

Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming

0 references

0 references

Disjunctive programming: Properties of the convex hull of feasible points

0 references

New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing

0 references

A lift-and-project cutting plane algorithm for mixed 0-1 programs

0 references

Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework

0 references

A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming

0 references

Optimizing over the split closure

0 references

Branching and bounds tighteningtechniques for non-convex MINLP

0 references

Experiments in mixed-integer linear programming

0 references

Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound

0 references

MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming

0 references

On the separation of split cuts and related inequalities

0 references

Cuts for mixed 0-1 conic programming

0 references

0 references

Chvátal closures for mixed integer programming problems

0 references

Benchmarking optimization software with performance profiles.

0 references

0 references

Perspective cuts for a class of convex 0-1 mixed integer programs

0 references

0 references

Solving quadratic (0,1)-problems by semidefinite programs and cutting planes

0 references

0 references

There Cannot be any Algorithm for Integer Programming with Quadratic Constraints

0 references

A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints

0 references

Solving planning and design problems in the process industry using mixed integer and global optimization

0 references

0 references

A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem

0 references

Reformulation in mathematical programming: An application to quantum chemistry

0 references

Convex envelopes of monomials of odd degree

0 references

0 references

Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

0 references

0 references

A disjunctive cutting plane procedure for general mixed-integer linear programs

0 references

0 references

Bounds for the quadratic assignment problem using the bundle method

0 references

BARON: A general purpose global optimization software package

0 references

Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs

0 references

Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations

0 references

Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity

0 references

A branch-and-cut method for 0-1 mixed convex programming

0 references

Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications

0 references

Global optimization of mixed-integer nonlinear programs: a theoretical and computational study

0 references

A branch-and-cut algorithm for nonconvex quadratic programs with box constraints

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2897296

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2897296&oldid=35288555"