Methods -- The Formulation and Solution of Discrete Optimisation Models -- Continuous Approaches for Solving Discrete Optimization Problems -- Logic-Based Modeling -- Modelling for Feasibility - the Case of Mutually Orthogonal Latin Squares Problem -- Network Modelling -- Modeling and...

We generalise polyhedral projection (Fourier-Motzkin elimination) to integer programming (IP) and derive from this an alternative perspective on IP that parallels the classical theory. We first observe that projection of an IP yields an IP augmented with linear congruence relations and...