Solving zero-one mixed integer programming problems using tabu search
Authors:
- Arne LokketangenALArne Lokketangen
- 1 April 1998
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 106 (2-3) , 624-658
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Tabu search within a pivot and complement frameworkInternational Transactions in Operational Research, 1994
- Integrating target analysis and tabu search for improved scheduling systemsExpert Systems with Applications, 1993
- Dynamic tabu list management using the reverse elimination methodAnnals of Operations Research, 1993
- A user's guide to tabu searchAnnals of Operations Research, 1993
- General Purpose Simulated AnnealingJournal of the Operational Research Society, 1992
- New approaches for heuristic search: A bilateral linkage with artificial intelligenceEuropean Journal of Operational Research, 1989
- Semi-greedy heuristics: An empirical studyOperations Research Letters, 1987
- The general employee scheduling problem. An integration of MS and AIComputers & Operations Research, 1986
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack ProblemJournal of the Operational Research Society, 1979
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTSDecision Sciences, 1977