Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("DE FARIAS, I. R")

Results 1 to 6 of 6

  • Page / 1
Export

Selection :

  • and

The mixing-MIR set with divisible capacitiesZHAO, M; DE FARIAS, I. R.Mathematical programming. 2008, Vol 115, Num 1, pp 73-103, issn 0025-5610, 31 p.Article

A note on the continuous mixing setZHAO, M; DE FARIAS, I. R.Operations research letters. 2008, Vol 36, Num 6, pp 726-733, issn 0167-6377, 8 p.Article

Semi-continuous cuts for mixed-integer programmingDE FARIAS, I. R.Lecture notes in computer science. 2004, pp 163-177, issn 0302-9743, isbn 3-540-22113-1, 15 p.Conference Paper

A polyhedral study of the cardinality constrained knapsack problemDE FARIAS, I. R; NEMHAUSER, G. L.Mathematical programming. 2003, Vol 96, Num 3, pp 439-467, issn 0025-5610, 29 p.Article

A generalized assignment problem with special ordered sets: a polyhedral approachDE FARIAS, I. R; JOHNSON, E. L; NEMHAUSER, G. L et al.Mathematical programming. 2000, Vol 89, Num 1, pp 187-203, issn 0025-5610Article

Lifted inequalities for 0-1 mixed integer programming: Superlinear liftingRICHARD, J.-P. P; DE FARIAS, I. R; NEMHAUSER, G. L et al.Mathematical programming. 2003, Vol 98, Num 1-3, pp 115-143, issn 0025-5610, 29 p.Conference Paper

  • Page / 1