default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRabia Nessah
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j22]Stefano Nasini
, Rabia Nessah:
Time-flexible min completion time variance in a single machine by quadratic programming. Eur. J. Oper. Res. 312(2): 427-444 (2024)- 2022
- [j21]Bertrand Crettez, Rabia Nessah, Tarik Tazdaït:
On the strong hybrid solution of an n-person game. Math. Soc. Sci. 117: 61-68 (2022) - 2021
- [j20]Stefano Nasini, Rabia Nessah:
An almost exact solution to the min completion time variance in a single machine. Eur. J. Oper. Res. 294(2): 427-441 (2021) - 2020
- [j19]Rabia Nessah:
Technical Note Alternative Theorem: Equilibrium in Abstract Economies. IGTR 22(4): 2071001:1-2071001:12 (2020) - [j18]Bertrand Crettez, Rabia Nessah:
On the existence of unilateral support equilibrium. Math. Soc. Sci. 105: 41-47 (2020)
2010 – 2019
- 2019
- [j17]Rabia Nessah, Tarik Tazdaït:
Quasi-Transfer Continuity and Nash Equilibrium. IGTR 21(4): 1950004:1-1950004:8 (2019) - 2017
- [j16]Rabia Nessah, Raluca Parvulescu:
On the Existence of Pareto Efficient Nash Equilibria in Discontinuous Games. IGTR 19(3): 1750014:1-1750014:13 (2017) - 2016
- [j15]Robert Joliet, Rabia Nessah:
Euro White and Euro Yolk: Sovereign Debt Structure Stability in the Eurozone. IGTR 18(3): 1650004:1-1650004:15 (2016) - 2015
- [j14]Rabia Nessah, Moussa Larbani, Tarik Tazdaït:
Coalitional ZP-Equilibrium in Games and its Existence. IGTR 17(3): 1550002:1-1550002:18 (2015) - 2014
- [j13]Rabia Nessah, Moussa Larbani:
Berge-Zhukovskii Equilibria: existence and Characterization. IGTR 16(4) (2014) - [j12]Antonin Pottier, Rabia Nessah:
Berge-Vaisman and Nash Equilibria: Transformation of Games. IGTR 16(4) (2014) - 2013
- [j11]Rabia Nessah, Tarik Tazdaït:
Absolute optimal solution for a compact and convex game. Eur. J. Oper. Res. 224(2): 353-361 (2013) - [j10]Rabia Nessah, Guoqiang Tian:
Existence of Solution of Minimax Inequalities, Equilibria in Games and Fixed Points Without Convexity and Compactness Assumptions. J. Optim. Theory Appl. 157(1): 75-95 (2013) - 2012
- [j9]Rabia Nessah, Imed Kacem:
Branch-and-bound method for minimizing the weighted completion time scheduling problem on a single machine with release dates. Comput. Oper. Res. 39(3): 471-478 (2012) - 2010
- [j8]Rabia Nessah, Chengbin Chu:
Infinite split scheduling: a new lower bound of total weighted completion time on parallel machines with job release dates and unavailability periods. Ann. Oper. Res. 181(1): 359-375 (2010) - [j7]Rabia Nessah, Chengbin Chu:
A lower bound for weighted completion time variance. Eur. J. Oper. Res. 207(3): 1221-1226 (2010)
2000 – 2009
- 2008
- [j6]Rabia Nessah, Farouk Yalaoui, Chengbin Chu:
A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates. Comput. Oper. Res. 35(4): 1176-1190 (2008) - [j5]Moussa Larbani, Rabia Nessah:
A note on the existence of Berge and Berge-Nash equilibria. Math. Soc. Sci. 55(2): 258-271 (2008) - 2007
- [j4]Rabia Nessah, Moussa Larbani, Tarik Tazdaït:
A note on Berge equilibrium. Appl. Math. Lett. 20(8): 926-932 (2007) - [j3]Rabia Nessah, Chengbin Chu, Farouk Yalaoui:
An exact method for Pm/sds, ri/sum(i=1, n, Ci) problem. Comput. Oper. Res. 34(9): 2840-2848 (2007) - 2005
- [j2]Rabia Nessah, Moussa Larbani:
Generalized g-quasivariational inequality. Int. J. Math. Math. Sci. 2005(21): 3373-3385 (2005) - 2001
- [j1]Moussa Larbani, Rabia Nessah:
Sur l'équilibre fort selon Berge. RAIRO Oper. Res. 35(4): 439-451 (2001)
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-04-24 23:00 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:
