Nonlinear integer programming by Darwin and Boltzmann mixed strategy

DOI10.1016/S0377-2217(97)00024-6zbMath0957.90092OpenAlexW2063418398MaRDI QIDQ1291726

Peng Tian, Jian Ma, Dong-Mo Zhang

Publication date: 22 March 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00024-6

zbMATH Keywords

optimizationglobal convergencenonlinear integer programmingpolynomial algorithmDarwin and Boltzmann mixed strategy

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

A hybrid vendor managed inventory and redundancy allocation optimization problem in supply chain management: an NSGA-II with tuned parameters ⋮ Optimizing a sustainable logistics problem in a renewable energy network using a genetic algorithm ⋮ Optimizing an inventory model with fuzzy demand, backordering, and discount using a hybrid imperialist competitive algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• ``Neural computation of decisions in optimization problems
• Enumerative techniques for solving some nonconvex global optimization problems
• Future paths for integer programming and links to artificial intelligence
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• A comparison of Bayesian/sampling global optimization techniques