New heuristics and adaptive memory procedures for Boolean optimization problems

MaRDI QIDQ3372329zbMATH OpenFDO

Authors Lars Magnus Hvattum, Arne Løkketangen, Fred Glover

Publication date 20 February 2006

zbMATH Keywords

heuristicsBoolean optimization problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Boolean programming (90C09)

Recommendations

• A heuristic for Boolean optimization problems
• Adaptive memory search for Boolean optimization problems
• Boolean constraint satisfaction: Complexity results for optimization problems with arbitrary weights
• Comparisons of commercial MIP solvers and an adaptive memory (tabu search) procedure for a class of 0-1 integer programming problems
• Algorithms for Weighted Boolean Optimization

Cited in

(6)

• \(\boldsymbol{borealis}\) -- a generalized global update algorithm for Boolean optimization problems
• Comparisons of commercial MIP solvers and an adaptive memory (tabu search) procedure for a class of 0-1 integer programming problems
• The case for strategic oscillation
• A heuristic for Boolean optimization problems
• Generating meta-heuristic optimization code using ADATE
• Adaptive memory search for Boolean optimization problems

This page was built for publication: New heuristics and adaptive memory procedures for Boolean optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3372329)