Integer Linear Programming
Also known as ILP
Overview
Integer linear programming studies how to choose discrete decisions—such as whether to assign a worker, open a facility, or use a route—while maximizing or minimizing a linear objective subject to constraints. Exact solvers combine methods such as branch-and-bound, cutting planes, and linear-programming relaxations, while careful formulations can make difficult problems much easier to solve. Current work also uses machine learning to propose formulations, branching policies, warm starts, and candidate solutions, often with solver feedback to retain feasibility and solution quality. A central challenge is scaling these methods to large, structured problems without sacrificing the guarantees and reliability of exact optimization.
Latest papers
23 papers0 papers in the last four weeks, with none the four weeks before. 0.0% of all new papers.