A Balasian-Based Algorithm for Zero-One Polynomial Programming
From MaRDI portal
Publication:5656593
DOI10.1287/mnsc.18.6.B328zbMath0244.90029OpenAlexW2072244779MaRDI QIDQ5656593
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
Related Items
An algorithm for indefinite integer quadratic programming, A discrete optimization model for preserving biological diversity, Nonlinear 0–1 programming: I. Linearization techniques, Nonlinear 0–1 programming: II. Dominance relations and algorithms, A hybrid approach to resolving a differentiable integer program., Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, Reformulating nonlinear combinatorial optimization problems for higher computational efficiency, 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, The basic algorithm for pseudo-Boolean programming revisited, The indefinite zero-one quadratic problem, Compact integer-programming models for extracting subsets of stimuli from confusion matrices, Configuration of manufacturing software through capability specification and selection, An algorithm (GIPC2) for solving integer programming problems with separable nonlinear objective functions
