A Balasian-Based Algorithm for Zero-One Polynomial Programming
From MaRDI portal
Publication:5656593
DOI10.1287/MNSC.18.6.B328zbMATH Open0244.90029OpenAlexW2072244779MaRDI QIDQ5656593FDOQ5656593
Authors: Mamdy A. Taha 
Publication date: 1972
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.18.6.b328
Cited In (15)
- An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
- The indefinite zero-one quadratic problem
- A hybrid approach to resolving a differentiable integer program.
- Compact integer-programming models for extracting subsets of stimuli from confusion matrices
- An algorithm for indefinite integer quadratic programming
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- Reformulating nonlinear combinatorial optimization problems for higher computational efficiency
- Configuration of manufacturing software through capability specification and selection
- Nonlinear 0–1 programming: I. Linearization techniques
- The basic algorithm for pseudo-Boolean programming revisited
- Nonlinear 0–1 programming: II. Dominance relations and algorithms
- An approximate method for local optima for nonlinear mixed integer programming problems
- An approximate algorithm for nonlinear integer programming
- A revised Taha's algorithm for polynomial 0-1 programming
- A discrete optimization model for preserving biological diversity
This page was built for publication: A Balasian-Based Algorithm for Zero-One Polynomial Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5656593)
