An efficient linearization technique for mixed 0-1 polynomial problem

DOI10.1016/j.cam.2010.08.009zbMath1206.90104OpenAlexW2054597867MaRDI QIDQ611852

V. R. Ghezavati, Mohammad Saidi-Mehrabad

Publication date: 14 December 2010

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2010.08.009

zbMATH Keywords

linearizationnonlinear mixed 0-1polynomial problem

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Cites Work

• A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
• A reformulation-linearization technique (RLT) for semi-infinite and convex programs under mixed 0-1 and general discrete restrictions
• A reformulation-linearization technique for solving discrete and continuous nonconvex problems
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• A linearization method for mixed 0--1 polynomial programs
• 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 Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions
• Solving Mixed Integer Programming Problems Using Automatic Reformulation

This page was built for publication: An efficient linearization technique for mixed 0-1 polynomial problem