A revised Taha's algorithm for polynomial 0-1 programming

DOI10.1080/02331930701617148MaRDI QIDQ5426969zbMATH OpenOpenAlexWikidataFDO

Authors Jun Wang, Duan Li, Xiaoling Sun

Publication date 16 November 2007

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930701617148

zbMATH Keywords

implicit enumerationInteger programmingpolynomial 0-1 programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Boolean programming (90C09) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 3585214
• State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
• An ordering (enumerative) algorithm for nonlinear \(0-1\) programming
• Implicit Enumeration for the Pure Integer 0/1 Minimax Programming Problem
• scientific article; zbMATH DE number 3904325

Cites work

• A Balasian-Based Algorithm for Zero-One Polynomial Programming
• An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
• An exact penalty function approach for nonlinear integer programming problems
• BARON: A general purpose global optimization software package
• Capital Expenditure Programming and Some Alternative Approaches to Risk
• Cluster Analysis and Mathematical Programming
• Covering Relaxation for Positive 0-1 Polynomial Programs
• Further Improvements in the Polynomial Zero-One Algorithm
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Integer Polynomial Optimization in Fixed Dimension
• Integer Programming by Implicit Enumeration and Balas’ Method
• Methods of Nonlinear 0-1 Programming
• Nonlinear 0–1 programming: I. Linearization techniques
• Nonlinear 0–1 programming: II. Dominance relations and algorithms
• Penalty formulation for zero-one nonlinear programming
• Polynomial Programming: LP-Relaxations Also Converge
• Pseudo-Boolean Programming
• State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
• Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
• Technical Note—Generalized Covering Relaxation for 0-1 Programs
• The Generalized Lattice-Point Problem

Cited in

(3)

• Univariate parameterization for global optimization of mixed-integer polynomial problems
• Persistency in 0-1 polynomial programming
• scientific article; zbMATH DE number 3585214 (Why is no real title available?)

This page was built for publication: A revised Taha's algorithm for polynomial 0-1 programming

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