A simulated annealing code for general integer linear programs
From MaRDI portal
Publication:1290124
DOI10.1023/A:1018915104438zbMATH Open0918.90114OpenAlexW1514746177MaRDI QIDQ1290124FDOQ1290124
Publication date: 10 June 1999
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018915104438
Learning and adaptive systems in artificial intelligence (68T05) Linear programming (90C05) Combinatorial optimization (90C27) Integer programming (90C10)
Cited In (9)
- Title not available (Why is that?)
- A co-operative parallel heuristic for mixed zero--one linear programming: Combining simulated annealing with branch and bound
- A robust stochastic casualty collection points location problem
- A simulated annealing with a new neighborhood structure based algorithm for high school timetabling problems
- A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
- Embedding of linear programming in a simulated annealing algorithm for solving a mixed integer production planning problem
- Information technology capital budgeting using a knapsack problem
- Redesigning product lines in a period of economic crisis: a hybrid simulated annealing algorithm with crossover
- Template design under demand uncertainty by integer linear local search
Uses Software
Recommendations
- General Purpose Simulated Annealing 👍 👎
- Title not available (Why is that?) 👍 👎
- A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm 👍 👎
- A Simulated Annealing Algorithm for General Zero-One Programming Problems 👍 👎
- Simulated annealing: An introduction 👍 👎
This page was built for publication: A simulated annealing code for general integer linear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1290124)
