85 citations · 96 across the 2 of their papers we have counts for
2 papers
cs.DS2014★ 85 cited
A MILP model for an extended version of the Flexible Job Shop Problem
Ernesto G. Birgin, Paulo Feofiloff, Cristina G. Fernandes +3
A MILP model for an extended version of the Flexible Job Shop Scheduling problem is proposed. The extension allows the precedences between operations of a job to be given by an arb…
cs.DS2010★ 11 cited
A note on Johnson, Minkoff and Phillips' algorithm for the Prize-Collecting Steiner Tree Problem
Paulo Feofiloff, Cristina G. Fernandes, Carlos E. Ferreira +1
The primal-dual scheme has been used to provide approximation algorithms for many problems. Goemans and Williamson gave a (2-1/(n-1))-approximation for the Prize-Collecting Steiner…