Solving a class of multiplicative programs with 0–1 knapsack constraints

Authors:
T. Kuno
Affiliations:
-
Venue:
Journal of Optimization Theory and Applications
Year:
1999

Citing 0
Cited 3

Linear Programming Relax-PSO Hybrid Bound Algorithm for a Class of Nonlinear Integer Programming Problems

Computational Intelligence and Security
A nonisolated optimal solution of general linear multiplicative programming problems

Computers and Operations Research
PSO algorithm with chaos and gene density mutation for solving nonlinear zero-one integer programming problems

ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract