Comparisons of commercial MIP solvers and an adaptive memory (tabu search) procedure for a class of 0-1 integer programming problems

zbMATH Open1277.90074MaRDI QIDQ2865877FDOQ2865877

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

Publication date: 11 December 2013

Published in: Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL: http://journals.hil.unb.ca/index.php/AOR/article/view/18595

Recommendations

• Adaptive memory search for Boolean optimization problems
• New heuristics and adaptive memory procedures for Boolean optimization problems
• Solving zero-one mixed integer programming problems using tabu search
• Terse integer linear programs for Boolean optimization
• Parametric tabu-search for mixed integer programs

zbMATH Keywords

metaheuristicsBoolean optimizationzero-one integer programmingcommercial solvers

Mathematics Subject Classification ID

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

Cited In (4)

• New heuristics and adaptive memory procedures for Boolean optimization problems
• Efficient local search for pseudo Boolean optimization
• Adaptive memory search for Boolean optimization problems
• Solving zero-one mixed integer programming problems using tabu search

Uses Software

• CPLEX
• Gurobi
• XPRESS

This page was built for publication: Comparisons of commercial MIP solvers and an adaptive memory (tabu search) procedure for a class of 0-1 integer programming problems

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