default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFabrice Talla Nobibon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2020
[j19]Xiajie Yi
, Dries R. Goossens, Fabrice Talla Nobibon:
Proactive and reactive strategies for football league timetabling. Eur. J. Oper. Res. 282(2): 772-785 (2020)- 2017
- [j18]Wenchao Wei, Kris Coolen, Fabrice Talla Nobibon, Roel Leus:
Minimum-cost diagnostic strategies for k-out-of-n systems with imperfect tests. Discret. Appl. Math. 222: 185-196 (2017) - 2016
- [j17]Fabrice Talla Nobibon, Laurens Cherchye, Yves Crama, Thomas Demuynck, Bram De Rock, Frits C. R. Spieksma:
Revealed Preference Tests of Collectively Rational Consumption Behavior: Formulations and Algorithms. Oper. Res. 64(6): 1197-1216 (2016) - [j16]Morteza Davari, Erik Demeulemeester, Roel Leus, Fabrice Talla Nobibon:
Exact algorithms for single-machine scheduling with time windows and precedence constraints. J. Sched. 19(3): 309-334 (2016) - 2015
- [j15]Fabrice Talla Nobibon, Roel Leus, Kameng Nip, Zhenbo Wang:
Resource loading with time windows. Eur. J. Oper. Res. 244(2): 404-416 (2015) - [j14]Martijn Huysmans, Kris Coolen, Fabrice Talla Nobibon, Roel Leus:
A fast greedy heuristic for scheduling modular projects. J. Heuristics 21(1): 47-72 (2015) - [j13]Kameng Nip, Zhenbo Wang, Fabrice Talla Nobibon, Roel Leus:
A combination of flow shop scheduling and the shortest path problem. J. Comb. Optim. 29(1): 36-52 (2015) - [j12]Fabrice Talla Nobibon, Bart Smeulders, Frits C. R. Spieksma:
A Note on Testing Axioms of Revealed Preference. J. Optim. Theory Appl. 166(3): 1063-1070 (2015) - 2014
- [j11]Fabrice Talla Nobibon, Roel Leus:
Complexity Results and Exact Algorithms for Robust Knapsack Problems. J. Optim. Theory Appl. 161(2): 533-552 (2014) - [j10]Fabrice Talla Nobibon, Roel Leus:
Robust maximum weighted independent-set problems on interval graphs. Optim. Lett. 8(1): 227-235 (2014) - [j9]Kris Coolen, Wenchao Wei, Fabrice Talla Nobibon, Roel Leus:
Scheduling modular projects on a bottleneck resource. J. Sched. 17(1): 67-85 (2014) - 2013
- [j8]Fabrice Talla Nobibon, Kris Coolen, Roel Leus:
A Note on "Discrete Sequential Search with Group Activities". Decis. Sci. 44(2): 395-401 (2013) - [j7]S. Delanote, Roel Leus, Fabrice Talla Nobibon:
Optimization of the annual planning of targeted offers in direct marketing. J. Oper. Res. Soc. 64(12): 1770-1779 (2013) - 2012
- [j6]Fabrice Talla Nobibon:
Algorithms for selection and graph-coloring problems with applications in marketing and micro-economics. 4OR 10(1): 107-108 (2012) - [j5]Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger:
The interval ordering problem. Discret. Appl. Math. 160(7-8): 1094-1103 (2012) - [j4]Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma:
Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles. INFORMS J. Comput. 24(3): 485-499 (2012) - 2011
- [j3]Fabrice Talla Nobibon, Roel Leus:
Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment. Comput. Oper. Res. 38(1): 367-378 (2011) - [j2]Fabrice Talla Nobibon, Roel Leus, Frits C. R. Spieksma:
Optimization models for targeted offers in direct marketing: Exact and heuristic algorithms. Eur. J. Oper. Res. 210(3): 670-683 (2011) - 2010
- [j1]Fabrice Talla Nobibon, Frits C. R. Spieksma:
On the complexity of testing the Collective Axiom of Revealed Preference. Math. Soc. Sci. 60(2): 123-136 (2010)
Conference and Workshop Papers
- 2016
- [c3]Trivikram Dokka, Alain B. Zemkoho, Sonali Sen Gupta, Fabrice Talla Nobibon:
Pricing Toll Roads under Uncertainty. ATMOS 2016: 4:1-4:14 - 2011
- [c2]Roel Leus, Christian Artigues, Fabrice Talla Nobibon:
Robust optimization for resource-constrained project scheduling with uncertain activity durations. IEEM 2011: 101-105 - 2010
- [c1]Fabrice Talla Nobibon, Cor A. J. Hurkens, Roel Leus, Frits C. R. Spieksma:
Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles. AAIM 2010: 229-242
Informal and Other Publications
- 2017
- [i3]Trivikram Dokka, Alain B. Zemkoho, Sonali Sen Gupta, Fabrice Talla Nobibon:
Robust toll pricing: A novel approach. CoRR abs/1712.01570 (2017) - 2013
- [i2]Kameng Nip, Zhenbo Wang, Fabrice Talla Nobibon, Roel Leus:
A Combination of Flow Shop Scheduling and the Shortest Path Problem. CoRR abs/1309.0081 (2013) - 2011
- [i1]Christoph Dürr, Maurice Queyranne, Frits C. R. Spieksma, Fabrice Talla Nobibon, Gerhard J. Woeginger:
The interval ordering problem. CoRR abs/1112.0534 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
