A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998): Difference between revisions

Latest revision as of 17:30, 1 July 2024

scientific article

Language	Label	Description	Also known as
English	A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions	scientific article

Statements

instance of

scholarly article

0 references

title

A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (English)

0 references

zbMATH Open document ID

1176.90430

0 references

DOI

10.1016/j.dam.2008.03.041

0 references

0 references

0 references

Discrete Applied Mathematics

0 references

publication date

23 June 2009

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

reformulation-linearization technique

0 references

RLT

0 references

semi-infinite programs

0 references

convex discrete programs

0 references

mixed 0-1 programs

0 references

mixed-discrete programs

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.dam.2008.03.041

0 references

OpenAlex ID

W2084796008

0 references

cites work

A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems

0 references

A branch and cut algorithm for nonconvex quadratically constrained quadratic programming

0 references

Q4120330

0 references

Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems

0 references

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

0 references

Nonlinear Programming

0 references

Matrix Analysis

0 references

An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms

0 references

Cones of Matrices and Set-Functions and 0–1 Optimization

0 references

A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems

0 references

A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems

0 references

A reformulation-linearization technique for solving discrete and continuous nonconvex problems

0 references

Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems

0 references

Enhancing RLT relaxations via a new class of semidefinite cuts

0 references

Optimization with disjunctive constraints

0 references

On the generation of deep disjunctive cutting planes

0 references

Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations

0 references

A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique

0 references

Global optimization of nonconvex factorable programming problems

0 references

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

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1025998

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.dam.2008.03.041
+Normal rank
@@ Property / OpenAlex ID @@
+W2084796008
@@ Property / OpenAlex ID: W2084796008 / rank @@
+Normal rank
@@ Property / cites work @@
+A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
+Normal rank
@@ Property / cites work @@
+A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
+Normal rank
@@ Property / cites work @@
+Q4120330
@@ Property / cites work: Q4120330 / rank @@
+Normal rank
@@ Property / cites work @@
+Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
+Normal rank
@@ Property / cites work @@
+A lift-and-project cutting plane algorithm for mixed 0-1 programs
+Normal rank
@@ Property / cites work @@
+Nonlinear Programming
@@ Property / cites work: Nonlinear Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Matrix Analysis
@@ Property / cites work: Matrix Analysis / rank @@
+Normal rank
@@ Property / cites work @@
+An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms
+Normal rank
@@ Property / cites work @@
+Cones of Matrices and Set-Functions and 0–1 Optimization
+Normal rank
@@ Property / cites work @@
+A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
+Normal rank
@@ Property / cites work @@
+A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
+Normal rank
@@ Property / cites work @@
+A reformulation-linearization technique for solving discrete and continuous nonconvex problems
+Normal rank
@@ Property / cites work @@
+Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
+Normal rank
@@ Property / cites work @@
+Enhancing RLT relaxations via a new class of semidefinite cuts
+Normal rank
@@ Property / cites work @@
+Optimization with disjunctive constraints
@@ Property / cites work: Optimization with disjunctive constraints / rank @@
+Normal rank
@@ Property / cites work @@
+On the generation of deep disjunctive cutting planes
+Normal rank
@@ Property / cites work @@
+Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
+Normal rank
@@ Property / cites work @@
+A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
+Normal rank
@@ Property / cites work @@
+Global optimization of nonconvex factorable programming problems
+Normal rank
@@ Property / cites work @@
+A branch-and-cut method for 0-1 mixed convex programming
+Normal rank