![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Monia Rekik
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Anas Neumann, Adnène Hajji
, Monia Rekik, Robert Pellerin:
Genetic algorithms for planning and scheduling engineer-to-order production: a systematic review. Int. J. Prod. Res. 62(8): 2888-2917 (2024) - 2022
- [j12]Farouk Hammami
, Monia Rekik
, Leandro C. Coelho
:
An exact method for the combinatorial bids generation problem with uncertainty on clearing prices, bids success, and contracts materialization. Comput. Oper. Res. 148: 105982 (2022) - 2020
- [j11]Farouk Hammami
, Monia Rekik
, Leandro C. Coelho
:
A hybrid adaptive large neighborhood search heuristic for the team orienteering problem. Comput. Oper. Res. 123: 105034 (2020) - [j10]Sana Dahmen, Monia Rekik
, François Soumis, Guy Desaulniers
:
A two-stage solution approach for personalized multi-department multi-day shift scheduling. Eur. J. Oper. Res. 280(3): 1051-1063 (2020)
2010 – 2019
- 2019
- [j9]Intissar Ben Othmane, Monia Rekik
, Sehl Mellouli
:
A profit-maximization heuristic for combinatorial bid construction with pre-existing network restrictions. J. Oper. Res. Soc. 70(12): 2097-2111 (2019) - 2018
- [j8]Sana Dahmen, Monia Rekik
, François Soumis:
An implicit model for multi-activity shift scheduling problems. J. Sched. 21(3): 285-304 (2018) - 2016
- [c3]Amal Marzouki
, Meriam Nefzi, Sehl Mellouli, Adnène Hajji
, Monia Rekik
:
Transforming city initiative into a smart city initiative: the case of "winter maintenance operations". DG.O 2016: 536-537 - 2015
- [j7]Sana Dahmen, Monia Rekik
:
Solving multi-activity multi-day shift scheduling problems with a hybrid heuristic. J. Sched. 18(2): 207-223 (2015) - 2014
- [j6]Rachida Abounacer, Monia Rekik
, Jacques Renaud
:
An exact solution approach for multi-objective location-transportation problem for disaster response. Comput. Oper. Res. 41: 83-93 (2014) - 2013
- [c2]Hichem Klabi, Sehl Mellouli
, Monia Rekik
:
A reputation based electronic government procurement model. ICEGOV 2013: 94-102 - 2012
- [j5]Monia Rekik
, Sehl Mellouli
:
Reputation-based winner determination problem for combinatorial transportation procurement auctions. J. Oper. Res. Soc. 63(10): 1400-1409 (2012) - [c1]Hichem Klabi, Khaled Mellouli, Sehl Mellouli
, Monia Rekik
:
A trust model for a multi-agent negotiation. ICCIT 2012: 291-296 - 2010
- [j4]Monia Rekik
, Jean-François Cordeau, François Soumis:
Implicit shift scheduling with multiple breaks and work stretch duration restrictions. J. Sched. 13(1): 49-75 (2010)
2000 – 2009
- 2008
- [j3]Monia Rekik
, Jean-François Cordeau, François Soumis:
Solution approaches to large shift scheduling problems. RAIRO Oper. Res. 42(2): 229-258 (2008) - 2007
- [j2]Jawad Abrache
, Teodor Gabriel Crainic
, Michel Gendreau, Monia Rekik
:
Combinatorial auctions. Ann. Oper. Res. 153(1): 131-164 (2007) - 2004
- [j1]Monia Rekik
, Jean-François Cordeau, François Soumis:
Using Benders Decomposition to Implicitly Model Tour Scheduling. Ann. Oper. Res. 128(1-4): 111-133 (2004)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 21:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint