Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (Q3503837)

From MaRDI portal

Revision as of 10:33, 28 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs	scientific article

Statements

scholarly article

0 references

Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs (English)

0 references

0 references

0 references

0 references

Integer Programming and Combinatorial Optimization

0 references

publication date

10 June 2008

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-68891-4_2

0 references

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

0 references

Disjunctive programming: Properties of the convex hull of feasible points

0 references

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

0 references

An algorithmic framework for convex mixed integer nonlinear programs

0 references

A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations

0 references

Revival of the Gomory cuts in the 1990's

0 references

Optimizing over the First Chvàtal Closure

0 references

There Cannot be any Algorithm for Integer Programming with Quadratic Constraints

0 references

Second order cone programming relaxation of nonconvex quadratic optimization problems

0 references

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

0 references

Global Optimization and Constraint Satisfaction

0 references

Relaxation and decomposition methods for mixed integer nonlinear programming.

0 references

MIP reformulations of the probabilistic set covering problem

0 references

Relaxations for probabilistically constrained programs with discrete random variables

0 references

Enhancing RLT relaxations via a new class of semidefinite cuts

0 references

Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

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 polyhedral study of nonconvex quadratic programs with box constraints

0 references

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

0 references

On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-68891-4_2

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3503837

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