Future paths for integer programming and links to artificial intelligence

@article{Glover1986FuturePF,
  title={Future paths for integer programming and links to artificial intelligence},
  author={Fred W. Glover},
  journal={Comput. Oper. Res.},
  year={1986},
  volume={13},
  pages={533-549}
}
  • Fred W. Glover
  • Published 1986
  • Computer Science
  • Comput. Oper. Res.
  • Abstract Integer programming has benefited from many innovations in models and methods. Some of the promising directions for elaborating these innovations in the future may be viewed from a framework that links the perspectives of artificial intelligence and operations research. To demonstrate this, four key areas are examined: 1. (1) controlled randomization, 2. (2) learning strategies, 3. (3) induced decomposition and 4. (4) tabu search. Each of these is shown to have characteristics that… CONTINUE READING
    3,646 Citations
    Artificial intelligence, heuristic frameworks and tabu search
    • 119
    • PDF
    INTELCSP: computational intelligence applied to cutting stock problems
    New approaches for heuristic search: A bilateral linkage with artificial intelligence
    • 237
    • PDF
    Heuristic Search Methods: A Review
    • 12
    Fundamental Limitations on Search Algorithms: Evolutionary Computing in Perspective
    • 147
    • PDF
    Tabu Search Fundamentals and Uses
    • 102
    • PDF
    A tabu search experience in production scheduling
    • 53

    References

    SHOWING 1-10 OF 120 REFERENCES
    Parametric branch and bound
    • 19
    • PDF
    HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTS
    • 1,301
    • Highly Influential
    • PDF
    Layering strategies for creating exploitable structure in linear and integer programs
    • 33
    • PDF
    Integer Programming
    • 3,810
    • PDF
    Some relationships between lagrangian and surrogate duality in integer programming
    • 92
    Using simulated annealing to solve routing and location problems
    • 202
    Linear Programming and Extensions
    • 2,530
    • PDF