A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
From MaRDI portal
Publication:1919838
DOI10.1007/BF02601642zbMath0851.90085MaRDI QIDQ1919838
David Abramson, Henry Dang, Mohan Krishnamoorthy
Publication date: 18 September 1996
Published in: Annals of Operations Research (Search for Journal in Brave)
Related Items (7)
Metaheuristics: A bibliography ⋮ A dynamic programming based algorithm for the crew scheduling problem. ⋮ Staff scheduling and rostering: a review of applications, methods and models. ⋮ Workforce planning in the printing industry ⋮ Long-term staffing based on qualification profiles ⋮ Analysis of solution space-dependent performance of simulated annealing: The case of the multi-level capacitated lot sizing problem ⋮ Template design under demand uncertainty by integer linear local search
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- The asymptotic behaviour of quadratic sum assignment problems: A statistical mechanics approach
- A survey of algorithms for the generalized assignment problem
- Penalty computations for the set partitioning problem
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- Solving Large-Scale Zero-One Linear Programming Problems
- Simulated Annealing – An Annotated Bibliography
- General Purpose Simulated Annealing
- Set Partitioning: A survey
- Solving Airline Crew Scheduling Problems by Branch-and-Cut
- Simulated annealing algorithm for the minimum weighted perfect euclidean matching problem
- Capacitated clustering problems by hybrid simulated annealing and tabu search
- The Set-Partitioning Problem: Set Covering with Equality Constraints
This page was built for publication: A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
