A simulated annealing code for general integer linear programs

DOI10.1023/A:1018915104438MaRDI QIDQ1290124zbMATH OpenOpenAlexFDO

Authors D. Abramson, Marcus Randall

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

zbMATH Keywords

simulated annealingbin packinggraph colouringquadratic assignmenttravelling salesman

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Linear programming (90C05) Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• General Purpose Simulated Annealing
• scientific article; zbMATH DE number 4085427
• 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

Cited in

(9)

• scientific article; zbMATH DE number 151871 (Why is no real title available?)
• 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

Describes a project that uses

Uses Software

• OR-Library

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)