Ismael De Farias

  • Source: Scopus
  • Calculated based on no. of publications stored in Pure and citations from Scopus
20002015

Research output per year

If you made any changes in Pure these will be visible here soon.
Filter
Conference contribution

Search results

  • 2002

    A polyhedral study of the cardinality constrained knapsack problem

    De Farias, I. R. & Nemhauser, G. L., 2002, Integer Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings. Cook, W. J. & Schulz, A. S. (eds.). Springer-Verlag, p. 291-303 13 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2337 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Scopus citations
  • Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms

    Richard, J. P. P., De Farias, I. R. & Nemhauser, G. L., 2002, Integer Programming and Combinatorial Optimization - 9th International IPCO 2002 Conference, Proceedings. Cook, W. J. & Schulz, A. S. (eds.). Springer-Verlag, p. 161-175 15 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 2337 LNCS).

    Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

    2 Scopus citations