Mixed Integer Programming (MIP) is a foundational problem in combinatorial optimization, with wide-ranging applications in industries like logistics, scheduling, and resource allocation. Traditional methods for solving MIP, such as branch-and-bound and branch-and-cut, face scalability issues, particularly for large and complex problem instances. Recently, hybrid approaches combining machine learning (ML) with classical optimization methods have shown significant promise in improving solver efficiency and solution quality. In this paper, we review the integration of ML into MIP solvers, focusing on three key areas: branch-and-bound enhancements, cutting plane generation, and heuristic optimization for approximate solutions. ML models, including supervised learning, reinforcement learning, and graph neural networks, are used to inform critical decision-making processes within the solver, leading to faster convergence and better performance. We highlight how ML-enhanced solvers reduce computation time, improve scalability, and adapt dynamically to different problem structures. Finally, we discuss challenges such as generalization across diverse MIP instances and seamless integration with existing solvers. The future of MIP solving lies in further refining these hybrid methods, making ML-driven solvers a powerful tool for solving complex optimization problems.