F. Bobot, S. Conchon, E. Contejean, M. Iguernelala, A. Mahboubi et al., A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic, IJCAR 2012, pp.67-81, 2012.
DOI : 10.1007/978-3-642-31365-3_8
URL : https://hal.archives-ouvertes.fr/hal-00687640

S. Boyd and L. Vandenberghe, Convex Optimization, 2004.

M. Bromberger, T. Sturm, and C. Weidenbach, Linear Integer Arithmetic Revisited, LNCS, vol.9195, issue.25, pp.623-637, 2015.
DOI : 10.1007/978-3-319-21401-6_42
URL : https://hal.archives-ouvertes.fr/hal-01239394

A. Cimatti, A. Griggio, B. Schaafsma, and R. Sebastiani, The MathSAT5 SMT Solver, Proceedings of TACAS, 2013.
DOI : 10.1007/978-3-642-36742-7_7

L. De-moura and N. Bjørner, Z3: An Efficient SMT Solver, Tools and Algorithms for the Construction and Analysis of Systems, pp.337-340, 2008.
DOI : 10.1007/978-3-540-78800-3_24

I. Dillig, T. Dillig, and A. Aiken, Cuts from proofs: A complete and practical technique for solving linear inequalities over integers, LNCS, vol.5643, pp.233-247, 2009.

B. Dutertre, Yices??2.2, Computer-Aided Verification (CAV'2014), 2014.
DOI : 10.1007/978-3-319-08867-9_49

B. Dutertre and L. De-moura, A Fast Linear-Arithmetic Solver for DPLL(T), LNCS, vol.4144, pp.81-94, 2006.
DOI : 10.1007/11817963_11

M. Ehrgott, Scalarization techniques, Multicriteria Optimization, pp.97-126, 2005.

G. Faure, R. Nieuwenhuis, A. Oliveras, and E. Rodríguez, SAT Modulo the Theory of Linear Arithmetic: Exact, Inexact and Commercial Solvers, LNCS, vol.4996, pp.77-90, 2008.
DOI : 10.1007/978-3-540-79719-7_8
URL : https://hal.archives-ouvertes.fr/inria-00358813

A. Griggio, A practical approach to satisfiability modulo linear integer arithmetic, JSAT, vol.8, issue.12, pp.1-27, 2012.
DOI : 10.1007/978-3-642-19835-9_13

F. S. Hillier, Efficient Heuristic Procedures for Integer Linear Programming with an Interior, Operations Research, vol.17, issue.4, pp.600-637, 1969.
DOI : 10.1287/opre.17.4.600

D. Jovanovi´cjovanovi´c and L. De-moura, Cutting to the Chase, Journal of Automated Reasoning, vol.28, issue.4, pp.79-108, 2013.
DOI : 10.1007/s10817-013-9281-x

R. Kannan and L. Lovász, Covering minima and lattice point free convex bodies, LNCS, vol.241, pp.193-213, 1986.
DOI : 10.2307/1971436

N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica, vol.244, issue.S, pp.373-396, 1984.
DOI : 10.1007/BF02579150

C. H. Papadimitriou, On the complexity of integer programming, Journal of the ACM, vol.28, issue.4, pp.765-768, 1981.
DOI : 10.1145/322276.322287