An efficient linearization technique for mixed 0-1 polynomial problem

DOI10.1016/J.CAM.2010.08.009MaRDI QIDQ611852zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• A linearization method for mixed 0--1 polynomial programs
• An efficient linearization approach for mixed-integer problems
• Publication:4887688
• scientific article; zbMATH DE number 4119927
• Towards a Genuinely Polynomial Algorithm for Linear Programming
• A Linearization Procedure for Quadratic and Cubic Mixed-Integer Problems
• An improved linearization technique for a class of quadratic 0-1 programming problems
• scientific article; zbMATH DE number 4016589
• A strongly polynomial algorithm for linear systems having a binary solution
• Asymptotically exact polynomial algorithms in integer linear programming

Cites work

• 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
• A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
• A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• A linearization method for mixed 0--1 polynomial programs
• 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
• Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Solving Mixed Integer Programming Problems Using Automatic Reformulation

Cited in

(4)

• A new global approach for \(0\)-\(1\) polynomial programs
• On the polynomial mixed 0-1 fractional programming problems
• Global Optimization for Mixed 0-1 Programs with Convex or Separable Continuous Functions
• Linear reformulation of polynomial discrete programming for fast computation

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q611852)