Comparar métodos

	Matheurísticas: Hibridizando Programação Matemática e Meta-heurísticas	Hiper-heurísticas	Programação Inteira
Área	Otimização	Otimização	Otimização
Família	Process / pipeline	Process / pipeline	Process / pipeline
Ano de origem	2009	2013	1958
Autor original	Maniezzo, Stützle & Voß	Burke et al.	Ralph Gomory (cutting planes, 1958); land-and-doig branch-and-bound (1960)
Tipo	Hybrid optimization framework	High-level search methodology	Mathematical optimisation — exact combinatorial method
Fonte seminal	Maniezzo, V., Stützle, T., & Voß, S. (Eds.). (2009). Matheuristics: Hybridizing Metaheuristics and Mathematical Programming. Springer. ISBN: 978-1-4419-1305-0	Burke, E. K., et al. (2013). Hyper-heuristics: A survey of the state of the art. Journal of the Operational Research Society, 64(12), 1695–1724.	Wolsey, L.A. (1998). Integer Programming. Wiley. ISBN: 9780471283669
Outros nomes	Hybrid Metaheuristics, MIP-based Heuristics, Math-Programming Hybrids, Matematiksel Sezgisel Yöntemler	Heuristic of Heuristics, Algorithm Selection Hyper-Heuristic, Selection Hyper-Heuristic, Hiyer-Sezgisel	IP, MIP, mixed-integer programming, mixed-integer linear programming
Relacionados	3	3	4
Resumo	Matheuristics is a class of hybrid optimization methods that tightly couple exact mathematical programming components—such as mixed-integer programming (MIP) solvers—with metaheuristic search procedures. Formally introduced and named by Maniezzo, Stützle, and Voß in 2009, the framework leverages the global-search capability of metaheuristics and the structural exploitation of mathematical programming to tackle large-scale combinatorial optimization problems that neither approach can solve effectively alone.	Hyper-heuristics are high-level methodologies that search over a space of heuristics rather than directly over the space of solutions. Introduced systematically by Burke et al. (2013) in their landmark survey, hyper-heuristics operate by selecting or generating low-level heuristics to solve hard combinatorial optimisation and search problems, aiming to automate the design of optimisation algorithms across diverse problem domains without requiring deep problem-specific knowledge.	Integer programming (IP), also called mixed-integer programming (MIP) when only some variables are restricted to whole numbers, is a branch of mathematical optimisation in which some or all decision variables must take integer or binary values. Building on linear programming, it was formalised through Ralph Gomory's cutting-plane method (1958) and the Land-and-Doig branch-and-bound algorithm (1960), and it has since become the standard exact framework for scheduling, assignment, routing, and resource-allocation problems.