Fabrice Talla Nobibon
Fabrice Talla Nobibon
Adresă de e-mail confirmată pe kuleuven.be - Pagina de pornire
Citat de
Citat de
Robust optimization for resource-constrained project scheduling with uncertain activity durations
C Artigues, R Leus, F Talla Nobibon
Flexible Services and Manufacturing Journal 25, 175-205, 2013
Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment
FT Nobibon, R Leus
Computers & Operations Research 38 (1), 367-378, 2011
Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms
FT Nobibon, R Leus, FCR Spieksma
European Journal of Operational Research 210 (3), 670-683, 2011
Revealed preference tests of collectively rational consumption behavior: formulations and algorithms
FT Nobibon, L Cherchye, Y Crama, T Demuynck, B De Rock, ...
Operations Research 64 (6), 1197-1216, 2016
Exact algorithms for single-machine scheduling with time windows and precedence constraints
M Davari, E Demeulemeester, R Leus, F Talla Nobibon
Journal of Scheduling 19, 309-334, 2016
A combination of flow shop scheduling and the shortest path problem
K Nip, Z Wang, F Talla Nobibon, R Leus
Journal of Combinatorial Optimization 29, 36-52, 2015
Scheduling modular projects on a bottleneck resource
K Coolen, W Wei, F Talla Nobibon, R Leus
Journal of Scheduling 17, 67-85, 2014
Proactive and reactive strategies for football league timetabling
X Yi, D Goossens, FT Nobibon
European Journal of Operational Research 282 (2), 772-785, 2020
Heuristics for deciding collectively rational consumption behavior
F Talla Nobibon, L Cherchye, B De Rock, J Sabbe, FCR Spieksma
Computational Economics 38, 173-204, 2011
Optimization of the annual planning of targeted offers in direct marketing
S Delanote, R Leus, FT Nobibon
Journal of the Operational Research Society 64 (12), 1770-1779, 2013
Resource loading with time windows
FT Nobibon, R Leus, K Nip, Z Wang
European Journal of Operational Research 244 (2), 404-416, 2015
Complexity results and exact algorithms for robust knapsack problems
F Talla Nobibon, R Leus
Journal of Optimization Theory and Applications 161, 533-552, 2014
On the complexity of testing the collective axiom of revealed preference
FT Nobibon, FCR Spieksma
Mathematical Social Sciences 60 (2), 123-136, 2010
Robust maximum weighted independent-set problems on interval graphs
F Talla Nobibon, R Leus
Optimization Letters 8, 227-235, 2014
Robust optimization for the resource-constrained project scheduling problem with duration uncertainty
C Artigues, R Leus, FT Nobibon
Handbook on Project Management and Scheduling Vol. 2, 875-908, 2015
Order acceptance and scheduling in a single-machine environment: exact and heuristic algorithms
FT Nobibon, J Herbots, R Leus
Available at SSRN 1472957, 2009
Foundation and formulation of stochastic interval programming [PGD thesis]
FT Nobibon, R Guo
African Institute for Mathematical Sciences, Cape Town, South Africa, 2006
A note on testing axioms of revealed preference
F Talla Nobibon, B Smeulders, FCR Spieksma
Journal of Optimization Theory and Applications 166, 1063-1070, 2015
Coloring graphs using two colors while avoiding monochromatic cycles
FT Nobibon, CAJ Hurkens, R Leus, FCR Spieksma
Informs Journal on Computing 24 (3), 485-499, 2012
Minimum-cost diagnostic strategies for k-out-of-n systems with imperfect tests
W Wei, K Coolen, FT Nobibon, R Leus
Discrete Applied Mathematics 222, 185-196, 2017
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20