A hybrid search combining interior point methods and metaheuristics for 0-1 programming

DOI10.1111/1475-3995.00385zbMATH Open1044.90047OpenAlexW2112776368MaRDI QIDQ4468893FDOQ4468893

Authors: Dominique Tachat, Pierre Tolla, Agnès Plateau 

Publication date: 11 June 2004

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/1475-3995.00385

Recommendations

• Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
• New convergent heuristics for 0-1 mixed integer programming
• Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
• Variable neighbourhood decomposition search for \(0\)-\(1\) mixed integer programs
• Une approche hybride pour le sac à dos multidimensionnel en variables 0–1

Mathematics Subject Classification ID

Interior-point methods (90C51) Boolean programming (90C09)

Cited In (7)

• Hybrid variable neighbourhood decomposition search for 0-1 mixed integer programming problem
• HMS: a hybrid multi-start algorithm for solving binary linear programs
• Hybridizing exact methods and metaheuristics: a taxonomy
• The multidimensional 0-1 knapsack problem: an overview.
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
• Inequalities and Target Objectives for Metaheuristic Search – Part I: Mixed Binary Optimization

This page was built for publication: A hybrid search combining interior point methods and metaheuristics for 0-1 programming

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