Adaptive memory search for Boolean optimization problems

DOI10.1016/j.dam.2003.06.006zbMath1122.90052OpenAlexW2052819992MaRDI QIDQ1878405

Arne Løkketangen, Fred Glover, Lars Magnus Hvattum

Publication date: 19 August 2004

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.06.006

zbMATH Keywords

tabu searchAdaptive memory searchBoolean optimization problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Simple heuristics for the multi-period fleet size and mix vehicle routing problem, Adaptive memory programming for the vehicle routing problem with multiple trips, Generating meta-heuristic optimization code using ADATE, Exponential extrapolation memory for tabu search, Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization, Creating lasso-solutions for the traveling salesman problem with pickup and delivery by tabu search, A tabu search approach for the livestock collection problem, An adaptive tabu search approach for buffer allocation problem in unreliable non-homogenous production lines, Adaptive memory search for multidemand multidimensional knapsack problems, Lasso solution strategies for the vehicle routing problem with pickups and deliveries

Uses Software

• Tabu search

Cites Work

• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item