Short Biography

Carlos Oliveira is a researcher in the area of computational optimization. He specializes in large scale optimization software for telecommunications, transportation, and health care industries.

Carlos Oliveira obtained a PhD in Operations Research and Systems Engineering from the University of Florida in 2004. He was assistant Professor at Oklahoma State University from 2004 to 2006. Since then, he has been working full time as a consultant. He can be contacted at oliveira [--AT--]


Dr. Oliveira has been working on algorithms for NP-hard problems occurring in diverse areas, such as computer and telecommunications networks, internet modelling, and biological computing. He is the author of several papers in areas related to optimization, mathematical programming, and computing. He is a member of the Editorial Boards of the Journal of Combinatorial Optimization and Optimization Letters.

As as consultant, Dr. Oliveira has developed solutions for major companies in the US, in the areas of transportation, telecommunications, defense, and finance.

Areas of Research

  • Mathematical Programming
  • Discrete Optimization
  • Telecommunications
  • Logistics
  • Biocomputing

Other Areas of Expertise

  • Optimization software
  • Design of algorithms
  • Software engineering
  • Object oriented design
  • Web-based systems

Erdös Number

My Erdös number is 3, through Panos Pardalos (notice that for young researchers the best possible Erdös number is 2). Here is one of the possible chains of size 3:

  • Construction algorithms and approximation bounds for the streaming cache placement problems in multicast networks (with P. Pardalos). Cybernetics and Systems Analysis, 41(6):898.908, 2005.
  • Ding-Zhu Du, Xian Jiaotong, Ronald L. Graham, Panos M. Pardalos, Peng-Jun Wan, Weili Wu, Wenbo Zhao, "Analysis of greedy approximations with nonsubmodular potential functions", Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, 167-175, 2008.
  • P. Erdös, R. L. Graham, "Packing squares with equal squares", Journal of Combinatorial Theory Series A, 19:1, 119-123, 1975.