A recombination‐based matheuristic for mixed integer programming problems with binary variables

DOI10.1111/ITOR.12526MaRDI QIDQ6066716zbMATH OpenOpenAlexWikidataFDO

Authors André L. Maravilha, Eduardo G. Carrano, Felipe Campelo

Publication date 16 November 2023

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

Full work available at URL https://doi.org/10.1111/itor.12526

zbMATH Keywords

branch-and-boundcombinatorial optimizationinteger programminglocal searchmetaheuristics

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Recommendations

• Solving binary-constrained mixed complementarity problems using continuous reformulations
• Mixed-integer bilinear programming problems
• Mixed integer linear programming models for combinatorial optimization problems
• On the mixed binary goal programming problems
• A branch-and-cut algorithm for mixed-integer bilinear programming
• A decomposition technique for mixed integer programming problems
• On the Value of Binary Expansions for General Mixed-Integer Linear Programs
• Mixed integer programming computation
• A relaxation algorithm for solving mixed integer programming problems
• scientific article; zbMATH DE number 3972639

Cites work

• A survey of very large-scale neighborhood search techniques
• An evolutionary algorithm for polishing mixed integer programming solutions
• Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization
• DINS, a MIP Improvement Heuristic
• Evolutionary computation: a unified approach.
• Exploring relaxation induced neighborhoods to improve MIP solutions
• Handbook of metaheuristics
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• scientific article; zbMATH DE number 1054674 (Why is no real title available?)
• scientific article; zbMATH DE number 1384868 (Why is no real title available?)
• Local branching
• RENS. The optimal rounding
• The feasibility pump
• The R Book

This page was built for publication: A recombination‐based matheuristic for mixed integer programming problems with binary variables

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