default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHassene Aissi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j12]Hassene Aissi
, Ali Ridha Mahjoub:
On the minimum s-t cut problem with budget constraints. Math. Program. 203(1): 421-442 (2024)- 2023
- [j11]Hassene Aissi, Da Qi Chen, R. Ravi:
Vertex downgrading to minimize connectivity. Math. Program. 199(1): 215-249 (2023) - 2022
- [i3]Hassene Aissi, Solal Attias, Da Qi Chen, R. Ravi:
Unit Perturbations in Budgeted Spanning Tree Problems. CoRR abs/2203.03697 (2022) - 2020
- [c8]Hassene Aissi, S. Thomas McCormick, Maurice Queyranne:
Faster Algorithms for Next Breakpoint and Max Value for Parametric Global Minimum Cuts. IPCO 2020: 27-39 - [c7]Hassene Aissi, Ali Ridha Mahjoub:
On the Linear Relaxation of the s-t-cut Problem with Budget Constraints. ISCO 2020: 81-88 - [c6]Hassene Aissi, Da Qi Chen, R. Ravi:
Vertex Downgrading to Minimize Connectivity. SWAT 2020: 5:1-5:15
2010 – 2019
- 2019
- [i2]Hassene Aissi, Da Qi Chen, R. Ravi:
Downgrading to Minimize Connectivity. CoRR abs/1911.11229 (2019) - [i1]Hassene Aissi, S. Thomas McCormick, Maurice Queyranne:
Faster Algorithms for Parametric Global Minimum Cut Problems. CoRR abs/1911.11847 (2019) - 2017
- [j10]Sami Kaddani, Daniel Vanderpooten, Jean Michel Vanpeperstraete, Hassene Aissi:
Weighted sum model with partial preference information: Application to multi-objective optimization. Eur. J. Oper. Res. 260(2): 665-679 (2017) - [c5]Hassene Aissi, Ali Ridha Mahjoub, R. Ravi:
Randomized Contractions for Multiobjective Minimum Cuts. ESA 2017: 6:1-6:13 - 2016
- [j9]Hassene Aissi, Daniel Vanderpooten:
Robust capacity expansion of a network under demand uncertainty: A bi-objective approach. Networks 68(3): 185-199 (2016) - 2015
- [j8]Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne:
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs. Math. Program. 154(1-2): 3-28 (2015) - 2014
- [c4]Hassene Aissi, Ali Ridha Mahjoub, S. Thomas McCormick, Maurice Queyranne:
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts. IPCO 2014: 25-36 - 2011
- [j7]Hassene Aissi, Mohamed Ali Aloulou, Mikhail Y. Kovalyov:
Minimizing the number of late jobs on a single machine under due date uncertainty. J. Sched. 14(4): 351-360 (2011) - 2010
- [j6]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems. Discret. Optim. 7(3): 136-148 (2010) - [p1]Hassene Aissi, Bernard Roy:
Robustness in Multi-criteria Decision Aiding. Trends in Multiple Criteria Decision Analysis 2010: 87-121
2000 – 2009
- 2009
- [j5]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Min-max and min-max regret versions of combinatorial optimization problems: A survey. Eur. J. Oper. Res. 197(2): 427-438 (2009) - 2008
- [j4]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Complexity of the min-max (regret) versions of min cut problems. Discret. Optim. 5(1): 66-73 (2008) - 2007
- [j3]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Approximation of min-max and min-max regret versions of some combinatorial optimization problems. Eur. J. Oper. Res. 179(2): 281-290 (2007) - 2006
- [j2]Hassene Aissi:
Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems. 4OR 4(4): 347-350 (2006) - [c3]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Approximating Min-Max (Regret) Versions of Some Polynomial Problems. COCOON 2006: 428-438 - 2005
- [j1]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Complexity of the min-max and min-max regret assignment problems. Oper. Res. Lett. 33(6): 634-640 (2005) - [c2]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack. ESA 2005: 862-873 - [c1]Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten:
Complexity of the Min-Max (Regret) Versions of Cut Problems. ISAAC 2005: 789-798
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:11 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:
