Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
From MaRDI portal
Publication:1975377
DOI10.1016/S0166-218X(99)00225-5zbMath0946.90056OpenAlexW2090165335WikidataQ125020038 ScholiaQ125020038MaRDI QIDQ1975377
Jonathan C. Smith, Hanif D. Sherali, Warren P. Adams
Publication date: 29 October 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00225-5
Related Items
A review of recent advances in global optimization, Theoretical challenges towards cutting-plane selection, Dynamic Lagrangian dual and reduced RLT constructs for solving \(0-1\) mixed-integer programs, Efficient separation of RLT cuts for implicit and explicit bilinear products, Reduced RLT representations for nonconvex polynomial programming problems, A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions, Linearity embedded in nonconvex programs
Uses Software
Cites Work
- Mixed-integer bilinear programming problems
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Tighter representations for set partitioning problems
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- A Decomposition Algorithm for a Discrete Location-Allocation Problem
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A restricted Lagrangean approach to the traveling salesman problem
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
