Pages that link to "Item:Q1025998"
From MaRDI portal
The following pages link to A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions (Q1025998):
Displaying 10 items.
- RLT-POS: reformulation-linearization technique-based optimization software for solving polynomial programming problems (Q340017) (← links)
- A hierarchy of relaxations for nonlinear convex generalized disjunctive programming (Q439452) (← links)
- An efficient linearization technique for mixed 0-1 polynomial problem (Q611852) (← links)
- On interval-subgradient and no-good cuts (Q613320) (← links)
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems (Q817200) (← links)
- Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations (Q1975377) (← links)
- Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
- Exploiting special structures in constructing a hierarchy of relaxations for \(0-1\) mixed integer problems (Q2770136) (← links)
- Decompositions of Semidefinite Matrices and the Perspective Reformulation of Nonseparable Quadratic Programs (Q5108255) (← links)
- LP-based approximations for disjoint bilinear and two-stage adjustable robust optimization (Q6589750) (← links)
