A revised Taha's algorithm for polynomial 0-1 programming
From MaRDI portal
Publication:5426969
DOI10.1080/02331930701617148zbMath1172.90444OpenAlexW2058096669WikidataQ57445480 ScholiaQ57445480MaRDI QIDQ5426969
Jun Wang, Xiaoling Sun, Li, Duan
Publication date: 16 November 2007
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331930701617148
Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)
Related Items
Cites Work
- An exact penalty function approach for nonlinear integer programming problems
- Penalty formulation for zero-one nonlinear programming
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- BARON: A general purpose global optimization software package
- Covering Relaxation for Positive 0-1 Polynomial Programs
- Nonlinear 0–1 programming: I. Linearization techniques
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- Methods of Nonlinear 0-1 Programming
- Technical Note—Generalized Covering Relaxation for 0-1 Programs
- An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs
- State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming
- The Generalized Lattice-Point Problem
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Polynomial Programming: LP-Relaxations Also Converge
- Integer Polynomial Optimization in Fixed Dimension
- Pseudo-Boolean Programming
- Integer Programming by Implicit Enumeration and Balas’ Method
- Capital Expenditure Programming and Some Alternative Approaches to Risk
- Cluster Analysis and Mathematical Programming
- A Balasian-Based Algorithm for Zero-One Polynomial Programming
- Further Improvements in the Polynomial Zero-One Algorithm
