A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound
From MaRDI portal
Publication:707082
DOI10.1016/j.ejor.2002.12.002zbMath1132.90354OpenAlexW2010422915MaRDI QIDQ707082
V. Nwana, Kenneth Darby-Dowman, Gautam Mitra
Publication date: 9 February 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2002.12.002
Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)
Related Items
Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Combining metaheuristics with mathematical programming, constraint programming and machine learning ⋮ Hybridizing exact methods and metaheuristics: a taxonomy
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Simulated annealing: A tool for operational research
- A distributed processing algorithm for solving integer programs using a cluster of workstations
- Computational experience with parallel mixed integer programming in a distributed environment
- Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
- An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
- Convergence of an annealing algorithm
- Simulated Annealing – An Annotated Bibliography
- General Purpose Simulated Annealing
- Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
- Properties of Some Combinatorial Optimization Problems and Their Effect on the Performance of Integer Programming and Constraint Logic Programming
- A Computational Study of Search Strategies for Mixed Integer Programming
- Investigation of some branch and bound strategies for the solution of mixed integer linear programs
