On L1 and Chebyshev estimation. - Gautam Appa; Cyril Smith (Math. Program., 1973)

k-Integrality, an extension of total unimodularity. - Gautam M. Appa (Oper. Res. Lett., 1993)

On setting scale efficient targets in DEA. - Gautam Appa; M. Yue (J. Oper. Res. Soc., 1999)

OR Helps the Poor in a Controversial Irrigation Project. - Gautam Appa; R. Sridharan (Interfaces, 2000)

A reply to Zhu: How useful or accurate is this alternative? - Gautam Appa; M. Yue (J. Oper. Res. Soc., 2000)

Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem. - Gautam Appa; Ioannis Mourtos; Dimitris Magos (CP, 2002)

On the uniqueness of solutions to linear programs. - Gautam Appa (J. Oper. Res. Soc., 2002)

LP Relaxations of Multiple all_different Predicates. - Gautam Appa; Dimitris Magos; Ioannis Mourtos (CPAIOR, 2004)

Rational and integral k-regular matrices. - Gautam Appa; Balázs Kotnyek (Discret. Math., 2004)

A Branch & Cut algorithm for a four-index assignment problem. - Gautam Appa; Dimitrios Magos; Ioannis Mourtos (J. Oper. Res. Soc., 2004)

An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6. - Gautam Appa; Dimitris Magos; Ioannis Mourtos (Oper. Res. Lett., 2004)

On the system of two all_different predicates. - Gautam Appa; Dimitris Magos; Ioannis Mourtos (Inf. Process. Lett., 2005)

The Wheels of the Orthogonal Latin Squares Polytope: Classification and Valid Inequalities. - Gautam Appa; Dimitris Magos; Ioannis Mourtos (J. Comb. Optim., 2005)

A new class of facets for the Latin square polytope. - Gautam Appa; Dimitris Magos; Ioannis Mourtos (Discret. Appl. Math., 2006)

On the orthogonal Latin squares polytope. - Gautam Appa; Dimitris Magos; Ioannis Mourtos; Jeannette C. M. Janssen (Discret. Math., 2006)

Searching for Mutually Orthogonal Latin Squares via integer and constraint programming. - Gautam Appa; Dimitris Magos; Ioannis Mourtos (Eur. J. Oper. Res., 2006)

A new framework for the solution of DEA models. - Gautam Appa; H. Paul Williams (Eur. J. Oper. Res., 2006)

A bidirected generalization of network matrices. - Gautam Appa; Balázs Kotnyek (Networks, 2006)

Optimization with binet matrices. - Gautam Appa; Balázs Kotnyek; Konstantinos Papalamprou; Leonidas S. Pitsoulis (Oper. Res. Lett., 2007)

On the representability of totally unimodular matrices on bidirected graphs. - Leonidas S. Pitsoulis; Konstantinos Papalamprou; Gautam Appa; Balázs Kotnyek (Discret. Math., 2009)

A polyhedral approach to the alldifferent system. - Dimitris Magos; Ioannis Mourtos; Gautam Appa (Math. Program., 2012)

A heuristic for the Minimum Score Separation Problem, a combinatorial problem associated with the cutting stock problem. - Kai Helge Becker; Gautam Appa (J. Oper. Res. Soc., 2015)

On the completability of incomplete orthogonal Latin rectangles. - Gautam Appa; Reinhardt Euler; Anastasia Kouvela; Dimitris Magos; Ioannis Mourtos (Discret. Math., 2016)