Essec\Faculty\Model\Profile {#2233 ▼
#_id: "B00683004"
#_source: array:40 [
"bid" => "B00683004"
"academId" => "2061"
"slug" => "ljubic-ivana"
"fullName" => "Ivana LJUBIC"
"lastName" => "LJUBIC"
"firstName" => "Ivana"
"title" => array:2 [
"fr" => "Professeur"
"en" => "Professor"
]
"email" => "ljubic@essec.edu"
"status" => "ACTIF"
"campus" => "Campus de Cergy"
"departments" => []
"phone" => "+33 (0)1 34 43 97 26"
"sites" => []
"facNumber" => "2061"
"externalCvUrl" => "https://faculty.essec.edu/cv/ljubic-ivana/pdf"
"googleScholarUrl" => "https://scholar.google.com/citations?user=o1Ym0_AAAAAJ"
"facOrcId" => "https://orcid.org/0000-0002-4834-6284"
"career" => array:14 [
0 => Essec\Faculty\Model\CareerItem {#2315
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2017-10-01"
"endDate" => "2021-08-31"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other Academic Appointments"
"fr" => "Autres positions académiques"
]
"label" => array:2 [
"fr" => "Directrice Académique du programme EMBA ESSEC & Mannheim"
"en" => "Academic Director of the ESSEC & Mannheim EMBA program"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
1 => Essec\Faculty\Model\CareerItem {#2316
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2011-06-01"
"endDate" => "2015-03-31"
"isInternalPosition" => true
"type" => array:2 [
"fr" => "Positions académiques principales"
"en" => "Full-time academic appointments"
]
"label" => array:2 [
"fr" => "Professeur associé"
"en" => "Ass./Assoc. Professor. ISOR, Faculty of Business, Economics and Statistics, University of Vienna"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
2 => Essec\Faculty\Model\CareerItem {#2317
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2000-03-01"
"endDate" => "2004-10-01"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other appointments"
"fr" => "Autres positions"
]
"label" => array:2 [
"fr" => "Research and Teaching Assistant (PhD candidate)"
"en" => "Research and Teaching Assistant (PhD candidate)"
]
"institution" => array:2 [
"fr" => "TU Wien"
"en" => "TU Wien"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
3 => Essec\Faculty\Model\CareerItem {#2318
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2018-01-01"
"endDate" => "2019-01-01"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other appointments"
"fr" => "Autres positions"
]
"label" => array:2 [
"fr" => "Member of the “Task Force: future directions, strategy, evaluation”"
"en" => "Member of the “Task Force: future directions, strategy, evaluation”"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
4 => Essec\Faculty\Model\CareerItem {#2319
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2016-01-01"
"endDate" => "2018-01-01"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other Academic Appointments"
"fr" => "Autres positions académiques"
]
"label" => array:2 [
"fr" => "Membre du Comité Scientifique"
"en" => "Member of the Scientific Committee"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
5 => Essec\Faculty\Model\CareerItem {#2320
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2013-01-01"
"endDate" => "2015-01-01"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other Academic Appointments"
"fr" => "Autres positions académiques"
]
"label" => array:2 [
"fr" => "Member of the doctoral advisory board at ISOR"
"en" => "Member of the doctoral advisory board at ISOR"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
6 => Essec\Faculty\Model\CareerItem {#2321
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2007-01-01"
"endDate" => "2010-11-01"
"isInternalPosition" => true
"type" => array:2 [
"fr" => "Positions académiques principales"
"en" => "Full-time academic appointments"
]
"label" => array:2 [
"fr" => "Post-Doc Researcher & Lecturer, ISOR"
"en" => "Post-Doc Researcher & Lecturer, ISOR"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
7 => Essec\Faculty\Model\CareerItem {#2322
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2015-02-01"
"endDate" => "2015-02-01"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other Academic Appointments"
"fr" => "Autres positions académiques"
]
"label" => array:2 [
"fr" => "Professeur visitant"
"en" => "Visiting Professor"
]
"institution" => array:2 [
"fr" => "Universidad Adolfo Ibáñez"
"en" => "Universidad Adolfo Ibáñez"
]
"country" => array:2 [
"fr" => "Chili"
"en" => "Chile"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
8 => Essec\Faculty\Model\CareerItem {#2323
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2014-09-01"
"endDate" => "2014-09-01"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other Academic Appointments"
"fr" => "Autres positions académiques"
]
"label" => array:2 [
"fr" => "Professeur visitant"
"en" => "Visiting Professor"
]
"institution" => array:2 [
"fr" => "Université Paris-Dauphine, PSL"
"en" => "Université Paris-Dauphine, PSL"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
9 => Essec\Faculty\Model\CareerItem {#2324
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2012-01-01"
"endDate" => "2013-01-01"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other appointments"
"fr" => "Autres positions"
]
"label" => array:2 [
"fr" => "Professeur visitant"
"en" => "Visiting Researcher (APART Fellowship), COGA"
]
"institution" => array:2 [
"fr" => "Technische Universität Berlin"
"en" => "Technische Universität Berlin"
]
"country" => array:2 [
"fr" => "Allemagne"
"en" => "Germany"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
10 => Essec\Faculty\Model\CareerItem {#2325
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2012-03-01"
"endDate" => "2012-09-01"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other appointments"
"fr" => "Autres positions"
]
"label" => array:2 [
"fr" => "Professeur visitant"
"en" => "Visiting Researcher (APART Fellowship), Faculty of CS"
]
"institution" => array:2 [
"fr" => "TU Dortmund Universität"
"en" => "TU Dortmund Universität"
]
"country" => array:2 [
"fr" => "Allemagne"
"en" => "Germany"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
11 => Essec\Faculty\Model\CareerItem {#2326
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2011-07-01"
"endDate" => "2012-03-01"
"isInternalPosition" => true
"type" => array:2 [
"en" => "Other Academic Appointments"
"fr" => "Autres positions académiques"
]
"label" => array:2 [
"fr" => "Professeur visitant"
"en" => "Visiting Professor"
]
"institution" => array:2 [
"fr" => "University of Maryland"
"en" => "University of Maryland"
]
"country" => array:2 [
"fr" => "États-Unis"
"en" => "United States of America"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
12 => Essec\Faculty\Model\CareerItem {#2327
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2016-09-01"
"endDate" => null
"isInternalPosition" => true
"type" => array:2 [
"fr" => "Positions académiques principales"
"en" => "Full-time academic appointments"
]
"label" => array:2 [
"fr" => "Professeur"
"en" => "Professor"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
13 => Essec\Faculty\Model\CareerItem {#2328
#_index: null
#_id: null
#_source: array:7 [
"startDate" => "2015-09-01"
"endDate" => "2016-08-31"
"isInternalPosition" => true
"type" => array:2 [
"fr" => "Positions académiques principales"
"en" => "Full-time academic appointments"
]
"label" => array:2 [
"fr" => "Professeur associé"
"en" => "Associate Professor"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
]
"diplomes" => array:3 [
0 => Essec\Faculty\Model\Diplome {#2235
#_index: null
#_id: null
#_source: array:6 [
"diplome" => "DIPLOMA"
"type" => array:2 [
"fr" => "Diplômes"
"en" => "Diplomas"
]
"year" => "2004"
"label" => array:2 [
"en" => "Ph.D. in Computer Science"
"fr" => "Ph.D. en Informatique"
]
"institution" => array:2 [
"fr" => "TU Wien"
"en" => "TU Wien"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
1 => Essec\Faculty\Model\Diplome {#2237
#_index: null
#_id: null
#_source: array:6 [
"diplome" => "DIPLOMA"
"type" => array:2 [
"fr" => "Diplômes"
"en" => "Diplomas"
]
"year" => "2013"
"label" => array:2 [
"en" => "Habilitation in Operations Research"
"fr" => "Habilitation en Recherche des Opérations"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
2 => Essec\Faculty\Model\Diplome {#2234
#_index: null
#_id: null
#_source: array:6 [
"diplome" => "DIPLOMA"
"type" => array:2 [
"fr" => "Diplômes"
"en" => "Diplomas"
]
"year" => "2000"
"label" => array:2 [
"en" => "Master of Science degree (MSc), Department for Optimization and Numerical Analysis, Faculty of Mathematics
Master of Science degree (MSc), Department for Optimization and Numerical Analysis, Faculty of Mathe
"
"fr" => "Master of Science degree (MSc), Department for Optimization and Numerical Analysis, Faculty of Mathematics
Master of Science degree (MSc), Department for Optimization and Numerical Analysis, Faculty of Mathe
"
]
"institution" => array:2 [
"fr" => "University of Belgrade"
"en" => "University of Belgrade"
]
"country" => array:2 [
"fr" => "Serbie"
"en" => "Serbia"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
]
"bio" => array:2 [
"fr" => """
<p><b><a href="https://orcid.org/0000-0002-4834-6284">ORCID Ivana Ljubic</a></b></p>\n
\n
<p><a href="http://scholar.google.com/citations?user=o1Ym0_AAAAAJ&hl=en" target="_blank"><b>Google Scholar Profile</b></a> </p>\n
<p><a href="http://scholar.google.com/citations?user=o1Ym0_AAAAAJ&hl=en" target="_blank"><b>Goog
\n
<p><b><a href="https://ivanaljubic.github.io/">Personal web-site</a></b></p>\n
\n
<p>See the <b><a href="https://ivanaljubic.github.io/publications/">full publication list</a> </b>including preprints and a list of <a href="https://ivanaljubic.github.io/talks/"><b>scientific </b></a><a href="https://ivanaljubic.github.io/talks/"><b>talks</b></a>.</p>\n
<p>See the <b><a href="https://ivanaljubic.github.io/publications/">full publication list</a>&n
\n
<p><b>NEWS:</b></p>\n
\n
<ul>\n
\t<li><b><a href="https://onlinelibrary.wiley.com/page/journal/10970037/homepage/glover-klingman_prize.htm">The Glover-Klingman Prize</a> </b>for the best <a href="https://onlinelibrary.wiley.com/journal/10970037">Networks</a> paper in 2021 for the article Ivana Ljubić: <a class="issue-item__title visitable" href="https://onlinelibrary.wiley.com/doi/10.1002/net.22005" title="Solving Steiner trees: Recent advances, challenges, and perspectives">Solving Steiner trees: Recent advances, challenges, and perspectives</a>, Networks 77 (2): 177-204, 2021</li>\n
\t<li><b><a href="https://onlinelibrary.wiley.com/page/journal/10970037/homepage/glover-klingman_pri
\t<li><a href="https://www.sciencedirect.com/science/article/pii/S2192440622000028" target="_blank"><b>Marguerite Frank Award</b></a> for the best EJCO paper in 2021 for the paper <a href="https://www.sciencedirect.com/science/article/pii/S2192440621001349" target="_blank"><b>A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization</b></a>. Jointly with Thomas Kleinert, Martine Labbé, and Martin Schmidt.</li>\n
\t<li><a href="https://www.sciencedirect.com/science/article/pii/S2192440622000028" target="_blank">
\t<li>Keynote speaker: <a href="https://sites.google.com/view/cpaior2023/keynote-speakers">CPAIOR 2023</a> </li>\n
\t<li>Keynote speaker: <a href="https://sites.google.com/view/cpaior2023/keynote-speakers">CPAIOR 20
\t<li>Plenary speaker: <a href="https://www.fondation-hadamard.fr/fr/la-fmjh-soutient/recherche/home/pgmo-days/">PGMO Days 2022</a>, Nov 2022</li>\n
\t<li>Plenary speaker: <a href="https://www.fondation-hadamard.fr/fr/la-fmjh-soutient/recherche/home
\t<li>Plenary speaker: <a href="https://www.siam.org/conferences/cm/program/invited-presentations/op21-invited-presentations">SIAM Conference on Optimization</a> (OP21), July 2021 </li>\n
\t<li>Plenary speaker: <a href="https://www.siam.org/conferences/cm/program/invited-presentatio
</ul>\n
\n
<p><b>BIO:</b></p>\n
\n
<p>Ivana Ljubic is Full Professor in Operations Research at ESSEC. She teaches Decision Analysis, Optimal Decision Making, Operations Research (OR) and Business Mathematics in ESSEC MSc, PhD and Advanced Master programs. Prior to joining ESSEC in 2015, she was appointed at the University of Vienna. She also worked as Visiting Scholar/Professor at the Robert H. Smith School of Business at the University of Maryland, TU Dortmund, TU Berlin, Dauphine University, etc. From 2017 to 2019 she was Academic Director of the ESSEC EMBA program, and from 2017 to 2021 she was Academic Director of the <a href="http://executive-education.essec.edu/en/program/embas-en/essec-mannheim-emba-modular-track/" target="_blank">ESSEC & Mannheim EMBA</a> program. She has published numerous scientific articles in leading outlets and has been ranked since 2018 amongst the Top 5% of most successful business professors in Germany, Switzerland, and Austria according to <a href="https://www.forschungsmonitoring.org/ranking/bwl/authors">various publication rankings</a>. </p>\n
<p>Ivana Ljubic is Full Professor in Operations Research at ESSEC. She teaches Decision Analysis, Op
\n
<p>Ivana Ljubic has carried out consulting studies and industrial contracts for leading telecommunication providers in France and Austria. After completing her PhD in computer science, she also worked for 2 years as Financial Analyst for a Siemens spin-off (fin4cast), focusing on portfolio optimization.</p>\n
<p>Ivana Ljubic has carried out consulting studies and industrial contracts for leading telecommunic
\n
<p>Research interests of Ivana Ljubic include combinatorial optimization, optimization under uncertainty, bilevel optimization. She uses tools and methods of mixed integer (non-) linear programming, meta-heuristics and their successful combinations for solving optimization problems with applications in network design, telecommunications, transportation, logistics, routing and bioinformatics. She has published more than 70 articles in leading OR journals, including Operations Research, Management Science, Mathematical Programming, INFORMS JOC, European Journal of Operational Research.</p>\n
<p>Research interests of Ivana Ljubic include combinatorial optimization, optimization under uncerta
\n
<p>She is member of the Editorial Advisory Board for the journals European Journal of Operational Research, Computers & Operations Research, and she is Associate Editor for the journals Operations Research (since 2023), Transportation Science (since 2021), Networks (since 2020), Journal of Global Optimization (2019-2021) and Omega (2016-2020). She also served as guest-editor of journals: Discrete Applied Mathematics, European Journal of Operational Research and Annals of Operations Research.</p>\n
<p>She is member of the Editorial Advisory Board for the journals European Journal of Operational Re
\n
<p>She is co-leading the axis "<a href="http://gdrro.lip6.fr/?q=node/232">Combinatorial Optimization and Integer Programming</a>" of <a href="http://gdrro.lip6.fr/">GDR RO</a> and its working group "<a href="http://gdrro.lip6.fr/?q=node/35">Polyhedra and Combinatorial Optimization</a>" (POC). She is past chair of the <a href="http://INFORMS Telecommunication and Network Analytics">INFORMS Telecommunication and Network Analytics </a>Section. From 2010-2016 she was member of council of the INFORMS Telecommunication Section and from 2006 to 2008 she was member of the executive board of the Austrian OR Society (<a href="https://oegor.wordpress.com/">OEGOR</a>).</p>\n
<p>She is co-leading the axis "<a href="http://gdrro.lip6.fr/?q=node/232">Combinatorial Optimiz
\n
<p>She has received numerous research grants, including those from the CY Initiative of Excellence, French Ministry of Foreign Affairs (PHC program), Austrian Academy of Sciences (OEAW), Austrian Research Fund (FWF) and European Commission (ERA-NET).</p>\n
<p>She has received numerous research grants, including those from the CY Initiative of Excellence,
\n
<p><b>SOME VIDEO LECTURES:</b></p>\n
\n
<ul>\n
\t<li>Beale Lecture 2021 - panel discussion honoring <a href="https://www.lse.ac.uk/management/people/emeriti-visiting-staff/aland">Dr. Ailsa Land</a><b>, </b>the winner of Beale Medal 2019 (<a href="https://youtu.be/jBQCOSKL1ho?t=1780">video</a>)</li>\n
\t<li>Beale Lecture 2021 - panel discussion honoring <a href="https://www.lse.ac.uk/management/
\t<li>Plenary talk: <a href="https://homepage.univie.ac.at/ivana.ljubic/presentations1.html">New integer and Bilevel Formulations for the k-Vertex Cut Problem</a>,<br />\n
\t<li>Plenary talk: <a href="https://homepage.univie.ac.at/ivana.ljubic/presentations1.html">Ne
\t<a href="http://opslab.dieti.unina.it/index.php/en/laboratory?id=59">5th AIRO Young Workshop</a>, Napoli, Italy and online, February 12, 2021 (<a href="https://www.youtube.com/watch?v=LXjE8PWxaPQ&feature=youtu.be">Video Lecture</a>)</li>\n
\t<a href="http://opslab.dieti.unina.it/index.php/en/laboratory?id=59">5th AIRO Young Workshop</a>,
\t<li>Plenary talk: <a href="https://">Casting Light on the Hidden Bilevel Structure of the Capacitated Vertex Separator Problem</a>, Mixed Integer Programming Workshop 2020 Online Edition (MIP2020), May 18, 2020 (<a href="https://www.youtube.com/watch?v=dl9KW0CnQ74">Video</a>)</li>\n
\t<li>Plenary talk: <a href="https://">Casting Light on the Hidden Bilevel Structure of the Cap
\t<li>Invited Lecture: <a href="https://alop.uni-trier.de/wp-content/uploads/2020/10/ALOP_Ljubic.pdf">Branch-and-Cut Solvers for Mixed-Integer Bilevel Linear Programs</a>,<br />\n
\t<li>Invited Lecture: <a href="https://alop.uni-trier.de/wp-content/uploads/2020/10/ALOP_Ljubi
\t<a href="https://alop.uni-trier.de/event/autumn-school-on-bilevel-optimization/">Autumn School on Bilevel Optimization</a> (online), Oct 12-14, 2020, Uni Trier, Germany (Video Lecture <a href="https://www.youtube.com/watch?v=NNdY5vf80AM">Part 1</a> and <a href="https://www.youtube.com/watch?v=x1t4z7aCVEY">Part 2</a>)</li>\n
\t<a href="https://alop.uni-trier.de/event/autumn-school-on-bilevel-optimization/">Autumn School on
</ul>\n
"""
"en" => """
<p> </p>\n
\n
<p><b><a href="https://orcid.org/0000-0002-4834-6284">ORCID Ivana Ljubic</a></b></p>\n
\n
<p><a href="http://scholar.google.com/citations?user=o1Ym0_AAAAAJ&hl=en" target="_blank"><b>Google Scholar Profile</b></a> </p>\n
<p><a href="http://scholar.google.com/citations?user=o1Ym0_AAAAAJ&hl=en" target="_blank"><b>Goog
\n
<p><b><a href="https://ivanaljubic.github.io/">Personal web-site</a></b></p>\n
\n
<p>See the <b><a href="https://ivanaljubic.github.io/publications/">full publication list</a> </b>including preprints and a list of <a href="https://ivanaljubic.github.io/talks/"><b>scientific </b></a><a href="https://ivanaljubic.github.io/talks/"><b>talks</b></a>.</p>\n
<p>See the <b><a href="https://ivanaljubic.github.io/publications/">full publication list</a>&n
\n
<p><b>NEWS:</b></p>\n
\n
<ul>\n
\t<li><b><a href="https://onlinelibrary.wiley.com/page/journal/10970037/homepage/glover-klingman_prize.htm">The Glover-Klingman Prize</a> </b>for the best <a href="https://onlinelibrary.wiley.com/journal/10970037">Networks</a> paper in 2021 for the article Ivana Ljubić: <a class="issue-item__title visitable" href="https://onlinelibrary.wiley.com/doi/10.1002/net.22005" title="Solving Steiner trees: Recent advances, challenges, and perspectives">Solving Steiner trees: Recent advances, challenges, and perspectives</a>, Networks 77 (2): 177-204, 2021</li>\n
\t<li><b><a href="https://onlinelibrary.wiley.com/page/journal/10970037/homepage/glover-klingman_pri
\t<li><a href="https://www.sciencedirect.com/science/article/pii/S2192440622000028" target="_blank"><b>Marguerite Frank Award</b></a> for the best EJCO paper in 2021 for the paper <a href="https://www.sciencedirect.com/science/article/pii/S2192440621001349" target="_blank"><b>A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization</b></a>. Jointly with Thomas Kleinert, Martine Labbé, and Martin Schmidt.</li>\n
\t<li><a href="https://www.sciencedirect.com/science/article/pii/S2192440622000028" target="_blank">
\t<li>Keynote speaker: <a href="https://sites.google.com/view/cpaior2023/keynote-speakers">CPAIOR 2023</a> </li>\n
\t<li>Keynote speaker: <a href="https://sites.google.com/view/cpaior2023/keynote-speakers">CPAI
\t<li>Plenary speaker: <a href="https://www.fondation-hadamard.fr/fr/la-fmjh-soutient/recherche/home/pgmo-days/">PGMO Days 2022</a>, Nov 2022</li>\n
\t<li>Plenary speaker: <a href="https://www.fondation-hadamard.fr/fr/la-fmjh-soutient/recherche
\t<li>Plenary speaker: <a href="https://www.siam.org/conferences/cm/program/invited-presentations/op21-invited-presentations">SIAM Conference on Optimization</a> (OP21), July 2021 </li>\n
\t<li>Plenary speaker: <a href="https://www.siam.org/conferences/cm/program/invited-presentatio
</ul>\n
\n
<p><b>BIO:</b></p>\n
\n
<p>Ivana Ljubic is Full Professor in Operations Research at ESSEC. She teaches Decision Analysis, Optimal Decision Making, Operations Research (OR) and Business Mathematics in ESSEC MSc, PhD and Advanced Master programs. Prior to joining ESSEC in 2015, she was appointed at the University of Vienna. She also worked as Visiting Scholar/Professor at the Robert H. Smith School of Business at the University of Maryland, TU Dortmund, TU Berlin, Dauphine University, etc. From 2017 to 2019 she was Academic Director of the ESSEC EMBA program, and from 2017 to 2021 she was Academic Director of the <a href="http://executive-education.essec.edu/en/program/embas-en/essec-mannheim-emba-modular-track/" target="_blank">ESSEC & Mannheim EMBA</a> program. She has published numerous scientific articles in leading outlets and has been ranked since 2018 amongst the Top 5% of most successful business professors in Germany, Switzerland, and Austria according to <a href="https://www.forschungsmonitoring.org/ranking/bwl/authors">various publication rankings</a>. </p>\n
<p>Ivana Ljubic is Full Professor in Operations Research at ESSEC. She teaches Decision Analysis, Op
\n
<p>Ivana Ljubic has carried out consulting studies and industrial contracts for leading telecommunication providers in France and Austria. After completing her PhD in computer science, she also worked for 2 years as Financial Analyst for a Siemens spin-off (fin4cast), focusing on portfolio optimization.</p>\n
<p>Ivana Ljubic has carried out consulting studies and industrial contracts for leading telecommunic
\n
<p>Research interests of Ivana Ljubic include combinatorial optimization, optimization under uncertainty, bilevel optimization. She uses tools and methods of mixed integer (non-) linear programming, meta-heuristics and their successful combinations for solving optimization problems with applications in network design, telecommunications, transportation, logistics, routing and bioinformatics. She has published more than 70 articles in leading OR journals, including Operations Research, Management Science, Mathematical Programming, INFORMS JOC, European Journal of Operational Research.</p>\n
<p>Research interests of Ivana Ljubic include combinatorial optimization, optimization under uncerta
\n
<p>She is member of the Editorial Advisory Board for the journals European Journal of Operational Research, Computers & Operations Research, and she is Associate Editor for the journals Operations Research (since 2023), Transportation Science (since 2021), Networks (since 2020), Journal of Global Optimization (2019-2021) and Omega (2016-2020). She also served as guest-editor of journals: Discrete Applied Mathematics, European Journal of Operational Research and Annals of Operations Research.</p>\n
<p>She is member of the Editorial Advisory Board for the journals European Journal of Operational Re
\n
<p>She is co-leading the axis "<a href="http://gdrro.lip6.fr/?q=node/232">Combinatorial Optimization and Integer Programming</a>" of <a href="http://gdrro.lip6.fr/">GDR RO</a> and its working group "<a href="http://gdrro.lip6.fr/?q=node/35">Polyhedra and Combinatorial Optimization</a>" (POC). She is past chair of the <a href="http://INFORMS Telecommunication and Network Analytics">INFORMS Telecommunication and Network Analytics </a>Section. From 2010-2016 she was member of council of the INFORMS Telecommunication Section and from 2006 to 2008 she was member of the executive board of the Austrian OR Society (<a href="https://oegor.wordpress.com/">OEGOR</a>).</p>\n
<p>She is co-leading the axis "<a href="http://gdrro.lip6.fr/?q=node/232">Combinatorial Optimiz
\n
<p>She has received numerous research grants, including those from the CY Initiative of Excellence, French Ministry of Foreign Affairs (PHC program), Austrian Academy of Sciences (OEAW), Austrian Research Fund (FWF) and European Commission (ERA-NET).</p>\n
<p>She has received numerous research grants, including those from the CY Initiative of Excellence,
\n
<p><b>SOME VIDEO LECTURES:</b></p>\n
\n
<ul>\n
\t<li>Beale Lecture 2021 - panel discussion honoring <a href="https://www.lse.ac.uk/management/people/emeriti-visiting-staff/aland">Dr. Ailsa Land</a><b>, </b>the winner of Beale Medal 2019 (<a href="https://youtu.be/jBQCOSKL1ho?t=1780">video</a>)</li>\n
\t<li>Beale Lecture 2021 - panel discussion honoring <a href="https://www.lse.ac.uk/management/
\t<li>Plenary talk: <a href="https://homepage.univie.ac.at/ivana.ljubic/presentations1.html">New integer and Bilevel Formulations for the k-Vertex Cut Problem</a>,<br />\n
\t<li>Plenary talk: <a href="https://homepage.univie.ac.at/ivana.ljubic/presentations1.html">Ne
\t<a href="http://opslab.dieti.unina.it/index.php/en/laboratory?id=59">5th AIRO Young Workshop</a>, Napoli, Italy and online, February 12, 2021 (<a href="https://www.youtube.com/watch?v=LXjE8PWxaPQ&feature=youtu.be">Video Lecture</a>)</li>\n
\t<a href="http://opslab.dieti.unina.it/index.php/en/laboratory?id=59">5th AIRO Young Workshop</a>,
\t<li>Plenary talk: <a href="https://">Casting Light on the Hidden Bilevel Structure of the Capacitated Vertex Separator Problem</a>, Mixed Integer Programming Workshop 2020 Online Edition (MIP2020), May 18, 2020 (<a href="https://www.youtube.com/watch?v=dl9KW0CnQ74">Video</a>)</li>\n
\t<li>Plenary talk: <a href="https://">Casting Light on the Hidden Bilevel Structure of the Cap
\t<li>Invited Lecture: <a href="https://alop.uni-trier.de/wp-content/uploads/2020/10/ALOP_Ljubic.pdf">Branch-and-Cut Solvers for Mixed-Integer Bilevel Linear Programs</a>,<br />\n
\t<li>Invited Lecture: <a href="https://alop.uni-trier.de/wp-content/uploads/2020/10/ALOP_Ljubi
\t<a href="https://alop.uni-trier.de/event/autumn-school-on-bilevel-optimization/">Autumn School on Bilevel Optimization</a> (online), Oct 12-14, 2020, Uni Trier, Germany (Video Lecture <a href="https://www.youtube.com/watch?v=NNdY5vf80AM">Part 1</a> and <a href="https://www.youtube.com/watch?v=x1t4z7aCVEY">Part 2</a>)</li>\n
\t<a href="https://alop.uni-trier.de/event/autumn-school-on-bilevel-optimization/">Autumn School on
</ul>\n
"""
]
"department" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"site" => array:2 [
"fr" => "https://ivanaljubic.github.io"
"en" => "https://ivanaljubic.github.io"
]
"industrrySectors" => array:2 [
"fr" => "Services de télécommunications - Logistique"
"en" => "Telecommunication Services - Logistics"
]
"researchFields" => array:2 [
"fr" => "Recherche opérationnelle - Planification et optimisation - Mathématiques - Gestion des approvisionnements - Intelligence artificielle (IA)
Recherche opérationnelle - Planification et optimisation - Mathématiques - Gestion des approvisionne
"
"en" => "Operations Research - Scheduling, Queueing and Location Optimization - Mathematics - Supply Chain Management - Artificial Intelligence (AI)
Operations Research - Scheduling, Queueing and Location Optimization - Mathematics - Supply Chain Ma
"
]
"teachingFields" => array:2 [
"fr" => "Recherche opérationnelle - Planification et optimisation - Gestion des approvisionnements - Sciences de la décision
Recherche opérationnelle - Planification et optimisation - Gestion des approvisionnements - Sciences
"
"en" => "Operations Research - Scheduling, Queueing and Location Optimization - Supply Chain Management - Decision Sciences
Operations Research - Scheduling, Queueing and Location Optimization - Supply Chain Management - Dec
"
]
"distinctions" => array:21 [
0 => Essec\Faculty\Model\Distinction {#2329
#_index: null
#_id: null
#_source: array:6 [
"date" => "2017-01-01"
"label" => array:2 [
"fr" => "Co-applicant Prescriptive Analytics – Operations research, Initiative d’Excellence Paris Seine"
"en" => "Co-applicant Prescriptive Analytics – Operations research, Initiative d’Excellence Paris Seine"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
1 => Essec\Faculty\Model\Distinction {#2330
#_index: null
#_id: null
#_source: array:6 [
"date" => "2015-01-01"
"label" => array:2 [
"fr" => "Co-PI Optimization and Analysis of Large-Scale Networks (ICT 2015) WWTF"
"en" => "Co-PI Optimization and Analysis of Large-Scale Networks (ICT 2015) WWTF"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
2 => Essec\Faculty\Model\Distinction {#2331
#_index: null
#_id: null
#_source: array:6 [
"date" => "2014-01-01"
"label" => array:2 [
"fr" => "Co-applicant: e4-share: Models for Ecological, Economical, Efficient, Electric Car-Sharing, JPI Urban Europe
Co-applicant: e4-share: Models for Ecological, Economical, Efficient, Electric Car-Sharing, JPI Urba
"
"en" => "Co-applicant: e4-share: Models for Ecological, Economical, Efficient, Electric Car-Sharing, JPI Urban Europe
Co-applicant: e4-share: Models for Ecological, Economical, Efficient, Electric Car-Sharing, JPI Urba
"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
3 => Essec\Faculty\Model\Distinction {#2332
#_index: null
#_id: null
#_source: array:6 [
"date" => "2014-01-01"
"label" => array:2 [
"fr" => "Applicant and leader (PI): Network Optimization in Bioinformatics and Systems Biology, FWF"
"en" => "Applicant and leader (PI): Network Optimization in Bioinformatics and Systems Biology, FWF"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
4 => Essec\Faculty\Model\Distinction {#2333
#_index: null
#_id: null
#_source: array:6 [
"date" => "2012-01-01"
"label" => array:2 [
"fr" => "Applicant and leader (PI) of the Austrian team: Multi-Criteria Optimization of FTTx Networks, (DACH programme, cooperation with the TU Wien and ZIB Berlin), FWF & DFG
Applicant and leader (PI) of the Austrian team: Multi-Criteria Optimization of FTTx Networks, (DACH
"
"en" => "Applicant and leader (PI) of the Austrian team: Multi-Criteria Optimization of FTTx Networks, (DACH programme, cooperation with the TU Wien and ZIB Berlin), FWF & DFG
Applicant and leader (PI) of the Austrian team: Multi-Criteria Optimization of FTTx Networks, (DACH
"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
5 => Essec\Faculty\Model\Distinction {#2334
#_index: null
#_id: null
#_source: array:6 [
"date" => "2011-01-01"
"label" => array:2 [
"fr" => "Applicant and leader (PI): Network Design Under Uncertainty: Algorithmic Aspects of Stochastic and Robust Optimization (APART programme), OEAW
Applicant and leader (PI): Network Design Under Uncertainty: Algorithmic Aspects of Stochastic and R
"
"en" => "Applicant and leader (PI): Network Design Under Uncertainty: Algorithmic Aspects of Stochastic and Robust Optimization (APART programme), OEAW
Applicant and leader (PI): Network Design Under Uncertainty: Algorithmic Aspects of Stochastic and R
"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
6 => Essec\Faculty\Model\Distinction {#2335
#_index: null
#_id: null
#_source: array:6 [
"date" => "2011-01-01"
"label" => array:2 [
"fr" => "Member of the graduate school in Computational Optimization (Initiativkolleg programme), University of Vienna
Member of the graduate school in Computational Optimization (Initiativkolleg programme), University
"
"en" => "Member of the graduate school in Computational Optimization (Initiativkolleg programme), University of Vienna
Member of the graduate school in Computational Optimization (Initiativkolleg programme), University
"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
7 => Essec\Faculty\Model\Distinction {#2336
#_index: null
#_id: null
#_source: array:6 [
"date" => "2010-01-01"
"label" => array:2 [
"fr" => "Applicant and leader (PI) of the Austrian team: Flow Projection Results in Telecommunication: Models and Algorithms (Acciones Integradas programme, in cooperation with the University of La Laguna, Spain), OEAD (Austrian exchange service)
Applicant and leader (PI) of the Austrian team: Flow Projection Results in Telecommunication: Models
"
"en" => "Applicant and leader (PI) of the Austrian team: Flow Projection Results in Telecommunication: Models and Algorithms (Acciones Integradas programme, in cooperation with the University of La Laguna, Spain), OEAD (Austrian exchange service)
Applicant and leader (PI) of the Austrian team: Flow Projection Results in Telecommunication: Models
"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
8 => Essec\Faculty\Model\Distinction {#2337
#_index: null
#_id: null
#_source: array:6 [
"date" => "2007-01-01"
"label" => array:2 [
"fr" => "Applicant and leader (PI): Algorithmic Solutions for Last-Mile Networks, (Hertha-Firnberg programme), FWF
Applicant and leader (PI): Algorithmic Solutions for Last-Mile Networks, (Hertha-Firnberg programme)
"
"en" => "Applicant and leader (PI): Algorithmic Solutions for Last-Mile Networks, (Hertha-Firnberg programme), FWFApplicant and leader (PI): Algorithmic Solutions for Last-Mile Networks, (Hertha-Firnberg programme), FWF
Applicant and leader (PI): Algorithmic Solutions for Last-Mile Networks, (Hertha-Firnberg programme)
"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
9 => Essec\Faculty\Model\Distinction {#2338
#_index: null
#_id: null
#_source: array:6 [
"date" => "2007-01-01"
"label" => array:2 [
"fr" => "Applicant and leader (one of two PIs): Algorithmic Solutions for Optimal Design of Telecommunication Networks, (Bridge programme, cooperation with Telekom Austria AG), FFG
Applicant and leader (one of two PIs): Algorithmic Solutions for Optimal Design of Telecommunication
"
"en" => "Applicant and leader (one of two PIs): Algorithmic Solutions for Optimal Design of Telecommunication Networks, (Bridge programme, cooperation with Telekom Austria AG), FFG
Applicant and leader (one of two PIs): Algorithmic Solutions for Optimal Design of Telecommunication
"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
10 => Essec\Faculty\Model\Distinction {#2339
#_index: null
#_id: null
#_source: array:6 [
"date" => "2003-01-01"
"label" => array:2 [
"fr" => "Applicant and leader (PI): Combinatorial and Memetic Algorithms for Selected Network Design Problems (DOC programme). OEAW
Applicant and leader (PI): Combinatorial and Memetic Algorithms for Selected Network Design Problems
"
"en" => "Applicant and leader (PI): Combinatorial and Memetic Algorithms for Selected Network Design Problems (DOC programme). OEAW
Applicant and leader (PI): Combinatorial and Memetic Algorithms for Selected Network Design Problems
"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
11 => Essec\Faculty\Model\Distinction {#2340
#_index: null
#_id: null
#_source: array:6 [
"date" => "2016-03-01"
"label" => array:2 [
"fr" => "Ivana Ljubic a reçu le Best Paper Award au congrès : "INFORMS Telecommunications Conference 2016" pour son article : S. Chen, I. Ljubic, S. Raghavan: The Generalized Regenerator Location Problem, INFORMS Journal on Computing 27(2): 204 - 220, 2015.
Ivana Ljubic a reçu le Best Paper Award au congrès : "INFORMS Telecommunications Conference 2016" po
"
"en" => "Best Paper Award, INFORMS Telecommunications Conference 2016, for the paper "The Generalized Regenerator Location Problem, INFORMS Journal on Computing 27(2): 204 - 220, 2015, (coauthored with S. Chen, I. Ljubic, S. Raghavan)
Best Paper Award, INFORMS Telecommunications Conference 2016, for the paper "The Generalized Regener
"
]
"type" => array:2 [
"fr" => "Prix"
"en" => "Awards"
]
"tri" => " 1 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
12 => Essec\Faculty\Model\Distinction {#2341
#_index: null
#_id: null
#_source: array:6 [
"date" => "2014-01-01"
"label" => array:2 [
"fr" => "Gagnante du challenge d'implémentation DIMACS sur les arbres de Steiner (avec M. Fischetti et al.)"
"en" => "Winner of the DIMACS implementation challenge on Steiner trees (with M. Fischetti et al.)"
]
"type" => array:2 [
"fr" => "Prix"
"en" => "Awards"
]
"tri" => " 1 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
13 => Essec\Faculty\Model\Distinction {#2342
#_index: null
#_id: null
#_source: array:6 [
"date" => "2005-01-01"
"label" => array:2 [
"fr" => "Prix PhD award de l'Austrian Society for Operations Research"
"en" => "PhD award of Austrian Society for Operations Research"
]
"type" => array:2 [
"fr" => "Prix"
"en" => "Awards"
]
"tri" => " 1 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
14 => Essec\Faculty\Model\Distinction {#2343
#_index: null
#_id: null
#_source: array:6 [
"date" => "2021-12-31"
"label" => array:2 [
"fr" => "The Glover-Klingman Prize for the best Networks paper in 2021"
"en" => "The Glover-Klingman Prize for the best Networks paper in 2021 The Glover-Klingman Prize for the best Networks paper in 2021 for the article Ivana Ljubić: Solving Steiner trees: Recent advances, challenges, and perspectives, Networks 77 (2): 177-204, 2021
The Glover-Klingman Prize for the best Networks paper in 2021 The Glover-Klingman Prize for the best
"
]
"type" => array:2 [
"fr" => "Prix"
"en" => "Awards"
]
"tri" => " 1 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
15 => Essec\Faculty\Model\Distinction {#2344
#_index: null
#_id: null
#_source: array:6 [
"date" => "2022-01-01"
"label" => array:2 [
"fr" => "Marguerite Frank Award for the best EJCO paper in 2021 for the paper A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization. Jointly with Thomas Kleinert, Martine Labbé, and Martin Schmidt
Marguerite Frank Award for the best EJCO paper in 2021 for the paper A Survey on Mixed-Integer Progr
"
"en" => "Marguerite Frank Award for the best EJCO paper in 2021 for the paper A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization. Jointly with Thomas Kleinert, Martine Labbé, and Martin Schmidt
Marguerite Frank Award for the best EJCO paper in 2021 for the paper A Survey on Mixed-Integer Progr
"
]
"type" => array:2 [
"fr" => "Prix"
"en" => "Awards"
]
"tri" => " 1 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
16 => Essec\Faculty\Model\Distinction {#2345
#_index: null
#_id: null
#_source: array:6 [
"date" => "2014-01-01"
"label" => array:2 [
"fr" => "Finaliste du Best Paper Award de l'INFORMS Telecommunication Section (avec L. Gouveia, M. Leitner)"
"en" => "Finalist for the best paper award of the INFORMS Telecommunication Section (with L. Gouveia, M. Leitner)
Finalist for the best paper award of the INFORMS Telecommunication Section (with L. Gouveia, M. Leit
"
]
"type" => array:2 [
"fr" => "Prix"
"en" => "Awards"
]
"tri" => " 1 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
17 => Essec\Faculty\Model\Distinction {#2346
#_index: null
#_id: null
#_source: array:6 [
"date" => "2011-01-01"
"label" => array:2 [
"fr" => "APART Fellowship à l'Austrian Academy of Sciences"
"en" => "APART Fellowship of the Austrian Academy of Sciences"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
18 => Essec\Faculty\Model\Distinction {#2347
#_index: null
#_id: null
#_source: array:6 [
"date" => "2007-01-01"
"label" => array:2 [
"fr" => "Hertha-Firnberg Post-Doc Fellowship de l'Austrian Science Fund"
"en" => "Hertha-Firnberg Post-Doc Fellowship of the Austrian Science Fund"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
19 => Essec\Faculty\Model\Distinction {#2348
#_index: null
#_id: null
#_source: array:6 [
"date" => "2003-01-01"
"label" => array:2 [
"fr" => "PhD Fellowship de l'Austrian Academy of Sciences"
"en" => "PhD Fellowship of Austrian Academy of Sciences"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
20 => Essec\Faculty\Model\Distinction {#2349
#_index: null
#_id: null
#_source: array:6 [
"date" => "2002-01-01"
"label" => array:2 [
"fr" => "Doctoral Scholarship Programme of the OEAW (DOC Programme)"
"en" => "Doctoral Scholarship Programme of the OEAW (DOC Programme)"
]
"type" => array:2 [
"fr" => "Bourses"
"en" => "Grants"
]
"tri" => " 2 "
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
]
"teaching" => array:12 [
0 => Essec\Faculty\Model\TeachingItem {#2303
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => null
"program" => null
"label" => array:2 [
"fr" => "Alborz Hassanzadeh, ESSEC (avec L. Alfandari)"
"en" => "Alborz Hassanzadeh, ESSEC (avec L. Alfandari)"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
1 => Essec\Faculty\Model\TeachingItem {#2304
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => null
"program" => null
"label" => array:2 [
"fr" => "Georg Brandstätter, University of Vienna (avec M. Leitner)"
"en" => "Georg Brandstätter, University of Vienna (avec M. Leitner)"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
}
2 => Essec\Faculty\Model\TeachingItem {#2305
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => null
"program" => null
"label" => array:2 [
"fr" => "Ahlam Mouaci, University Paris Dauphine"
"en" => "Ahlam Mouaci, University Paris Dauphine"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université Paris-Dauphine, PSL"
"en" => "Université Paris-Dauphine, PSL"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
3 => Essec\Faculty\Model\TeachingItem {#2312
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2019"
"program" => null
"label" => array:2 [
"fr" => "Marcos de Melo da Silva, ESSEC"
"en" => "Marcos de Melo da Silva, ESSEC"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
}
4 => Essec\Faculty\Model\TeachingItem {#2306
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2017"
"program" => null
"label" => array:2 [
"fr" => "Martin Luipersbeck, University of Vienna (Finalist for the EURO Doctoral Dissertation Award 2018) (avec M. Leitner)
Martin Luipersbeck, University of Vienna (Finalist for the EURO Doctoral Dissertation Award 2018) (a
"
"en" => "Martin Luipersbeck, University of Vienna (Finalist for the EURO Doctoral Dissertation Award 2018) (avec M. Leitner)
Martin Luipersbeck, University of Vienna (Finalist for the EURO Doctoral Dissertation Award 2018) (a
"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
}
5 => Essec\Faculty\Model\TeachingItem {#2307
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2015"
"program" => null
"label" => array:2 [
"fr" => "Markus Sinnl, University of Vienna (OEGOR Dissertation Award 2016 and INFORMS SOLA Dissertation Award 2016) (avec I. Bomze)
Markus Sinnl, University of Vienna (OEGOR Dissertation Award 2016 and INFORMS SOLA Dissertation Awar
"
"en" => "Markus Sinnl, University of Vienna (OEGOR Dissertation Award 2016 and INFORMS SOLA Dissertation Award 2016) (avec I. Bomze)
Markus Sinnl, University of Vienna (OEGOR Dissertation Award 2016 and INFORMS SOLA Dissertation Awar
"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
}
6 => Essec\Faculty\Model\TeachingItem {#2313
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2015"
"program" => null
"label" => array:2 [
"fr" => "Markus Leitner, Univ. of Vienna (désormais à Vrije Universiteit Amsterdam)"
"en" => "Markus Leitner, Univ. of Vienna (désormais à Vrije Universiteit Amsterdam)"
]
"type" => array:2 [
"fr" => "Directeur de thèse"
"en" => "Thesis director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
}
7 => Essec\Faculty\Model\TeachingItem {#2308
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2014"
"program" => null
"label" => array:2 [
"fr" => "Eduardo Álvarez-Miranda, University of Bologna (co-supervisé avec P. Toth)"
"en" => "Eduardo Álvarez-Miranda, University of Bologna (co-supervisé avec P. Toth)"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "University of Bologna"
"en" => "University of Bologna"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "fr"
}
8 => Essec\Faculty\Model\TeachingItem {#2309
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2013"
"program" => null
"label" => array:2 [
"fr" => "Stefan Gollowitzer (OEGOR Dissertation Award 2013), University of Vienna (avec I. Bomze)"
"en" => "Stefan Gollowitzer (OEGOR Dissertation Award 2013), University of Vienna (avec I. Bomze)"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
}
9 => Essec\Faculty\Model\TeachingItem {#2310
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2013"
"program" => null
"label" => array:2 [
"fr" => "Peter Putz, University of Vienna (avec I. Bomze)"
"en" => "Peter Putz, University of Vienna (avec I. Bomze)"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
}
10 => Essec\Faculty\Model\TeachingItem {#2311
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2013"
"program" => null
"label" => array:2 [
"fr" => "Bertram Wassermann, University of Vienna (avec I. Bomze)"
"en" => "Bertram Wassermann, University of Vienna (avec I. Bomze)"
]
"type" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
}
11 => Essec\Faculty\Model\TeachingItem {#2314
#_index: null
#_id: null
#_source: array:7 [
"startDate" => null
"endDate" => "2013"
"program" => null
"label" => array:2 [
"fr" => "Christina Büsing, Univ. of Vienna (now at RWTH Aachen)"
"en" => "Christina Büsing, Univ. of Vienna (now at RWTH Aachen)"
]
"type" => array:2 [
"fr" => "Directeur de thèse"
"en" => "Thesis director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
}
]
"otherActivities" => array:67 [
0 => Essec\Faculty\Model\ExtraActivity {#2238
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2015-09-01"
"endDate" => "2015-09-04"
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "“Operations Research 2015” conference"
"en" => "“Operations Research 2015” conference"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
1 => Essec\Faculty\Model\ExtraActivity {#2232
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2014-01-01"
"endDate" => "2014-12-31"
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "Atelier de travail “Recent Advances in Multi-Objective Optimization”"
"en" => "Workshop “Recent Advances in Multi-Objective Optimization”"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
2 => Essec\Faculty\Model\ExtraActivity {#2236
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2014-01-01"
"endDate" => "2014-12-31"
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "Atelier de travail “Routing and Networks”"
"en" => "Workshop “Routing and Networks”"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
3 => Essec\Faculty\Model\ExtraActivity {#2239
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2016-01-01"
"endDate" => "2016-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Membre du comité de programme : European Conference on Operational Research, EURO 2016, Poznan"
"en" => "Program committee member : European Conference on Operational Research, EURO 2016, Poznan"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Pologne"
"en" => "Poland"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
4 => Essec\Faculty\Model\ExtraActivity {#2240
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2015-01-01"
"endDate" => "2015-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Membre du comité de programme : International Network Optimization Conference, INOC 2015, Varsovie"
"en" => "Program committee member : International Network Optimization Conference, INOC 2015, Warsaw"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Pologne"
"en" => "Poland"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
5 => Essec\Faculty\Model\ExtraActivity {#2241
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2014-01-01"
"endDate" => "2014-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Membre du comité de programme : International Symposium on Combinatorial Optimization, ISCO 2014, Lisbonne
Membre du comité de programme : International Symposium on Combinatorial Optimization, ISCO 2014, Li
"
"en" => "Program committee member : International Symposium on Combinatorial Optimization, ISCO 2014, Lisbon"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Portugal"
"en" => "Portugal"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
6 => Essec\Faculty\Model\ExtraActivity {#2242
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2014-01-01"
"endDate" => "2014-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Comité de Programme : INFORMS Telecommunication Conference 2014, Lisbonne"
"en" => "Program Committee : INFORMS Telecommunication Conference 2014, Lisbon"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Portugal"
"en" => "Portugal"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
7 => Essec\Faculty\Model\ExtraActivity {#2243
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2007-01-01"
"endDate" => "2010-01-01"
"year" => null
"uuid" => "502"
"type" => array:2 [
"fr" => "Activités professionnelles"
"en" => "Professional activities"
]
"subType" => array:2 [
"fr" => "Consulting"
"en" => "Consulting"
]
"label" => array:2 [
"fr" => "OptTelNets, projet réalisé avec Telecom Austria A1"
"en" => "OptTelNets, project with Telecom Austria A1"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
8 => Essec\Faculty\Model\ExtraActivity {#2244
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2018-01-01"
"endDate" => null
"year" => null
"uuid" => "202"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Fonction dans une association académique"
"en" => "Function in an academic association"
]
"label" => array:2 [
"fr" => "Présidente de la division Telecommunication & Network Analytics d'INFORMS"
"en" => "INFORMS Telecommunication & Network Analytics Section, Chair"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
9 => Essec\Faculty\Model\ExtraActivity {#2245
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2006-01-01"
"endDate" => "2008-12-31"
"year" => null
"uuid" => "202"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Fonction dans une association académique"
"en" => "Function in an academic association"
]
"label" => array:2 [
"fr" => "Membre du conseil d'administration de l'Austrian Society of Operations Research OEGOR"
"en" => "Member of the executive board of the Austrian Society of Operations Research OEGOR"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
10 => Essec\Faculty\Model\ExtraActivity {#2246
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2016-12-01"
"endDate" => "2021-12-31"
"year" => "2016"
"uuid" => "102"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Co-direction d'une revue - Co-rédacteur en chef"
"en" => "Senior or Associate Editor"
]
"label" => array:2 [
"fr" => "Co-Rédacteur en chef - Omega"
"en" => "Associate editor - Omega"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
11 => Essec\Faculty\Model\ExtraActivity {#2247
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2016-01-01"
"endDate" => null
"year" => "2016"
"uuid" => "103"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Membre d'un comité de lecture"
"en" => "Editorial Board Membership"
]
"label" => array:2 [
"fr" => "Membre du comité de lecture - Computers & Operations Research"
"en" => "Editorial board membership - Computers & Operations Research"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
12 => Essec\Faculty\Model\ExtraActivity {#2248
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2018-01-01"
"endDate" => null
"year" => "2018"
"uuid" => "103"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Membre d'un comité de lecture"
"en" => "Editorial Board Membership"
]
"label" => array:2 [
"fr" => "Membre du comité de lecture - European Journal of Operational Research"
"en" => "Editorial board membership - European Journal of Operational Research"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
13 => Essec\Faculty\Model\ExtraActivity {#2249
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2019-01-01"
"endDate" => null
"year" => "2020"
"uuid" => "102"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Co-direction d'une revue - Co-rédacteur en chef"
"en" => "Senior or Associate Editor"
]
"label" => array:2 [
"fr" => "Editeur associée"
"en" => "Associate Editor - Networks"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
14 => Essec\Faculty\Model\ExtraActivity {#2250
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2019-11-21"
"endDate" => "2019-11-22"
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "Autumn school on advanced BCP tools: VRPSolver and Coluna"
"en" => "Autumn school on advanced BCP tools: VRPSolver and ColunaAutumn school on advanced BCP tools: VRPSolver and Coluna
Autumn school on advanced BCP tools: VRPSolver and ColunaAutumn school on advanced BCP tools: VRPSol
"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
15 => Essec\Faculty\Model\ExtraActivity {#2251
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2019-03-27"
"endDate" => "2019-03-27"
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "Optimization and Data Science"
"en" => "Optimization and Data Science"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
16 => Essec\Faculty\Model\ExtraActivity {#2252
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2019-06-01"
"endDate" => "2019-06-30"
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "EURO 2019 Conference, Stream “Network Analytics and Optimization”"
"en" => "EURO 2019 Conference, Stream “Network Analytics and Optimization”"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Irlande"
"en" => "Ireland"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
17 => Essec\Faculty\Model\ExtraActivity {#2253
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2018-12-20"
"endDate" => "2018-12-21"
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "Optimization, Games and Data Analysis” Workshop (OGDA2018)"
"en" => "Optimization, Games and Data Analysis” Workshop (OGDA2018)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
18 => Essec\Faculty\Model\ExtraActivity {#2254
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2018-12-14"
"endDate" => "2018-12-14"
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "“Machine Learning, Networks and Combinatorial Optimization” Workshop"
"en" => "“Machine Learning, Networks and Combinatorial Optimization” Workshop"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
19 => Essec\Faculty\Model\ExtraActivity {#2255
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2018-06-18"
"endDate" => "2018-06-20"
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "“Cologne-Twente Workshop 2018” (CTW2018)"
"en" => "“Cologne-Twente Workshop 2018” (CTW2018)"
]
"institution" => array:2 [
"fr" => "Conservatoire National des Arts & Métiers (CNAM)"
"en" => "Conservatoire National des Arts & Métiers (CNAM)"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
20 => Essec\Faculty\Model\ExtraActivity {#2256
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2014-03-02"
"endDate" => "2014-03-04"
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "INFORMS Telecommunication Conference 2014"
"en" => "INFORMS Telecommunication Conference 2014"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Portugal"
"en" => "Portugal"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
21 => Essec\Faculty\Model\ExtraActivity {#2257
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2014-01-01"
"endDate" => "2014-12-31"
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "IFORS 2014"
"en" => "IFORS 2014"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Espagne"
"en" => "Spain"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
22 => Essec\Faculty\Model\ExtraActivity {#2258
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2013-01-01"
"endDate" => "2013-12-31"
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "Workshop “Optimization Tools for Next Generation Telecommunication Networks”"
"en" => "Workshop “Optimization Tools for Next Generation Telecommunication Networks”"
]
"institution" => array:2 [
"fr" => "Austrian Academy of Sciences"
"en" => "Austrian Academy of Sciences"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
23 => Essec\Faculty\Model\ExtraActivity {#2259
#_index: null
#_id: null
#_source: array:9 [
"startDate" => null
"endDate" => null
"year" => null
"uuid" => "104"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Reviewer pour un journal"
"en" => "Reviewer for a journal"
]
"label" => array:2 [
"fr" => "Relecteur pour 4OR: A Quarterly Journal of Operations Research; Annals of Operations Research; Computational Management Science; Computational Optimization and Applications; Computers & Operations Research; Discrete Applied Mathematics; Discrete Optimization; European Journal of Operational Research; European Journal on Computational Optimization; Evolutionary Computation; IEEE Transactions on Evolutionary Computation; IIE Transactions; INFOR; INFORMS Journal on Computing; International Transactions in Operational Research; Journal of Combinatorial Optimization; Journal of Global Optimization; Journal of Heuristics; Management Science; Mathematical Methods of Operations Research; Mathematical Programming; Networks; Omega; Operations Research; Operations Research Letters; Optimization Letters; OR Spektrum; Plos One; SIAM Journal on Optimization; Transportation Science
Relecteur pour 4OR: A Quarterly Journal of Operations Research; Annals of Operations Research; Compu
"
"en" => "Reviewer for 4OR: A Quarterly Journal of Operations Research; Annals of Operations Research; Computational Management Science; Computational Optimization and Applications; Computers & Operations Research; Discrete Applied Mathematics; Discrete Optimization; European Journal of Operational Research; European Journal on Computational Optimization; Evolutionary Computation; IEEE Transactions on Evolutionary Computation; IIE Transactions; INFOR; INFORMS Journal on Computing; International Transactions in Operational Research; Journal of Combinatorial Optimization; Journal of Global Optimization; Journal of Heuristics; Management Science; Mathematical Methods of Operations Research; Mathematical Programming; Networks; Omega; Operations Research; Operations Research Letters; Optimization Letters; OR Spektrum; Plos One; SIAM Journal on Optimization; Transportation Science
Reviewer for 4OR: A Quarterly Journal of Operations Research; Annals of Operations Research; Computa
"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
24 => Essec\Faculty\Model\ExtraActivity {#2260
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2018-01-01"
"endDate" => "2018-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Relecteur pour Integer Programming and Combinatorial Optimization (IPCO 2018)"
"en" => "Reviewer for Integer Programming and Combinatorial Optimization (IPCO 2018)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
25 => Essec\Faculty\Model\ExtraActivity {#2261
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2014-01-01"
"endDate" => "2014-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Relecteur pour Integer Programming and Combinatorial Optimization (IPCO 2014)"
"en" => "Reviewer for Integer Programming and Combinatorial Optimization (IPCO 2014)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
26 => Essec\Faculty\Model\ExtraActivity {#2262
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2013-01-01"
"endDate" => "2013-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Relecteur pour International Symposium on Experimental Algorithms (SEA 2013)"
"en" => "Reviewer for International Symposium on Experimental Algorithms (SEA 2013)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
27 => Essec\Faculty\Model\ExtraActivity {#2263
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2012-01-01"
"endDate" => "2012-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Relecteur pour International Colloquium on Automata, Languages and Programming (ICALP 2011)"
"en" => "Reviewer for International Colloquium on Automata, Languages and Programming (ICALP 2011)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
28 => Essec\Faculty\Model\ExtraActivity {#2264
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2011-01-01"
"endDate" => "2011-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Relecteur pour European Symposia on Algorithms (ESA 2011)"
"en" => "Reviewer for European Symposia on Algorithms (ESA 2011)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
29 => Essec\Faculty\Model\ExtraActivity {#2265
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2009-01-01"
"endDate" => "2009-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Relecteur pour International Network Optimization Conference (INOC 2009)"
"en" => "Reviewer for International Network Optimization Conference (INOC 2009)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
30 => Essec\Faculty\Model\ExtraActivity {#2266
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2002-01-01"
"endDate" => "2002-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Relecteur pour Graph Drawing (GD 2002)"
"en" => "Reviewer for Graph Drawing (GD 2002)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
31 => Essec\Faculty\Model\ExtraActivity {#2267
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2002-01-01"
"endDate" => "2002-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Relecteur pour European Symposia on Algorithms (ESA 2002)"
"en" => "Reviewer for European Symposia on Algorithms (ESA 2002)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
32 => Essec\Faculty\Model\ExtraActivity {#2268
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2001-01-01"
"endDate" => "2001-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Relecteur pour European Symposia on Algorithms (ESA 2001)"
"en" => "Reviewer for European Symposia on Algorithms (ESA 2001)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
33 => Essec\Faculty\Model\ExtraActivity {#2269
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2019-01-01"
"endDate" => "2019-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Relecteur pour DFG (Deutsche Forschungsgemeinschaft)"
"en" => "Reviewer for DFG (Deutsche Forschungsgemeinschaft)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Allemagne"
"en" => "Germany"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
34 => Essec\Faculty\Model\ExtraActivity {#2270
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2017-01-01"
"endDate" => "2017-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Relecteur pour FONDECYT (Fondo Nacional de Desarrollo Científico y Tecnológico)"
"en" => "Reviewer for FONDECYT (Fondo Nacional de Desarrollo Científico y Tecnológico)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Chili"
"en" => "Chile"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
35 => Essec\Faculty\Model\ExtraActivity {#2271
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2015-01-01"
"endDate" => "2015-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Relecteur pour FONDECYT (Fondo Nacional de Desarrollo Científico y Tecnológico)"
"en" => "Reviewer for FONDECYT (Fondo Nacional de Desarrollo Científico y Tecnológico)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Chili"
"en" => "Chile"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
36 => Essec\Faculty\Model\ExtraActivity {#2272
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2012-01-01"
"endDate" => "2012-12-31"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Relecteur pour FONDECYT (Fondo Nacional de Desarrollo Científico y Tecnológico)"
"en" => "Reviewer for FONDECYT (Fondo Nacional de Desarrollo Científico y Tecnológico)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => "Chili"
"en" => "Chile"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
37 => Essec\Faculty\Model\ExtraActivity {#2273
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2017-01-01"
"endDate" => "2021-12-31"
"year" => null
"uuid" => "102"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Co-direction d'une revue - Co-rédacteur en chef"
"en" => "Senior or Associate Editor"
]
"label" => array:2 [
"fr" => "Associate Editor - Journal of Global Optimization"
"en" => "Associate Editor - Journal of Global Optimization"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
38 => Essec\Faculty\Model\ExtraActivity {#2274
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2019-01-01"
"endDate" => null
"year" => null
"uuid" => "201"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Organisation d'une conférence ou d'un séminaire"
"en" => "Organization of a conference or a seminar"
]
"label" => array:2 [
"fr" => "Member of Editorial Advisory Board - SN Operations Research Forum"
"en" => "Member of Editorial Advisory Board - SN Operations Research Forum"
]
"institution" => array:2 [
"fr" => "SN Operations Research Forum"
"en" => "SN Operations Research Forum"
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
39 => Essec\Faculty\Model\ExtraActivity {#2275
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2017-01-01"
"endDate" => "2018-01-01"
"year" => null
"uuid" => "202"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Fonction dans une association académique"
"en" => "Function in an academic association"
]
"label" => array:2 [
"fr" => "Vice-president of the INFORMS Telecommunication Section"
"en" => "Vice-president of the INFORMS Telecommunication Section"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
40 => Essec\Faculty\Model\ExtraActivity {#2276
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2010-01-01"
"endDate" => "2016-01-01"
"year" => null
"uuid" => "202"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Fonction dans une association académique"
"en" => "Function in an academic association"
]
"label" => array:2 [
"fr" => "Member of council and secretary of the INFORMS Telecom Section"
"en" => "Member of council and secretary of the INFORMS Telecom Section"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
41 => Essec\Faculty\Model\ExtraActivity {#2277
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2003-01-01"
"endDate" => "2003-01-01"
"year" => null
"uuid" => "204"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Membre d'une association académique"
"en" => "Member of an academic association"
]
"label" => array:2 [
"fr" => "Member of the IEEE Computational Intelligence Society (CIS)"
"en" => "Member of the IEEE Computational Intelligence Society (CIS)"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
42 => Essec\Faculty\Model\ExtraActivity {#2278
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2017-01-01"
"endDate" => "2017-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "International Network Optimization Conference, INOC 2017"
"en" => "International Network Optimization Conference, INOC 2017"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
43 => Essec\Faculty\Model\ExtraActivity {#2279
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2018-01-01"
"endDate" => "2018-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "International Symposium on Combinatorial Optimization, ISCO 2018"
"en" => "International Symposium on Combinatorial Optimization, ISCO 2018"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
44 => Essec\Faculty\Model\ExtraActivity {#2280
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2018-01-01"
"endDate" => "2018-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "International Symposium on Mathematical Programming, ISMP 2018"
"en" => "International Symposium on Mathematical Programming, ISMP 2018"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
45 => Essec\Faculty\Model\ExtraActivity {#2281
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2018-01-01"
"endDate" => "2018-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "INFORMS Telecommunication Conference 2018"
"en" => "Program Committee Member : INFORMS Telecommunication Conference 2018"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
46 => Essec\Faculty\Model\ExtraActivity {#2282
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2019-01-01"
"endDate" => "2019-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Program Committee member - International Network Optimization Conference, INOC 2019"
"en" => "Program Committee member : International Network Optimization Conference, INOC 2019"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
47 => Essec\Faculty\Model\ExtraActivity {#2283
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2020-01-01"
"endDate" => "2020-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Program Committee member: International Symposium on Combinatorial Optimization, ISCO 2020"
"en" => "Program Committee member: International Symposium on Combinatorial Optimization, ISCO 2020"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
48 => Essec\Faculty\Model\ExtraActivity {#2284
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2020-01-01"
"endDate" => "2020-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Program Committee member: INFORMS Telecommunication & Network Analytics Conference 2020"
"en" => "Program Committee member: INFORMS Telecommunication & Network Analytics Conference 2020"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
49 => Essec\Faculty\Model\ExtraActivity {#2285
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2020-01-01"
"endDate" => "2020-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Program Committee member: International Symposium on Combinatorial Optimisation 2020Program Committee member: International Symposium on Combinatorial Optimisation 2020
Program Committee member: International Symposium on Combinatorial Optimisation 2020Program Committe
"
"en" => "Program Committee member: International Symposium on Combinatorial Optimisation 2020"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
50 => Essec\Faculty\Model\ExtraActivity {#2286
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2016-01-01"
"endDate" => "2016-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Program Committee member: INFORMS Telecommunication Conference 2016"
"en" => "Program Committee member: INFORMS Telecommunication Conference 2016"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
51 => Essec\Faculty\Model\ExtraActivity {#2287
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2015-01-01"
"endDate" => "2015-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Program Committee member:"
"en" => "Program Committee member: International Network Optimization Conference, INOC 2015"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
52 => Essec\Faculty\Model\ExtraActivity {#2288
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2015-01-01"
"endDate" => "2015-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Program Committee member: 11th Metaheuristics International Conference"
"en" => "Program Committee member: 11th Metaheuristics International Conference, MIC 2015"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
53 => Essec\Faculty\Model\ExtraActivity {#2289
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2013-01-01"
"endDate" => "2013-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Program Committee Member: International Network Optimization Conference"
"en" => "Program Committee Member: International Network Optimization Conference, INOC 2013"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
54 => Essec\Faculty\Model\ExtraActivity {#2290
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2013-01-01"
"endDate" => "2013-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Program Committee member : 10th Metaheuristics International Conference, MIC 2013"
"en" => "Program Committee member : 10th Metaheuristics International Conference, MIC 2013"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
55 => Essec\Faculty\Model\ExtraActivity {#2291
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2012-01-01"
"endDate" => "2012-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Program Committee member :"
"en" => "Program Committee member : INFORMS Telecommunication Conference 2012"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
56 => Essec\Faculty\Model\ExtraActivity {#2292
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2011-01-01"
"endDate" => "2011-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "International Network Optimization Conference, INOC 2011"
"en" => "Program Committee member: International Network Optimization Conference, INOC 2011"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
57 => Essec\Faculty\Model\ExtraActivity {#2293
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2010-01-01"
"endDate" => "2010-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Program Committee member: Third international workshop on model-based metaheuristics, Matheuristics 2010
Program Committee member: Third international workshop on model-based metaheuristics, Matheuristics
"
"en" => "Program Committee member: Third international workshop on model-based metaheuristics, Matheuristics 2010
Program Committee member: Third international workshop on model-based metaheuristics, Matheuristics
"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
58 => Essec\Faculty\Model\ExtraActivity {#2294
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2008-01-01"
"endDate" => "2008-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Program Committee member:"
"en" => "Program Committee member: Workshop on Heuristic Methods for the Design, Deployment, and Reliability of Networks and Network Applications, HEUNET 2008
Program Committee member: Workshop on Heuristic Methods for the Design, Deployment, and Reliability
"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
59 => Essec\Faculty\Model\ExtraActivity {#2295
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2005-01-01"
"endDate" => "2005-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Program Committee member: The Genetic and Evolutionary Computation Conference, GECCO 2005"
"en" => "Program Committee member: The Genetic and Evolutionary Computation Conference, GECCO 2005"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
60 => Essec\Faculty\Model\ExtraActivity {#2296
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2001-01-01"
"endDate" => "2005-01-01"
"year" => null
"uuid" => "R1_101"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Participation au comité scientifique d'une conférence ou reviewer pour une conférence"
"en" => "Participation in scientific commissions or reviewer for a conference"
]
"label" => array:2 [
"fr" => "Program Committee member: European Conferences on Evolutionary Computation in Combinatorial Optimisation EvoCOP
Program Committee member: European Conferences on Evolutionary Computation in Combinatorial Optimisa
"
"en" => "Program Committee member: European Conferences on Evolutionary Computation in Combinatorial Optimisation EvoCOP
Program Committee member: European Conferences on Evolutionary Computation in Combinatorial Optimisa
"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
61 => Essec\Faculty\Model\ExtraActivity {#2297
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2017-01-01"
"endDate" => null
"year" => null
"uuid" => "599"
"type" => array:2 [
"fr" => "Activités professionnelles"
"en" => "Professional activities"
]
"subType" => array:2 [
"fr" => "Autre activité professionnelle"
"en" => "Other professional activity"
]
"label" => array:2 [
"fr" => "Orange Labs, France: Optimal Instantiation of Service Chains in Software Defined Networks. CIFRE contract (PhD supervision of Ahlam Mouaci)
Orange Labs, France: Optimal Instantiation of Service Chains in Software Defined Networks. CIFRE con
"
"en" => "Orange Labs, France: Optimal Instantiation of Service Chains in Software Defined Networks. CIFRE contract (PhD supervision of Ahlam Mouaci)
Orange Labs, France: Optimal Instantiation of Service Chains in Software Defined Networks. CIFRE con
"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
62 => Essec\Faculty\Model\ExtraActivity {#2298
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2006-01-01"
"endDate" => "2010-01-01"
"year" => null
"uuid" => "599"
"type" => array:2 [
"fr" => "Activités professionnelles"
"en" => "Professional activities"
]
"subType" => array:2 [
"fr" => "Autre activité professionnelle"
"en" => "Other professional activity"
]
"label" => array:2 [
"fr" => "Telekom Austria AG: Optimal Design of FTTx Telecommunication Networks: (supervision of 2 PhD students)
Telekom Austria AG: Optimal Design of FTTx Telecommunication Networks: (supervision of 2 PhD student
"
"en" => "Telekom Austria AG: Optimal Design of FTTx Telecommunication Networks: (supervision of 2 PhD students)
Telekom Austria AG: Optimal Design of FTTx Telecommunication Networks: (supervision of 2 PhD student
"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
63 => Essec\Faculty\Model\ExtraActivity {#2299
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2021-01-01"
"endDate" => null
"year" => null
"uuid" => "102"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Co-direction d'une revue - Co-rédacteur en chef"
"en" => "Senior or Associate Editor"
]
"label" => array:2 [
"fr" => "Associate Editor - Transportation Science"
"en" => "Associate Editor - Transportation Science"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
64 => Essec\Faculty\Model\ExtraActivity {#2300
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2023-06-01"
"endDate" => null
"year" => null
"uuid" => "103"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Membre d'un comité de lecture"
"en" => "Editorial Board Membership"
]
"label" => array:2 [
"fr" => "Associate Editor - Operations Research"
"en" => "Associate Editor - Operations Research"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
65 => Essec\Faculty\Model\ExtraActivity {#2301
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2020-01-01"
"endDate" => null
"year" => null
"uuid" => "103"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Membre d'un comité de lecture"
"en" => "Editorial Board Membership"
]
"label" => array:2 [
"fr" => "Comité de lecture - Networks: An International Journal"
"en" => "Editorial board member - Networks: An International Journal"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
66 => Essec\Faculty\Model\ExtraActivity {#2302
#_index: null
#_id: null
#_source: array:9 [
"startDate" => "2021-01-01"
"endDate" => null
"year" => null
"uuid" => "103"
"type" => array:2 [
"fr" => "Activités de recherche"
"en" => "Research activities"
]
"subType" => array:2 [
"fr" => "Membre d'un comité de lecture"
"en" => "Editorial Board Membership"
]
"label" => array:2 [
"fr" => "Comité de lecture - Transportation Science"
"en" => "Editorial board membership - Transportation Science"
]
"institution" => array:2 [
"fr" => null
"en" => null
]
"country" => array:2 [
"fr" => null
"en" => null
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
]
"theses" => array:12 [
0 => Essec\Faculty\Model\These {#2350
#_index: null
#_id: null
#_source: array:9 [
"year" => "2014"
"startDate" => null
"endDate" => "2014"
"student" => "ALVAREZ-MIRANDA E."
"firstJob" => ""
"label" => array:2 [
"fr" => "Eduardo Álvarez-Miranda, University of Bologna (co-supervisé avec P. Toth)"
"en" => "Eduardo Álvarez-Miranda, University of Bologna (co-supervised with P. Toth)"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "University of Bologna"
"en" => "University of Bologna"
]
"country" => array:2 [
"fr" => "Italie"
"en" => "Italy"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
1 => Essec\Faculty\Model\These {#2351
#_index: null
#_id: null
#_source: array:9 [
"year" => null
"startDate" => null
"endDate" => null
"student" => "BRANDSTÄTTER G."
"firstJob" => ""
"label" => array:2 [
"fr" => "Georg Brandstätter, University of Vienna (avec M. Leitner)"
"en" => "Georg Brandstätter, University of Vienna (with M. Leitner)"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
2 => Essec\Faculty\Model\These {#2352
#_index: null
#_id: null
#_source: array:9 [
"year" => "2013"
"startDate" => null
"endDate" => "2013"
"student" => "BÜSING C."
"firstJob" => ""
"label" => array:2 [
"fr" => "Christina Büsing, Univ. of Vienna (now at RWTH Aachen)"
"en" => "Christina Büsing, Univ. of Vienna (now at RWTH Aachen)"
]
"role" => array:2 [
"fr" => "Directeur de thèse"
"en" => "Thesis director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
3 => Essec\Faculty\Model\These {#2353
#_index: null
#_id: null
#_source: array:9 [
"year" => "2019"
"startDate" => null
"endDate" => "2019"
"student" => "DE MELO DA SILVA M."
"firstJob" => ""
"label" => array:2 [
"fr" => "Marcos de Melo da Silva, ESSEC"
"en" => "Marcos de Melo da Silva, ESSEC"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
4 => Essec\Faculty\Model\These {#2354
#_index: null
#_id: null
#_source: array:9 [
"year" => "2013"
"startDate" => null
"endDate" => "2013"
"student" => "GOLLOWITZER S."
"firstJob" => ""
"label" => array:2 [
"fr" => "Stefan Gollowitzer (OEGOR Dissertation Award 2013), University of Vienna (avec I. Bomze)"
"en" => "Stefan Gollowitzer (OEGOR Dissertation Award 2013), University of Vienna (with I. Bomze)"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
5 => Essec\Faculty\Model\These {#2355
#_index: null
#_id: null
#_source: array:9 [
"year" => null
"startDate" => null
"endDate" => null
"student" => "HASSANZADEH A."
"firstJob" => ""
"label" => array:2 [
"fr" => "Alborz Hassanzadeh, ESSEC (avec L. Alfandari)"
"en" => "Alborz Hassanzadeh, ESSEC (with L. Alfandari)"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "ESSEC Business School"
"en" => "ESSEC Business School"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
6 => Essec\Faculty\Model\These {#2356
#_index: null
#_id: null
#_source: array:9 [
"year" => "2015"
"startDate" => null
"endDate" => "2015"
"student" => "LEITNER M."
"firstJob" => ""
"label" => array:2 [
"fr" => "Markus Leitner, Univ. of Vienna (désormais à Vrije Universiteit Amsterdam)"
"en" => "Markus Leitner, Univ. of Vienna (now at Vrije Universiteit Amsterdam)"
]
"role" => array:2 [
"fr" => "Directeur de thèse"
"en" => "Thesis director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
7 => Essec\Faculty\Model\These {#2357
#_index: null
#_id: null
#_source: array:9 [
"year" => "2017"
"startDate" => null
"endDate" => "2017"
"student" => "LUIPERSBECK M."
"firstJob" => ""
"label" => array:2 [
"fr" => "Martin Luipersbeck, University of Vienna (Finalist for the EURO Doctoral Dissertation Award 2018) (avec M. Leitner)
Martin Luipersbeck, University of Vienna (Finalist for the EURO Doctoral Dissertation Award 2018) (a
"
"en" => "Martin Luipersbeck, University of Vienna (Finalist for the EURO Doctoral Dissertation Award 2018) (with M. Leitner)
Martin Luipersbeck, University of Vienna (Finalist for the EURO Doctoral Dissertation Award 2018) (w
"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
8 => Essec\Faculty\Model\These {#2358
#_index: null
#_id: null
#_source: array:9 [
"year" => null
"startDate" => null
"endDate" => null
"student" => "MOUACI A."
"firstJob" => ""
"label" => array:2 [
"fr" => "Ahlam Mouaci, University Paris Dauphine"
"en" => "Ahlam Mouaci, University Paris Dauphine"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université Paris-Dauphine, PSL"
"en" => "Université Paris-Dauphine, PSL"
]
"country" => array:2 [
"fr" => "France"
"en" => "France"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
9 => Essec\Faculty\Model\These {#2359
#_index: null
#_id: null
#_source: array:9 [
"year" => "2013"
"startDate" => null
"endDate" => "2013"
"student" => "PUTZ P."
"firstJob" => ""
"label" => array:2 [
"fr" => "Peter Putz, University of Vienna (avec I. Bomze)"
"en" => "Peter Putz, University of Vienna (with I. Bomze)"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
10 => Essec\Faculty\Model\These {#2360
#_index: null
#_id: null
#_source: array:9 [
"year" => "2015"
"startDate" => null
"endDate" => "2015"
"student" => "SINNL M."
"firstJob" => ""
"label" => array:2 [
"fr" => "Markus Sinnl, University of Vienna (OEGOR Dissertation Award 2016 and INFORMS SOLA Dissertation Award 2016) (avec I. Bomze)
Markus Sinnl, University of Vienna (OEGOR Dissertation Award 2016 and INFORMS SOLA Dissertation Awar
"
"en" => "Markus Sinnl, University of Vienna (OEGOR Dissertation Award 2016 and INFORMS SOLA Dissertation Award 2016) (with I. Bomze)
Markus Sinnl, University of Vienna (OEGOR Dissertation Award 2016 and INFORMS SOLA Dissertation Awar
"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
11 => Essec\Faculty\Model\These {#2361
#_index: null
#_id: null
#_source: array:9 [
"year" => "2013"
"startDate" => null
"endDate" => "2013"
"student" => "WASSERMANN B."
"firstJob" => ""
"label" => array:2 [
"fr" => "Bertram Wassermann, University of Vienna (avec I. Bomze)"
"en" => "Bertram Wassermann, University of Vienna (with I. Bomze)"
]
"role" => array:2 [
"fr" => "Co-directeur de thèse"
"en" => "Thesis co-director"
]
"institution" => array:2 [
"fr" => "Université de Vienne"
"en" => "Université de Vienne"
]
"country" => array:2 [
"fr" => "Autriche"
"en" => "Austria"
]
]
+lang: "fr"
+"parent": Essec\Faculty\Model\Profile {#2233}
}
]
"indexedAt" => "2025-02-23T07:21:22.000Z"
"contributions" => array:212 [
0 => Essec\Faculty\Model\Contribution {#2363
#_index: "academ_contributions"
#_id: "6843"
#_source: array:18 [
"id" => "6843"
"slug" => "outer-approximation-and-submodular-cuts-for-maximum-capture-facility-location-problems-with-random-utilities
outer-approximation-and-submodular-cuts-for-maximum-capture-facility-location-problems-with-random-u
"
"yearMonth" => "2017-09"
"year" => "2017"
"title" => "Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random Utilities
Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random U
"
"description" => "LJUBIC, I. et MORENO, E. (2017). Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random Utilities. Dans: Optimization 2017 Conference.
LJUBIC, I. et MORENO, E. (2017). Outer Approximation and Submodular Cuts for Maximum Capture Facilit
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "MORENO E."
]
]
"ouvrage" => "Optimization 2017 Conference"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
1 => Essec\Faculty\Model\Contribution {#2365
#_index: "academ_contributions"
#_id: "2384"
#_source: array:18 [
"id" => "2384"
"slug" => "redesigning-benders-decomposition-for-large-scale-facility-location"
"yearMonth" => "2017-07"
"year" => "2017"
"title" => "Redesigning Benders Decomposition for Large-Scale Facility Location"
"description" => "FISCHETTI, M., LJUBIC, I. et SINNL, M. (2017). Redesigning Benders Decomposition for Large-Scale Facility Location. <i>Management Science</i>, 63(7), pp. 2146-2162.
FISCHETTI, M., LJUBIC, I. et SINNL, M. (2017). Redesigning Benders Decomposition for Large-Scale Fac
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FISCHETTI M."
]
2 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://www.researchgate.net/publication/304187587_Redesigning_Benders_Decomposition_for_Large-Scale_Facility_Location
https://www.researchgate.net/publication/304187587_Redesigning_Benders_Decomposition_for_Large-Scale
"
"publicationInfo" => array:3 [
"pages" => "2146-2162"
"volume" => "63"
"number" => "7"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The uncapacitated facility location (UFL) problem is one of the most famous and most studied problems in the operations research literature. Given a set of potential facility locations and a set of customers, the goal is to find a subset of facility locations to open and to allocate each customer to open facilities so that the facility opening plus customer allocation costs are minimized. In our setting, for each customer the allocation cost is assumed to be a linear or separable convex quadratic function. Motivated by recent UFL applications in business analytics, we revise approaches that work on a projected decision space and hence are intrinsically more scalable for large-scale input data. Our working hypothesis is that many of the exact (decomposition) approaches that were proposed decades ago and discarded soon after need to be redesigned to take advantage of the new hardware and software technologies. To this end, we “thin out” the classical models from the literature and use (generalized) Benders cuts to replace a huge number of allocation variables by a small number of continuous variables that model the customer allocation cost directly. Our results show that Benders decomposition allows for a significant boost in the performance of a mixed-integer programming solver. We report the optimal solution of a large set of previously unsolved benchmark instances widely used in the available literature. In particular, dramatic speedups are achieved for UFL problems with separable quadratic allocation costs, which turn out to be much easier than their linear counterparts when our approach is used.
The uncapacitated facility location (UFL) problem is one of the most famous and most studied problem
"
"en" => "The uncapacitated facility location (UFL) problem is one of the most famous and most studied problems in the operations research literature. Given a set of potential facility locations and a set of customers, the goal is to find a subset of facility locations to open and to allocate each customer to open facilities so that the facility opening plus customer allocation costs are minimized. In our setting, for each customer the allocation cost is assumed to be a linear or separable convex quadratic function. Motivated by recent UFL applications in business analytics, we revise approaches that work on a projected decision space and hence are intrinsically more scalable for large-scale input data. Our working hypothesis is that many of the exact (decomposition) approaches that were proposed decades ago and discarded soon after need to be redesigned to take advantage of the new hardware and software technologies. To this end, we “thin out” the classical models from the literature and use (generalized) Benders cuts to replace a huge number of allocation variables by a small number of continuous variables that model the customer allocation cost directly. Our results show that Benders decomposition allows for a significant boost in the performance of a mixed-integer programming solver. We report the optimal solution of a large set of previously unsolved benchmark instances widely used in the available literature. In particular, dramatic speedups are achieved for UFL problems with separable quadratic allocation costs, which turn out to be much easier than their linear counterparts when our approach is used.
The uncapacitated facility location (UFL) problem is one of the most famous and most studied problem
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
2 => Essec\Faculty\Model\Contribution {#2367
#_index: "academ_contributions"
#_id: "2501"
#_source: array:18 [
"id" => "2501"
"slug" => "solving-minimum-cost-shared-arborescence-problems"
"yearMonth" => "2017-05"
"year" => "2017"
"title" => "Solving Minimum-Cost Shared Arborescence Problems"
"description" => "ÁLVAREZ-MIRANDA, E., LJUBIC, I., LUIPERSBECK, M. et SINNL, M. (2017). Solving Minimum-Cost Shared Arborescence Problems. <i>European Journal of Operational Research</i>, 258(3), pp. 887-901.
ÁLVAREZ-MIRANDA, E., LJUBIC, I., LUIPERSBECK, M. et SINNL, M. (2017). Solving Minimum-Cost Shared Ar
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ÁLVAREZ-MIRANDA E."
]
2 => array:1 [
"name" => "LUIPERSBECK M."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2016.11.004"
"publicationInfo" => array:3 [
"pages" => "887-901"
"volume" => "258"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In this work, we consider the minimum-cost shared Steiner arborescence problem (SStA). In this problem, the goal is to find a minimum-cost subgraph, which is shared among multiple entities and each entity is able to establish a cost-efficient Steiner arborescence. The SStA has been recently used in the literature to establish shared functional modules in protein-protein interaction networks. We propose a cut-based formulation for the problem, and design two exact algorithmic approaches: one based on the separation of connectivity cut inequalities, and the other corresponding to a Benders decomposition of the former model. Both approaches are enhanced by various techniques, including (i) preprocessing, (ii) stabilized cut generation, (iii) primal heuristics, and (iv) cut management. These two algorithmic alternatives are computationally evaluated and compared with a previously proposed flow- based formulation. We illustrate the effectiveness of the algorithms on two types of instances derived from protein-protein interaction networks (available from the previous literature) and from telecommunication access networks.
In this work, we consider the minimum-cost shared Steiner arborescence problem (SStA). In this probl
"
"en" => "In this work, we consider the minimum-cost shared Steiner arborescence problem (SStA). In this problem, the goal is to find a minimum-cost subgraph, which is shared among multiple entities and each entity is able to establish a cost-efficient Steiner arborescence. The SStA has been recently used in the literature to establish shared functional modules in protein-protein interaction networks. We propose a cut-based formulation for the problem, and design two exact algorithmic approaches: one based on the separation of connectivity cut inequalities, and the other corresponding to a Benders decomposition of the former model. Both approaches are enhanced by various techniques, including (i) preprocessing, (ii) stabilized cut generation, (iii) primal heuristics, and (iv) cut management. These two algorithmic alternatives are computationally evaluated and compared with a previously proposed flow- based formulation. We illustrate the effectiveness of the algorithms on two types of instances derived from protein-protein interaction networks (available from the previous literature) and from telecommunication access networks.
In this work, we consider the minimum-cost shared Steiner arborescence problem (SStA). In this probl
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
3 => Essec\Faculty\Model\Contribution {#2364
#_index: "academ_contributions"
#_id: "2517"
#_source: array:18 [
"id" => "2517"
"slug" => "stochastic-survivable-network-design-problems-theory-and-practice"
"yearMonth" => "2017-01"
"year" => "2017"
"title" => "Stochastic Survivable Network Design Problems: Theory and Practice"
"description" => "LJUBIC, I., MUTZEL, P. et ZEY, B. (2017). Stochastic Survivable Network Design Problems: Theory and Practice. <i>European Journal of Operational Research</i>, 256(2), pp. 333-348.
LJUBIC, I., MUTZEL, P. et ZEY, B. (2017). Stochastic Survivable Network Design Problems: Theory and
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "MUTZEL P."
]
2 => array:1 [
"name" => "ZEY B."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2016.06.048"
"publicationInfo" => array:3 [
"pages" => "333-348"
"volume" => "256"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We study survivable network design problems with edge-connectivity requirements under a two-stage stochastic model with recourse and finitely many scenarios. For the formulation in the natural space of edge variables we show that facet defining inequalities of the underlying polytope can be derived from the deterministic counterparts. Moreover, by using graph orientation properties we introduce stronger cut-based formulations. For solving the proposed mixed integer programing models, we suggest a two- stage branch&cut algorithm based on a decomposed model. In order to accelerate the computations, we suggest a new technique for strengthening the decomposed L-shaped optimality cuts which is computa- tionally fast and easy to implement. A computational study shows the benefit of the decomposition and the cut strengthening –which significantly reduces the number of master iterations and the computa- tional running time. Moreover, we evaluate the stability of the scenario generation method and analyze the value of the stochastic solution.
We study survivable network design problems with edge-connectivity requirements under a two-stage st
"
"en" => "We study survivable network design problems with edge-connectivity requirements under a two-stage stochastic model with recourse and finitely many scenarios. For the formulation in the natural space of edge variables we show that facet defining inequalities of the underlying polytope can be derived from the deterministic counterparts. Moreover, by using graph orientation properties we introduce stronger cut-based formulations. For solving the proposed mixed integer programing models, we suggest a two- stage branch&cut algorithm based on a decomposed model. In order to accelerate the computations, we suggest a new technique for strengthening the decomposed L-shaped optimality cuts which is computa- tionally fast and easy to implement. A computational study shows the benefit of the decomposition and the cut strengthening –which significantly reduces the number of master iterations and the computa- tional running time. Moreover, we evaluate the stability of the scenario generation method and analyze the value of the stochastic solution.
We study survivable network design problems with edge-connectivity requirements under a two-stage st
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
4 => Essec\Faculty\Model\Contribution {#2368
#_index: "academ_contributions"
#_id: "7146"
#_source: array:18 [
"id" => "7146"
"slug" => "solving-minimum-cost-shared-arborescence-problems"
"yearMonth" => "2016-03"
"year" => "2016"
"title" => "Solving Minimum cost Shared Arborescence Problems"
"description" => "LJUBIC, I., ALVAREZ-MIRANDA, E., LUIPERSBECK, M. et SINNL, M. (2016). Solving Minimum cost Shared Arborescence Problems. Dans: Thirteenth INFORMS Telecommunications Conference.
LJUBIC, I., ALVAREZ-MIRANDA, E., LUIPERSBECK, M. et SINNL, M. (2016). Solving Minimum cost Shared Ar
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ALVAREZ-MIRANDA E."
]
2 => array:1 [
"name" => "LUIPERSBECK M."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => "Thirteenth INFORMS Telecommunications Conference"
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
5 => Essec\Faculty\Model\Contribution {#2362
#_index: "academ_contributions"
#_id: "7147"
#_source: array:18 [
"id" => "7147"
"slug" => "solving-minimum-cost-shared-arborescence-problems"
"yearMonth" => "2016-07"
"year" => "2016"
"title" => "Solving Minimum-Cost Shared Arborescence Problems"
"description" => "ÁLVAREZ-MIRANDA, E., LJUBIC, I., LUIPERSBECK, M. et SINNL, M. (2016). Solving Minimum-Cost Shared Arborescence Problems. Dans: 28th European Conference on Operational Research.
ÁLVAREZ-MIRANDA, E., LJUBIC, I., LUIPERSBECK, M. et SINNL, M. (2016). Solving Minimum-Cost Shared Ar
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ÁLVAREZ-MIRANDA E."
]
2 => array:1 [
"name" => "LUIPERSBECK M."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => "28th European Conference on Operational Research"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:12"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
6 => Essec\Faculty\Model\Contribution {#2366
#_index: "academ_contributions"
#_id: "7148"
#_source: array:18 [
"id" => "7148"
"slug" => "solving-minimum-cost-shared-arborescence-problems"
"yearMonth" => "2016-03"
"year" => "2016"
"title" => "Solving Minimum-Cost Shared Arborescence Problems"
"description" => "LEITNER, M., LJUBIC, I., LUIPERSBECK, M. et SINNL, M. (2016). Solving Minimum-Cost Shared Arborescence Problems. Dans: INFORMS Telecommunications Conference 2016.
LEITNER, M., LJUBIC, I., LUIPERSBECK, M. et SINNL, M. (2016). Solving Minimum-Cost Shared Arborescen
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER M."
]
2 => array:1 [
"name" => "LUIPERSBECK M."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => "INFORMS Telecommunications Conference 2016"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:12"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
7 => Essec\Faculty\Model\Contribution {#2369
#_index: "academ_contributions"
#_id: "7333"
#_source: array:18 [
"id" => "7333"
"slug" => "the-generalized-regenerator-location-problem"
"yearMonth" => "2016-03"
"year" => "2016"
"title" => "The Generalized Regenerator Location Problem"
"description" => "CHEN, S., LJUBIC, I. et RAGHAVAN, S. (2016). The Generalized Regenerator Location Problem. Dans: 13th INFORMS Telecommunications Conference 2016.
CHEN, S., LJUBIC, I. et RAGHAVAN, S. (2016). The Generalized Regenerator Location Problem. Dans: 13t
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "CHEN S."
]
2 => array:1 [
"name" => "RAGHAVAN S."
]
]
"ouvrage" => "13th INFORMS Telecommunications Conference 2016"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:12"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
8 => Essec\Faculty\Model\Contribution {#2370
#_index: "academ_contributions"
#_id: "2705"
#_source: array:18 [
"id" => "2705"
"slug" => "the-recoverable-robust-facility-location-problem"
"yearMonth" => "2015-09"
"year" => "2015"
"title" => "The Recoverable Robust Facility Location Problem"
"description" => "ÁLVAREZ-MIRANDA, E., FERNÁNDEZ, E. et LJUBIC, I. (2015). The Recoverable Robust Facility Location Problem. <i>Transportation Research Part B: Methodological</i>, 79(1), pp. 93-120.
ÁLVAREZ-MIRANDA, E., FERNÁNDEZ, E. et LJUBIC, I. (2015). The Recoverable Robust Facility Location Pr
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ÁLVAREZ-MIRANDA E."
]
2 => array:1 [
"name" => "FERNÁNDEZ E."
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Facility location"
1 => "Two-stage robust optimization"
2 => "Branch-and-cut"
3 => "L-shaped cuts"
]
"updatedAt" => "2021-02-02 16:16:18"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S0191261515001228"
"publicationInfo" => array:3 [
"pages" => "93-120"
"volume" => "79"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
This work deals with a facility location problem in which location and allocation (transportation) policy is defined in two stages such that a first-stage solution should be robust against the possible realizations (scenarios) of the input data that can only be revealed in a second stage. This solution should be robust enough so that it can be recovered promptly and at low cost in the second stage. In contrast to some related modeling approaches from the literature, this new recoverable robust model is more general in terms of the considered data uncertainty; it can address situations in which uncertainty may be present in any of the following four categories: provider-side uncertainty, receiver-side uncertainty, uncertainty in-between, and uncertainty with respect to the cost parameters.\n
This work deals with a facility location problem in which location and allocation (transportation) p
For this novel problem, a sophisticated branch-and-cut framework based on Benders decomposition is designed and complemented by several non-trivial enhancements, including scenario sorting, dual lifting, branching priorities, matheuristics and zero-half cuts. Two large sets of instances that incorporate spatial and demographic information of countries such as Germany and US (transportation) and Bangladesh and the Philippines (disaster management) are introduced. They are used to analyze in detail the characteristics of the proposed model and the obtained solutions as well as the effectiveness, behavior and limitations of the designed algorithm.
For this novel problem, a sophisticated branch-and-cut framework based on Benders decomposition is d
"""
"en" => """
This work deals with a facility location problem in which location and allocation (transportation) policy is defined in two stages such that a first-stage solution should be robust against the possible realizations (scenarios) of the input data that can only be revealed in a second stage. This solution should be robust enough so that it can be recovered promptly and at low cost in the second stage. In contrast to some related modeling approaches from the literature, this new recoverable robust model is more general in terms of the considered data uncertainty; it can address situations in which uncertainty may be present in any of the following four categories: provider-side uncertainty, receiver-side uncertainty, uncertainty in-between, and uncertainty with respect to the cost parameters.\n
This work deals with a facility location problem in which location and allocation (transportation) p
For this novel problem, a sophisticated branch-and-cut framework based on Benders decomposition is designed and complemented by several non-trivial enhancements, including scenario sorting, dual lifting, branching priorities, matheuristics and zero-half cuts. Two large sets of instances that incorporate spatial and demographic information of countries such as Germany and US (transportation) and Bangladesh and the Philippines (disaster management) are introduced. They are used to analyze in detail the characteristics of the proposed model and the obtained solutions as well as the effectiveness, behavior and limitations of the designed algorithm.
For this novel problem, a sophisticated branch-and-cut framework based on Benders decomposition is d
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
9 => Essec\Faculty\Model\Contribution {#2371
#_index: "academ_contributions"
#_id: "2744"
#_source: array:18 [
"id" => "2744"
"slug" => "thinning-out-steiner-trees-a-node-based-model-for-uniform-edge-costs"
"yearMonth" => "2017-06"
"year" => "2017"
"title" => "Thinning out Steiner Trees: A Node-Based Model for Uniform Edge Costs"
"description" => "FISCHETTI, M., LEITNER, M., LJUBIC, I., LUIPERSBECK, M., MONACI, M. et RESCH, M. (2017). Thinning out Steiner Trees: A Node-Based Model for Uniform Edge Costs. <i>Mathematical Programming Computation</i>, 9(2), pp. 203-229.
FISCHETTI, M., LEITNER, M., LJUBIC, I., LUIPERSBECK, M., MONACI, M. et RESCH, M. (2017). Thinning ou
"
"authors" => array:6 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FISCHETTI M."
]
2 => array:1 [
"name" => "LEITNER M."
]
3 => array:1 [
"name" => "LUIPERSBECK M."
]
4 => array:1 [
"name" => "MONACI M."
]
5 => array:1 [
"name" => "RESCH M."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://link.springer.com/article/10.1007/s12532-016-0111-0"
"publicationInfo" => array:3 [
"pages" => "203-229"
"volume" => "9"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The Steiner tree problem is a challenging NP-hard problem. Many hard instances of this problem are publicly available, that are still unsolved by state-of-the-art branch-and-cut codes. A typical strategy to attack these instances is to enrich the polyhedral description of the problem, and/or to implement more and more sophisticated separation procedures and branching strategies. In this paper we investigate the opposite viewpoint, and try to make the solution method as simple as possible while working on the modeling side. Our working hypothesis is that the extreme hardness of some classes of instances mainly comes from over-modeling, and that some instances can become quite easy to solve when a simpler model is considered. In other words, we aim at “thinning out” the usual models for the sake of getting a more agile framework. In particular, we focus on a model that only involves node variables, which is rather appealing for the “uniform” cases where all edges have the same cost. In our computational study, we first show that this new model allows one to quickly produce very good (sometimes proven optimal) solutions for notoriously hard instances from the literature. In some cases, our approach takes just few seconds to prove optimality for instances never solved (even after days of computation) by the standard methods. Moreover, we report improved solutions for several SteinLib instances, including the (in)famous hypercube ones. We also demonstrate how to build a unified solver on top of the new node-based model and the previous state-of-the-art model (defined in the space of arc and node variables). The solver relies on local branching, initialization heuristics, preprocessing and local search procedures. A filtering mechanism is applied to automatically select the best algorithmic ingredients for each instance individually. The presented solver is the winner of the DIMACS Challenge on Steiner trees in most of the considered categories.
The Steiner tree problem is a challenging NP-hard problem. Many hard instances of this problem are p
"
"en" => "The Steiner tree problem is a challenging NP-hard problem. Many hard instances of this problem are publicly available, that are still unsolved by state-of-the-art branch-and-cut codes. A typical strategy to attack these instances is to enrich the polyhedral description of the problem, and/or to implement more and more sophisticated separation procedures and branching strategies. In this paper we investigate the opposite viewpoint, and try to make the solution method as simple as possible while working on the modeling side. Our working hypothesis is that the extreme hardness of some classes of instances mainly comes from over-modeling, and that some instances can become quite easy to solve when a simpler model is considered. In other words, we aim at “thinning out” the usual models for the sake of getting a more agile framework. In particular, we focus on a model that only involves node variables, which is rather appealing for the “uniform” cases where all edges have the same cost. In our computational study, we first show that this new model allows one to quickly produce very good (sometimes proven optimal) solutions for notoriously hard instances from the literature. In some cases, our approach takes just few seconds to prove optimality for instances never solved (even after days of computation) by the standard methods. Moreover, we report improved solutions for several SteinLib instances, including the (in)famous hypercube ones. We also demonstrate how to build a unified solver on top of the new node-based model and the previous state-of-the-art model (defined in the space of arc and node variables). The solver relies on local branching, initialization heuristics, preprocessing and local search procedures. A filtering mechanism is applied to automatically select the best algorithmic ingredients for each instance individually. The presented solver is the winner of the DIMACS Challenge on Steiner trees in most of the considered categories.
The Steiner tree problem is a challenging NP-hard problem. Many hard instances of this problem are p
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
10 => Essec\Faculty\Model\Contribution {#2372
#_index: "academ_contributions"
#_id: "2746"
#_source: array:18 [
"id" => "2746"
"slug" => "tighter-mip-models-for-barge-container-ship-routing"
"yearMonth" => "2019-01"
"year" => "2019"
"title" => "Tighter MIP models for Barge Container Ship Routing"
"description" => "ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. et MARTIN, S. (2019). Tighter MIP models for Barge Container Ship Routing. <i>Omega</i>, 82, pp. 38-54.
ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. et MARTIN, S. (2019). Tighter MIP mo
"
"authors" => array:6 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "DAVIDOVIC Tatjana"
]
3 => array:1 [
"name" => "FURINI Fabio"
]
4 => array:1 [
"name" => "MARAS Vladislav"
]
5 => array:1 [
"name" => "MARTIN Sébastien"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Containers"
1 => "Programmation linéaire"
2 => "Repositionnement"
3 => "Routage"
4 => "Transport"
]
"updatedAt" => "2022-10-10 15:01:07"
"publicationUrl" => "https://doi.org/10.1016/j.omega.2017.12.002"
"publicationInfo" => array:3 [
"pages" => "38-54"
"volume" => "82"
"number" => ""
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "On considère la conception d'une ligne de transport fluvial devant décider à quels ports s'arrêter pour transporter des demandes de containers entre ports. Les nouveaux modèles proposés surpassent les modèles existants de la littérature. Ils exploitent la structure en ligne du routage en modélisant ce dernier par des variables associées aux noeuds (ports), et intègrent des variables associées soit aux arcs soit aux noeuds du réseau de transport pour le repositionnement des containers vides. Ce dernier modèle est le plus performant, particulièrement dans le cas de demandes non sécables.
On considère la conception d'une ligne de transport fluvial devant décider à quels ports s'arrêter p
"
"en" => "We consider Barge Container Ship Routing with empty container repositioning. We design new MIP formulations that outperfom state-of-the-art models. The new models exploit the line structure of inland waterway transportation by modeling routing with node variables, and consider either node or arc variables for empty containers. The second formulation reveals to be the most efficient one, especially for unsplittable demands. We also optimize the turnaround time or size of the fleet.
We consider Barge Container Ship Routing with empty container repositioning. We design new MIP formu
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
11 => Essec\Faculty\Model\Contribution {#2373
#_index: "academ_contributions"
#_id: "8299"
#_source: array:18 [
"id" => "8299"
"slug" => "onlast-mile-delivery-with-autonomous-robots"
"yearMonth" => "2019-06"
"year" => "2019"
"title" => "Onlast-mile Delivery with Autonomous Robots"
"description" => "ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2019). <i>Onlast-mile Delivery with Autonomous Robots</i>. ESSEC Business School.
ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2019). <i>Onlast-mile Delivery with Autonomous Ro
"
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "DE MELO DA SILVA M."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Documents de travail"
"en" => "Working Papers"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
12 => Essec\Faculty\Model\Contribution {#2374
#_index: "academ_contributions"
#_id: "1161"
#_source: array:18 [
"id" => "1161"
"slug" => "exact-approaches-for-network-design-problem-with-relays"
"yearMonth" => "2020-03"
"year" => "2020"
"title" => "Exact Approaches for Network Design Problem with Relays"
"description" => "LEITNER, M., LJUBIC, I., RIEDLER, M. et RUTHMAIR, M. (2020). Exact Approaches for Network Design Problem with Relays. <i>Omega</i>, 91.
LEITNER, M., LJUBIC, I., RIEDLER, M. et RUTHMAIR, M. (2020). Exact Approaches for Network Design Pro
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER Markus"
]
2 => array:1 [
"name" => "RIEDLER Martin"
]
3 => array:1 [
"name" => "RUTHMAIR Mario"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Integer programming"
1 => "Networks"
2 => "Layered graphs"
3 => "Telecommunications"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S030504831830183X"
"publicationInfo" => array:3 [
"pages" => null
"volume" => "91"
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We study the directed network design problem with relays (DNDPR) whose aim is to construct a minimum cost network that enables the communication of a given set of origin-destination pairs. Thereby, expensive signal regeneration devices need to be placed to cover communication distances exceeding a predefined threshold. Applications of the DNDPR arise in telecommunications and transportation. We propose two new integer programming formulations for the DNDPR. The first one is a flow-based formulation with a pseudo-polynomial number of variables and constraints and the second is a cut-based formulation with an exponential number of constraints. Fractional distance values are handled efficiently by augmenting both models with an exponentially-sized set of infeasible path constraints. We develop branch-and-cut algorithms and also consider valid inequalities to strengthen the obtained dual bounds and to speed up convergence. The results of our extensive computational study on diverse sets of benchmark instances show that our algorithms outperform the previous state-of-the-art method based on column generation.
We study the directed network design problem with relays (DNDPR) whose aim is to construct a minimum
"
"en" => "We study the directed network design problem with relays (DNDPR) whose aim is to construct a minimum cost network that enables the communication of a given set of origin-destination pairs. Thereby, expensive signal regeneration devices need to be placed to cover communication distances exceeding a predefined threshold. Applications of the DNDPR arise in telecommunications and transportation. We propose two new integer programming formulations for the DNDPR. The first one is a flow-based formulation with a pseudo-polynomial number of variables and constraints and the second is a cut-based formulation with an exponential number of constraints. Fractional distance values are handled efficiently by augmenting both models with an exponentially-sized set of infeasible path constraints. We develop branch-and-cut algorithms and also consider valid inequalities to strengthen the obtained dual bounds and to speed up convergence. The results of our extensive computational study on diverse sets of benchmark instances show that our algorithms outperform the previous state-of-the-art method based on column generation.
We study the directed network design problem with relays (DNDPR) whose aim is to construct a minimum
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
13 => Essec\Faculty\Model\Contribution {#2375
#_index: "academ_contributions"
#_id: "5263"
#_source: array:18 [
"id" => "5263"
"slug" => "very-large-scale-covering-location-problems-in-the-design-of-advanced-metering-infrastructure"
"yearMonth" => "2018-10"
"year" => "2018"
"title" => "Very Large Scale Covering Location Problems in the Design of Advanced Metering Infrastructure"
"description" => "LJUBIC, I. (2018). Very Large Scale Covering Location Problems in the Design of Advanced Metering Infrastructure. Dans: Workshop on Smart Cities Analytics.
LJUBIC, I. (2018). Very Large Scale Covering Location Problems in the Design of Advanced Metering In
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Workshop on Smart Cities Analytics"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
14 => Essec\Faculty\Model\Contribution {#2376
#_index: "academ_contributions"
#_id: "5266"
#_source: array:18 [
"id" => "5266"
"slug" => "keynote-a-new-general-purpose-algorithm-for-mixed-integer-bilevel-linear-programs"
"yearMonth" => "2016-10"
"year" => "2016"
"title" => "[Keynote] A new general-purpose algorithm for mixed-integer bilevel linear programs"
"description" => "LJUBIC, I. (2016). [Keynote] A new general-purpose algorithm for mixed-integer bilevel linear programs. Dans: 15ème Séminaire du Groupe POC "Combinatorial Bi-level optimization".
LJUBIC, I. (2016). [Keynote] A new general-purpose algorithm for mixed-integer bilevel linear progra
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "15ème Séminaire du Groupe POC "Combinatorial Bi-level optimization""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
15 => Essec\Faculty\Model\Contribution {#2377
#_index: "academ_contributions"
#_id: "5270"
#_source: array:18 [
"id" => "5270"
"slug" => "plenary-speaker-new-branch-and-cut-algorithms-for-mixed-integer-bilevel-linear-programs"
"yearMonth" => "2018-06"
"year" => "2018"
"title" => "[Plenary Speaker] New Branch-and-Cut Algorithms for Mixed-Integer Bilevel Linear Programs"
"description" => "LJUBIC, I. (2018). [Plenary Speaker] New Branch-and-Cut Algorithms for Mixed-Integer Bilevel Linear Programs. Dans: 2nd International Workshop on Bilevel Programming (IWOBIP'18).
LJUBIC, I. (2018). [Plenary Speaker] New Branch-and-Cut Algorithms for Mixed-Integer Bilevel Linear
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "2nd International Workshop on Bilevel Programming (IWOBIP'18)"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
16 => Essec\Faculty\Model\Contribution {#2378
#_index: "academ_contributions"
#_id: "5271"
#_source: array:18 [
"id" => "5271"
"slug" => "plenary-speaker-from-game-theory-to-graph-theory-a-bilevel-journey"
"yearMonth" => "2018-09"
"year" => "2018"
"title" => "[Plenary Speaker] From Game Theory to Graph Theory: A Bilevel Journey"
"description" => "LJUBIC, I. (2018). [Plenary Speaker] From Game Theory to Graph Theory: A Bilevel Journey. Dans: International Conference on Operations Research (OR 2018).
LJUBIC, I. (2018). [Plenary Speaker] From Game Theory to Graph Theory: A Bilevel Journey. Dans: Inte
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "International Conference on Operations Research (OR 2018)"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
17 => Essec\Faculty\Model\Contribution {#2379
#_index: "academ_contributions"
#_id: "5280"
#_source: array:18 [
"id" => "5280"
"slug" => "a-branch-and-cut-algorithm-for-mixed-integer-bilevel-optimization"
"yearMonth" => "2017-01"
"year" => "2017"
"title" => "A Branch-and-Cut Algorithm for Mixed Integer Bilevel Optimization"
"description" => "LJUBIC, I. (2017). A Branch-and-Cut Algorithm for Mixed Integer Bilevel Optimization. Dans: 21st Combinatorial Optimization Workshop.
LJUBIC, I. (2017). A Branch-and-Cut Algorithm for Mixed Integer Bilevel Optimization. Dans: 21st Com
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "21st Combinatorial Optimization Workshop"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
18 => Essec\Faculty\Model\Contribution {#2380
#_index: "academ_contributions"
#_id: "1346"
#_source: array:18 [
"id" => "1346"
"slug" => "ilp-heuristics-and-a-new-exact-method-for-bi-objective-0-1-ilps-application-to-fttx-network-design"
"yearMonth" => "2016-08"
"year" => "2016"
"title" => "ILP Heuristics and a New Exact Method for Bi-Objective 0/1 ILPs: Application to FTTx-Network Design"
"description" => "LEITNER, M., LJUBIC, I., SINNL, M. et WERNER, A. (2016). ILP Heuristics and a New Exact Method for Bi-Objective 0/1 ILPs: Application to FTTx-Network Design. <i>Computers & Operations Research</i>, 72, pp. 128-146.
LEITNER, M., LJUBIC, I., SINNL, M. et WERNER, A. (2016). ILP Heuristics and a New Exact Method for B
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER M."
]
2 => array:1 [
"name" => "SINNL M."
]
3 => array:1 [
"name" => "WERNER A."
]
]
"ouvrage" => ""
"keywords" => array:6 [
0 => "Bi-objective connected facility location"
1 => "k-architecture connected facility location"
2 => "Branch-and-cut"
3 => "Local branching"
4 => "Neighborhood search"
5 => "ILP heuristics"
]
"updatedAt" => "2021-02-02 16:16:18"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S0305054816300302"
"publicationInfo" => array:3 [
"pages" => "128-146"
"volume" => "72"
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We focus on bi-objective optimization problems whose feasible solutions can be described as 0/1 integer linear programs and propose two ILP heuristics, boundary induced neighborhood search (BINS) and directional local branching. Their main idea is to combine the features and explore the neighborhoods of solutions that are relatively close in the objective space. A two-phase ILP-based heuristic framework relying on BINS and directional local branching is introduced. Moreover, a new exact method called adaptive search in objective space (ASOS) is also proposed. ASOS combines features of the e-constraint method with the binary search in the objective space and uses heuristic solutions produced by BINS for guidance. Our new methods are computationally evaluated on two problems of particular relevance for the design of FTTx-networks. Comparison with other known exact methods (relying on the exploration of the objective space) is conducted on a set of realistic benchmark instances representing telecommunication access networks from Germany.
We focus on bi-objective optimization problems whose feasible solutions can be described as 0/1 inte
"
"en" => "We focus on bi-objective optimization problems whose feasible solutions can be described as 0/1 integer linear programs and propose two ILP heuristics, boundary induced neighborhood search (BINS) and directional local branching. Their main idea is to combine the features and explore the neighborhoods of solutions that are relatively close in the objective space. A two-phase ILP-based heuristic framework relying on BINS and directional local branching is introduced. Moreover, a new exact method called adaptive search in objective space (ASOS) is also proposed. ASOS combines features of the e-constraint method with the binary search in the objective space and uses heuristic solutions produced by BINS for guidance. Our new methods are computationally evaluated on two problems of particular relevance for the design of FTTx-networks. Comparison with other known exact methods (relying on the exploration of the objective space) is conducted on a set of realistic benchmark instances representing telecommunication access networks from Germany.
We focus on bi-objective optimization problems whose feasible solutions can be described as 0/1 inte
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
19 => Essec\Faculty\Model\Contribution {#2381
#_index: "academ_contributions"
#_id: "5494"
#_source: array:18 [
"id" => "5494"
"slug" => "benders-decomposition-for-covering-location-problems"
"yearMonth" => "2018-07"
"year" => "2018"
"title" => "Benders Decomposition for Covering Location Problems"
"description" => "CORDEAU, J.F., FURINI, F. et LJUBIC, I. (2018). Benders Decomposition for Covering Location Problems. Dans: 29th European Conference on Operations Research.
CORDEAU, J.F., FURINI, F. et LJUBIC, I. (2018). Benders Decomposition for Covering Location Problems
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "CORDEAU J.-F."
]
2 => array:1 [
"name" => "FURINI F."
]
]
"ouvrage" => "29th European Conference on Operations Research"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
20 => Essec\Faculty\Model\Contribution {#2382
#_index: "academ_contributions"
#_id: "5561"
#_source: array:18 [
"id" => "5561"
"slug" => "clique-interdiction-in-the-social-network-analysis"
"yearMonth" => "2017-03"
"year" => "2017"
"title" => "Clique Interdiction in the Social Network Analysis"
"description" => "LJUBIC, I., FURINI, F., MARTIN, S. et SAN SEGUNDO, P. (2017). Clique Interdiction in the Social Network Analysis. Dans: International Conference on Network Optimization) INOC 2017.
LJUBIC, I., FURINI, F., MARTIN, S. et SAN SEGUNDO, P. (2017). Clique Interdiction in the Social Netw
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI F."
]
2 => array:1 [
"name" => "MARTIN S."
]
3 => array:1 [
"name" => "SAN SEGUNDO P."
]
]
"ouvrage" => "International Conference on Network Optimization) INOC 2017"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
21 => Essec\Faculty\Model\Contribution {#2383
#_index: "academ_contributions"
#_id: "5707"
#_source: array:18 [
"id" => "5707"
"slug" => "decomposition-approaches-to-covering-location-problems"
"yearMonth" => "2018-07"
"year" => "2018"
"title" => "Decomposition Approaches to Covering Location Problems"
"description" => "CORDEAU, J.F., FURINI, F. et LJUBIC, I. (2018). Decomposition Approaches to Covering Location Problems. Dans: 23rd International Symposium on Mathematical Programming (ISMP) 2018.
CORDEAU, J.F., FURINI, F. et LJUBIC, I. (2018). Decomposition Approaches to Covering Location Proble
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "CORDEAU J.-F."
]
2 => array:1 [
"name" => "FURINI F."
]
]
"ouvrage" => "23rd International Symposium on Mathematical Programming (ISMP) 2018"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
22 => Essec\Faculty\Model\Contribution {#2384
#_index: "academ_contributions"
#_id: "5708"
#_source: array:18 [
"id" => "5708"
"slug" => "decomposition-methods-for-stochastic-steiner-trees"
"yearMonth" => "2017-09"
"year" => "2017"
"title" => "Decomposition Methods for Stochastic Steiner Trees"
"description" => "LEITNER, M., LJUBIC, I., LUIPERSBECK, M. et SINNL, M. (2017). Decomposition Methods for Stochastic Steiner Trees. Dans: 2017 European Conference on Stochastic Optimization (ECSO 2017).
LEITNER, M., LJUBIC, I., LUIPERSBECK, M. et SINNL, M. (2017). Decomposition Methods for Stochastic S
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER M."
]
2 => array:1 [
"name" => "LUIPERSBECK M."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => "2017 European Conference on Stochastic Optimization (ECSO 2017)"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
23 => Essec\Faculty\Model\Contribution {#2385
#_index: "academ_contributions"
#_id: "5930"
#_source: array:18 [
"id" => "5930"
"slug" => "exact-approaches-to-the-network-design-problem-with-relays"
"yearMonth" => "2015-09"
"year" => "2015"
"title" => "Exact Approaches to the Network Design Problem with Relays"
"description" => "LJUBIC, I., LEITNER, M., RUTHMAIR, M. et RIEDLER, M. (2015). Exact Approaches to the Network Design Problem with Relays. Dans: OR2015: International Conference on Operations Research.
LJUBIC, I., LEITNER, M., RUTHMAIR, M. et RIEDLER, M. (2015). Exact Approaches to the Network Design
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER M."
]
2 => array:1 [
"name" => "RUTHMAIR M."
]
3 => array:1 [
"name" => "RIEDLER M."
]
]
"ouvrage" => "OR2015: International Conference on Operations Research"
"keywords" => []
"updatedAt" => "2021-04-19 17:57:25"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
24 => Essec\Faculty\Model\Contribution {#2386
#_index: "academ_contributions"
#_id: "5931"
#_source: array:18 [
"id" => "5931"
"slug" => "exact-general-purpose-solvers-for-mixed-integer-bilevel-linear-programs"
"yearMonth" => "2018-03"
"year" => "2018"
"title" => "Exact General-Purpose Solvers for Mixed-Integer Bilevel Linear Programs"
"description" => "LJUBIC, I. (2018). Exact General-Purpose Solvers for Mixed-Integer Bilevel Linear Programs. Dans: 37ème Journée Francilienne de Recherche Opérationnelle (JFRO).
LJUBIC, I. (2018). Exact General-Purpose Solvers for Mixed-Integer Bilevel Linear Programs. Dans: 37
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "37ème Journée Francilienne de Recherche Opérationnelle (JFRO)"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
25 => Essec\Faculty\Model\Contribution {#2387
#_index: "academ_contributions"
#_id: "6044"
#_source: array:18 [
"id" => "6044"
"slug" => "generalized-benders-cuts-for-congested-facility-location"
"yearMonth" => "2016-06"
"year" => "2016"
"title" => "Generalized Benders Cuts for Congested Facility Location"
"description" => "FISCHETTI, M., LJUBIC, I. et SINNL, M. (2016). Generalized Benders Cuts for Congested Facility Location. Dans: 9th Triennial Symposium on Transportation Analysis (TRISTAN16).
FISCHETTI, M., LJUBIC, I. et SINNL, M. (2016). Generalized Benders Cuts for Congested Facility Locat
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FISCHETTI M."
]
2 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => "9th Triennial Symposium on Transportation Analysis (TRISTAN16)"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:09"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
26 => Essec\Faculty\Model\Contribution {#2388
#_index: "academ_contributions"
#_id: "6213"
#_source: array:18 [
"id" => "6213"
"slug" => "interdiction-games-and-monotonicity"
"yearMonth" => "2016-11"
"year" => "2016"
"title" => "Interdiction Games and Monotonicity"
"description" => "FISCHETTI, M., LJUBIC, I., MONACI, M. et SINNL, M. (2016). Interdiction Games and Monotonicity. Dans: PGMO Days 2016.
FISCHETTI, M., LJUBIC, I., MONACI, M. et SINNL, M. (2016). Interdiction Games and Monotonicity. Dans
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FISCHETTI M."
]
2 => array:1 [
"name" => "MONACI M."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => "PGMO Days 2016"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
27 => Essec\Faculty\Model\Contribution {#2389
#_index: "academ_contributions"
#_id: "6225"
#_source: array:18 [
"id" => "6225"
"slug" => "intersection-cuts-for-mixed-integer-bilevel-linear-programs"
"yearMonth" => "2016-07"
"year" => "2016"
"title" => "Intersection Cuts for Mixed-Integer Bilevel Linear Programs"
"description" => "FISCHETTI, M., LJUBIC, I., MONACI, M. et SINNL, M. (2016). Intersection Cuts for Mixed-Integer Bilevel Linear Programs. Dans: 28th European Conference on Operational Research.
FISCHETTI, M., LJUBIC, I., MONACI, M. et SINNL, M. (2016). Intersection Cuts for Mixed-Integer Bilev
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FISCHETTI M."
]
2 => array:1 [
"name" => "MONACI M."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => "28th European Conference on Operational Research"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:09"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
28 => Essec\Faculty\Model\Contribution {#2390
#_index: "academ_contributions"
#_id: "2133"
#_source: array:18 [
"id" => "2133"
"slug" => "on-the-use-of-intersection-cuts-for-bilevel-optimization"
"yearMonth" => "2018-11"
"year" => "2018"
"title" => "On the Use of Intersection Cuts for Bilevel Optimization"
"description" => "FISCHETTI, M., LJUBIC, I., MONACI, M. et SINNL, M. (2018). On the Use of Intersection Cuts for Bilevel Optimization. <i>Mathematical Programming</i>, 172(1-2), pp. 77-103.
FISCHETTI, M., LJUBIC, I., MONACI, M. et SINNL, M. (2018). On the Use of Intersection Cuts for Bilev
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FISCHETTI M."
]
2 => array:1 [
"name" => "MONACI M."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://link.springer.com/article/10.1007/s10107-017-1189-5"
"publicationInfo" => array:3 [
"pages" => "77-103"
"volume" => "172"
"number" => "1-2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We address a generic mixed-integer bilevel linear program (MIBLP), i.e., a bilevel optimization problem where all objective functions and constraints are linear, and some/all variables are required to take integer values. We first propose necessary modifications needed to turn a standard branch-and-bound MILP solver into an exact and finitely-convergent MIBLP solver, also addressing MIBLP unboundedness and infeasibility. As in other approaches from the literature, our scheme is finitely-convergent in case both the leader and the follower problems are pure integer. In addition, it is capable of dealing with continuous variables both in the leader and in follower problems—provided that the leader variables influencing follower’s decisions are integer and bounded. We then introduce new classes of linear inequalities to be embedded in this branch-and-bound framework, some of which are intersection cuts based on feasible-free convex sets. We present a computational study on various classes of benchmark instances available from the literature, in which we demonstrate that our approach outperforms alternative state-of-the-art MIBLP methods.
We address a generic mixed-integer bilevel linear program (MIBLP), i.e., a bilevel optimization prob
"
"en" => "We address a generic mixed-integer bilevel linear program (MIBLP), i.e., a bilevel optimization problem where all objective functions and constraints are linear, and some/all variables are required to take integer values. We first propose necessary modifications needed to turn a standard branch-and-bound MILP solver into an exact and finitely-convergent MIBLP solver, also addressing MIBLP unboundedness and infeasibility. As in other approaches from the literature, our scheme is finitely-convergent in case both the leader and the follower problems are pure integer. In addition, it is capable of dealing with continuous variables both in the leader and in follower problems—provided that the leader variables influencing follower’s decisions are integer and bounded. We then introduce new classes of linear inequalities to be embedded in this branch-and-bound framework, some of which are intersection cuts based on feasible-free convex sets. We present a computational study on various classes of benchmark instances available from the literature, in which we demonstrate that our approach outperforms alternative state-of-the-art MIBLP methods.
We address a generic mixed-integer bilevel linear program (MIBLP), i.e., a bilevel optimization prob
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
29 => Essec\Faculty\Model\Contribution {#2391
#_index: "academ_contributions"
#_id: "2182"
#_source: array:18 [
"id" => "2182"
"slug" => "outer-approximation-and-submodular-cuts-for-maximum-capture-facility-location-problems-with-random-utilities
outer-approximation-and-submodular-cuts-for-maximum-capture-facility-location-problems-with-random-u
"
"yearMonth" => "2018-04"
"year" => "2018"
"title" => "Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random Utilities
Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random U
"
"description" => "LJUBIC, I. et MORENO, E. (2018). Outer Approximation and Submodular Cuts for Maximum Capture Facility Location Problems with Random Utilities. <i>European Journal of Operational Research</i>, 266(1), pp. 46-56.
LJUBIC, I. et MORENO, E. (2018). Outer Approximation and Submodular Cuts for Maximum Capture Facilit
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "MORENO E."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Combinatorial optimization"
1 => "Branch-and-cut"
2 => "Maximum capture"
3 => "Random utility model"
4 => "Competitive facility location"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S0377221717308445"
"publicationInfo" => array:3 [
"pages" => "46-56"
"volume" => "266"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We consider a family of competitive facility location problems in which a “newcomer” company enters the market and has to decide where to locate a set of new facilities so as to maximize its market share. The multinomial logit model is used to estimate the captured customer demand. We propose a first branch-and-cut approach for this family of difficult mixed-integer non-linear problems. Our approach combines two types of cutting planes that exploit particular properties of the objective function: the first one are the outer-approximation cuts and the second one are the submodular cuts.The approach is computationally evaluated on three datasets from the recent literature. The obtained results show that our new branch-and-cut drastically outperforms state-of-the-art exact approaches, both in terms of the computing times, and in terms of the number of instances solved to optimality.
We consider a family of competitive facility location problems in which a “newcomer” company enters
"
"en" => "We consider a family of competitive facility location problems in which a “newcomer” company enters the market and has to decide where to locate a set of new facilities so as to maximize its market share. The multinomial logit model is used to estimate the captured customer demand. We propose a first branch-and-cut approach for this family of difficult mixed-integer non-linear problems. Our approach combines two types of cutting planes that exploit particular properties of the objective function: the first one are the outer-approximation cuts and the second one are the submodular cuts.The approach is computationally evaluated on three datasets from the recent literature. The obtained results show that our new branch-and-cut drastically outperforms state-of-the-art exact approaches, both in terms of the computing times, and in terms of the number of instances solved to optimality.
We consider a family of competitive facility location problems in which a “newcomer” company enters
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
30 => Essec\Faculty\Model\Contribution {#2392
#_index: "academ_contributions"
#_id: "6741"
#_source: array:18 [
"id" => "6741"
"slug" => "new-branch-and-cut-algorithms-for-mixed-integer-bilevel-linear-programs"
"yearMonth" => "2019-06"
"year" => "2019"
"title" => "New Branch-and-Cut Algorithms for Mixed-Integer Bilevel Linear Programs"
"description" => "LJUBIC, I. (2019). New Branch-and-Cut Algorithms for Mixed-Integer Bilevel Linear Programs. Dans: Séminaire Parisien d'Optimisation.
LJUBIC, I. (2019). New Branch-and-Cut Algorithms for Mixed-Integer Bilevel Linear Programs. Dans: Sé
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Séminaire Parisien d'Optimisation"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
31 => Essec\Faculty\Model\Contribution {#2393
#_index: "academ_contributions"
#_id: "532"
#_source: array:18 [
"id" => "532"
"slug" => "a-dual-ascent-based-branch-and-bound-framework-for-the-prize-collecting-steiner-tree-and-related-problems
a-dual-ascent-based-branch-and-bound-framework-for-the-prize-collecting-steiner-tree-and-related-pro
"
"yearMonth" => "2018-04"
"year" => "2018"
"title" => "A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems
A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Pro
"
"description" => "LEITNER, M., LJUBIC, I., LUIPERSBECK, M. et SINNL, M. (2018). A Dual Ascent-Based Branch-and-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. <i>INFORMS Journal on Computing</i>, 30(2), pp. 402-420.
LEITNER, M., LJUBIC, I., LUIPERSBECK, M. et SINNL, M. (2018). A Dual Ascent-Based Branch-and-Bound F
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER M."
]
2 => array:1 [
"name" => "LUIPERSBECK M."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://www.researchgate.net/publication/325373192_A_Dual_Ascent-Based_Branch-and-Bound_Framework_for_the_Prize-Collecting_Steiner_Tree_and_Related_Problems
https://www.researchgate.net/publication/325373192_A_Dual_Ascent-Based_Branch-and-Bound_Framework_fo
"
"publicationInfo" => array:3 [
"pages" => "402-420"
"volume" => "30"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We present a branch-and-bound (B&B) framework for the asymmetric prize-collecting Steiner tree problem (APCSTP). Several well-known network design problems can be transformed to the APCSTP, including the Steiner tree problem (STP), prize-collecting Steiner tree problem (PCSTP), maximum-weight connected subgraph problem (MWCS), and node-weighted Steiner tree problem (NWSTP). The main component of our framework is a new dual ascent algorithm for the rooted APCSTP, which generalizes Wong’s dual ascent algorithm for the Steiner arborescence problem. The lower bounds and dual information obtained from the algorithm are exploited within powerful bound-based reduction tests and for guiding primal heuristics. The framework is complemented by additional alternative-based reduction tests. Extensive computational results on benchmark instances for the PCSTP, MWCS, and NWSTP indicate the framework’s effectiveness, as most instances from literature are solved to optimality within seconds, including most of the (previously unsolved) largest instances from the recent DIMACS Challenge on Steiner trees. Moreover, results on new asymmetric instances for the APCSTP are reported. Since the addressed network design problems are frequently used for modeling various real-world applications (e.g., in bioinformatics), the implementation of the presented B&B framework has been made publicly available.
We present a branch-and-bound (B&B) framework for the asymmetric prize-collecting Steiner tree probl
"
"en" => "We present a branch-and-bound (B&B) framework for the asymmetric prize-collecting Steiner tree problem (APCSTP). Several well-known network design problems can be transformed to the APCSTP, including the Steiner tree problem (STP), prize-collecting Steiner tree problem (PCSTP), maximum-weight connected subgraph problem (MWCS), and node-weighted Steiner tree problem (NWSTP). The main component of our framework is a new dual ascent algorithm for the rooted APCSTP, which generalizes Wong’s dual ascent algorithm for the Steiner arborescence problem. The lower bounds and dual information obtained from the algorithm are exploited within powerful bound-based reduction tests and for guiding primal heuristics. The framework is complemented by additional alternative-based reduction tests. Extensive computational results on benchmark instances for the PCSTP, MWCS, and NWSTP indicate the framework’s effectiveness, as most instances from literature are solved to optimality within seconds, including most of the (previously unsolved) largest instances from the recent DIMACS Challenge on Steiner trees. Moreover, results on new asymmetric instances for the APCSTP are reported. Since the addressed network design problems are frequently used for modeling various real-world applications (e.g., in bioinformatics), the implementation of the presented B&B framework has been made publicly available.
We present a branch-and-bound (B&B) framework for the asymmetric prize-collecting Steiner tree probl
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
32 => Essec\Faculty\Model\Contribution {#2394
#_index: "academ_contributions"
#_id: "562"
#_source: array:18 [
"id" => "562"
"slug" => "a-new-general-purpose-algorithm-for-mixed-integer-bilevel-linear-programs"
"yearMonth" => "2017-12"
"year" => "2017"
"title" => "A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs"
"description" => "FISCHETTI, M., LJUBIC, I., MONACI, M. et SINNL, M. (2017). A New General-Purpose Algorithm for Mixed-Integer Bilevel Linear Programs. <i>Operations Research</i>, 65(6), pp. 1615-1637.
FISCHETTI, M., LJUBIC, I., MONACI, M. et SINNL, M. (2017). A New General-Purpose Algorithm for Mixed
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FISCHETTI M."
]
2 => array:1 [
"name" => "MONACI M."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://pubsonline.informs.org/doi/10.1287/opre.2017.1650"
"publicationInfo" => array:3 [
"pages" => "1615-1637"
"volume" => "65"
"number" => "6"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Bilevel optimization problems are very challenging optimization models arising in many important practical contexts, including pricing mechanisms in the energy sector, airline and telecommunication industry, transportation networks, critical infrastructure defense, and machine learning. In this paper, we consider bilevel programs with continuous and discrete variables at both levels, with linear objectives and constraints (continuous upper level variables, if any, must not appear in the lower level problem). We propose a general-purpose branch-and-cut exact solution method based on several new classes of valid inequalities, which also exploits a very effective bilevel-specific preprocessing procedure. An extensive computational study is presented to evaluate the performance of various solution methods on a common testbed of more than 800 instances from the literature and 60 randomly generated instances. Our new algorithm consistently outperforms (often by a large margin) alternative state-of-the-art methods from the literature, including methods exploiting problem-specific information for special instance classes. In particular, it solves to optimality more than 300 previously unsolved instances from the literature. To foster research on this challenging topic, our solver is made publicly available online.
Bilevel optimization problems are very challenging optimization models arising in many important pra
"
"en" => "Bilevel optimization problems are very challenging optimization models arising in many important practical contexts, including pricing mechanisms in the energy sector, airline and telecommunication industry, transportation networks, critical infrastructure defense, and machine learning. In this paper, we consider bilevel programs with continuous and discrete variables at both levels, with linear objectives and constraints (continuous upper level variables, if any, must not appear in the lower level problem). We propose a general-purpose branch-and-cut exact solution method based on several new classes of valid inequalities, which also exploits a very effective bilevel-specific preprocessing procedure. An extensive computational study is presented to evaluate the performance of various solution methods on a common testbed of more than 800 instances from the literature and 60 randomly generated instances. Our new algorithm consistently outperforms (often by a large margin) alternative state-of-the-art methods from the literature, including methods exploiting problem-specific information for special instance classes. In particular, it solves to optimality more than 300 previously unsolved instances from the literature. To foster research on this challenging topic, our solver is made publicly available online.
Bilevel optimization problems are very challenging optimization models arising in many important pra
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
33 => Essec\Faculty\Model\Contribution {#2395
#_index: "academ_contributions"
#_id: "564"
#_source: array:18 [
"id" => "564"
"slug" => "a-node-based-ilp-formulation-for-the-node-weighted-dominating-steiner-problem"
"yearMonth" => "2017-01"
"year" => "2017"
"title" => "A Node-Based ILP Formulation for the Node-Weighted Dominating Steiner Problem"
"description" => "BLEY, A., LJUBIC, I. et MAURER, O. (2017). A Node-Based ILP Formulation for the Node-Weighted Dominating Steiner Problem. <i>Networks</i>, 69(1), pp. 33-51.
BLEY, A., LJUBIC, I. et MAURER, O. (2017). A Node-Based ILP Formulation for the Node-Weighted Domina
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "BLEY A."
]
2 => array:1 [
"name" => "MAURER O."
]
]
"ouvrage" => ""
"keywords" => array:6 [
0 => "Connected dominating set"
1 => "Steiner tree"
2 => "Integer programming"
3 => "Thin formulation"
4 => "Polyhedron"
5 => "Facets"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://onlinelibrary.wiley.com/doi/abs/10.1002/net.21722"
"publicationInfo" => array:3 [
"pages" => "33-51"
"volume" => "69"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In this article, we consider the Node-Weighted Dominating Steiner Problem. Given a graph with node weights and a set of terminal nodes, the goal is to find a connected node-induced subgraph of minimum weight, such that each terminal node is contained in or adjacent to some node in the chosen subgraph. The problem arises in applications in the design of telecommunication networks. Integer programming formulations for Steiner problems usually employ a variable for each edge. We introduce a formulation that only uses node variables and that models connectivity through node-cut inequalities, which can be separated in polynomial time. We discuss necessary and sufficient conditions for the model inequalities to define facets and we introduce a class of lifted partition-based inequalities, which can be used to strengthen the linear relaxation. Finally, we show that the polyhedron defined by these inequalities is integral if the underlying graph is a cycle where no two terminals are adjacent. In the general cycle setting, we show that we can get a complete description of the feasible solutions by lifting and projecting into a polytope with no more than twice the dimension. We also show that the well-known indegree equalities are implied by the lifted partition inequalities. Finally, we evaluate the effectiveness of the presented partition inequalities in computational experiments.
In this article, we consider the Node-Weighted Dominating Steiner Problem. Given a graph with node w
"
"en" => "In this article, we consider the Node-Weighted Dominating Steiner Problem. Given a graph with node weights and a set of terminal nodes, the goal is to find a connected node-induced subgraph of minimum weight, such that each terminal node is contained in or adjacent to some node in the chosen subgraph. The problem arises in applications in the design of telecommunication networks. Integer programming formulations for Steiner problems usually employ a variable for each edge. We introduce a formulation that only uses node variables and that models connectivity through node-cut inequalities, which can be separated in polynomial time. We discuss necessary and sufficient conditions for the model inequalities to define facets and we introduce a class of lifted partition-based inequalities, which can be used to strengthen the linear relaxation. Finally, we show that the polyhedron defined by these inequalities is integral if the underlying graph is a cycle where no two terminals are adjacent. In the general cycle setting, we show that we can get a complete description of the feasible solutions by lifting and projecting into a polytope with no more than twice the dimension. We also show that the well-known indegree equalities are implied by the lifted partition inequalities. Finally, we evaluate the effectiveness of the presented partition inequalities in computational experiments.
In this article, we consider the Node-Weighted Dominating Steiner Problem. Given a graph with node w
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
34 => Essec\Faculty\Model\Contribution {#2396
#_index: "academ_contributions"
#_id: "565"
#_source: array:18 [
"id" => "565"
"slug" => "a-node-based-layered-graph-approach-for-the-steiner-tree-problem-with-revenues-budget-and-hop-constraints
a-node-based-layered-graph-approach-for-the-steiner-tree-problem-with-revenues-budget-and-hop-constr
"
"yearMonth" => "2016-12"
"year" => "2016"
"title" => "A Node-Based Layered Graph Approach for the Steiner Tree Problem with Revenues, Budget and Hop-Constraints
A Node-Based Layered Graph Approach for the Steiner Tree Problem with Revenues, Budget and Hop-Const
"
"description" => "SINNL, M. et LJUBIC, I. (2016). A Node-Based Layered Graph Approach for the Steiner Tree Problem with Revenues, Budget and Hop-Constraints. <i>Mathematical Programming Computation</i>, 8(4), pp. 461–490.
SINNL, M. et LJUBIC, I. (2016). A Node-Based Layered Graph Approach for the Steiner Tree Problem wit
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => ""
"keywords" => array:6 [
0 => "Mixed integer programming"
1 => "Exact computation"
2 => "Hop-constrained trees"
3 => "Branch-and-cut"
4 => "Layered graph"
5 => "Node-based model"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://link.springer.com/article/10.1007/s12532-016-0102-1"
"publicationInfo" => array:3 [
"pages" => "461–490"
"volume" => "8"
"number" => "4"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The Steiner tree problem with revenues, budget and hop-constraints (STPRBH) is a variant of the classical Steiner tree problem. The goal is to find a tree maximizing the collected revenue, which is associated with nodes, subject to a given budget for the edge cost of the tree and a hop-limit for the distance between the given root node and any other node in that tree. In this work, we introduce a novel generic way to model hop-constrained tree problems as integer linear programs and apply it to the STPRBH. Our approach is based on the concept of layered graphs that gained widespread attention in the recent years, due to their computational advantage when compared to previous formulations for modeling hop-constraints. Contrary to previous MIP formulations based on layered graphs (that are arc-based models), our model is node-based. Thus it contains much less variables and allows to tackle large-scale instances and/or instances with large hop-limits, for which the size of arc-based layered graph models may become prohibitive. The aim of our model is to provide a good compromise between quality of root relaxation bounds and the size of the underlying MIP formulation. We implemented a branch-and-cut algorithm for the STPRBH based on our new model. Most of the instances available for the DIMACS challenge, including 78 (out of 86) previously unsolved ones, can be solved to proven optimality within a time limit of 1000 s, most of them being solved within a few seconds only. These instances contain up to 500 nodes and 12,500 edges, with hop-limit up to 25.
The Steiner tree problem with revenues, budget and hop-constraints (STPRBH) is a variant of the clas
"
"en" => "The Steiner tree problem with revenues, budget and hop-constraints (STPRBH) is a variant of the classical Steiner tree problem. The goal is to find a tree maximizing the collected revenue, which is associated with nodes, subject to a given budget for the edge cost of the tree and a hop-limit for the distance between the given root node and any other node in that tree. In this work, we introduce a novel generic way to model hop-constrained tree problems as integer linear programs and apply it to the STPRBH. Our approach is based on the concept of layered graphs that gained widespread attention in the recent years, due to their computational advantage when compared to previous formulations for modeling hop-constraints. Contrary to previous MIP formulations based on layered graphs (that are arc-based models), our model is node-based. Thus it contains much less variables and allows to tackle large-scale instances and/or instances with large hop-limits, for which the size of arc-based layered graph models may become prohibitive. The aim of our model is to provide a good compromise between quality of root relaxation bounds and the size of the underlying MIP formulation. We implemented a branch-and-cut algorithm for the STPRBH based on our new model. Most of the instances available for the DIMACS challenge, including 78 (out of 86) previously unsolved ones, can be solved to proven optimality within a time limit of 1000 s, most of them being solved within a few seconds only. These instances contain up to 500 nodes and 12,500 edges, with hop-limit up to 25.
The Steiner tree problem with revenues, budget and hop-constraints (STPRBH) is a variant of the clas
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
35 => Essec\Faculty\Model\Contribution {#2397
#_index: "academ_contributions"
#_id: "617"
#_source: array:18 [
"id" => "617"
"slug" => "an-algorithmic-framework-for-the-exact-solution-of-tree-star-problems"
"yearMonth" => "2017-06"
"year" => "2017"
"title" => "An Algorithmic Framework for the Exact Solution of Tree-Star Problems"
"description" => "LEITNER, M., LJUBIC, I., SALAZAR-GONZALEZ, J.J. et SINNL, M. (2017). An Algorithmic Framework for the Exact Solution of Tree-Star Problems. <i>European Journal of Operational Research</i>, 1(261), pp. 54-66.
LEITNER, M., LJUBIC, I., SALAZAR-GONZALEZ, J.J. et SINNL, M. (2017). An Algorithmic Framework for th
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER M."
]
2 => array:1 [
"name" => "SALAZAR-GONZALEZ J.-J."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Combinatorial optimization"
1 => "Connected facility location"
2 => "Branch-and-cut"
3 => "Dual ascent"
4 => "Benders decomposition"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S0377221717301170"
"publicationInfo" => array:3 [
"pages" => "54-66"
"volume" => "1"
"number" => "261"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Many problems arising in the area of telecommunication ask for solutions with a tree-star topology. This paper proposes a general procedure for finding optimal solutions to a family of these problems. The family includes problems in the literature named as connected facility location, rent-or-buy and generalized Steiner tree-star. We propose a solution framework based on a branch-and-cut algorithm which also relies on sophisticated reduction and heuristic techniques. An important ingredient of this framework is a dual ascent procedure for asymmetric connected facility location. This paper shows how this procedure can be exploited in combination with various mixed integer programming formulations. Using the new framework, many benchmark instances in the literature for which only heuristic results were available so far, can be solved to provable optimality within seconds. To better assess the computational performance of the new approach, we additionally consider larger instances and provide optimal solutions for most of them too.
Many problems arising in the area of telecommunication ask for solutions with a tree-star topology.
"
"en" => "Many problems arising in the area of telecommunication ask for solutions with a tree-star topology. This paper proposes a general procedure for finding optimal solutions to a family of these problems. The family includes problems in the literature named as connected facility location, rent-or-buy and generalized Steiner tree-star. We propose a solution framework based on a branch-and-cut algorithm which also relies on sophisticated reduction and heuristic techniques. An important ingredient of this framework is a dual ascent procedure for asymmetric connected facility location. This paper shows how this procedure can be exploited in combination with various mixed integer programming formulations. Using the new framework, many benchmark instances in the literature for which only heuristic results were available so far, can be solved to provable optimality within seconds. To better assess the computational performance of the new approach, we additionally consider larger instances and provide optimal solutions for most of them too.
Many problems arising in the area of telecommunication ask for solutions with a tree-star topology.
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
36 => Essec\Faculty\Model\Contribution {#2398
#_index: "academ_contributions"
#_id: "622"
#_source: array:18 [
"id" => "622"
"slug" => "an-effective-dynamic-programming-algorithm-for-the-minimum-cost-maximal-knapsack-packing-problem"
"yearMonth" => "2017-10"
"year" => "2017"
"title" => "An Effective Dynamic Programming Algorithm for the Minimum-Cost Maximal Knapsack Packing Problem"
"description" => "FURINI, F., LJUBIC, I. et SINNL, M. (2017). An Effective Dynamic Programming Algorithm for the Minimum-Cost Maximal Knapsack Packing Problem. <i>European Journal of Operational Research</i>, 262(2), pp. 438-448.
FURINI, F., LJUBIC, I. et SINNL, M. (2017). An Effective Dynamic Programming Algorithm for the Minim
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI F."
]
2 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Combinatorial optimization"
1 => "Maximal knapsack packing"
2 => "Minimal knapsack cover"
3 => "Dynamic programming"
4 => "Integer programming"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S0377221717302928"
"publicationInfo" => array:3 [
"pages" => "438-448"
"volume" => "262"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Given a set of items with profits and weights and a knapsack capacity, we study the problem of finding a maximal knapsack packing that minimizes the profit of the selected items. We propose an effective dynamic programming (DP) algorithm which has a pseudo-polynomial time complexity. We demonstrate the equivalence between this problem and the problem of finding a minimal knapsack cover that maximizes the profit of the selected items. In an extensive computational study on a large and diverse set of benchmark instances, we demonstrate that the new DP algorithm outperforms a state-of-the-art commercial mixed-integer programming (MIP) solver applied to the two best performing MIP models from the literature.
Given a set of items with profits and weights and a knapsack capacity, we study the problem of findi
"
"en" => "Given a set of items with profits and weights and a knapsack capacity, we study the problem of finding a maximal knapsack packing that minimizes the profit of the selected items. We propose an effective dynamic programming (DP) algorithm which has a pseudo-polynomial time complexity. We demonstrate the equivalence between this problem and the problem of finding a minimal knapsack cover that maximizes the profit of the selected items. In an extensive computational study on a large and diverse set of benchmark instances, we demonstrate that the new DP algorithm outperforms a state-of-the-art commercial mixed-integer programming (MIP) solver applied to the two best performing MIP models from the literature.
Given a set of items with profits and weights and a knapsack capacity, we study the problem of findi
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
37 => Essec\Faculty\Model\Contribution {#2399
#_index: "academ_contributions"
#_id: "717"
#_source: array:18 [
"id" => "717"
"slug" => "benders-decomposition-for-very-large-scale-partial-set-covering-and-maximal-covering-location-problems
benders-decomposition-for-very-large-scale-partial-set-covering-and-maximal-covering-location-proble
"
"yearMonth" => "2019-06"
"year" => "2019"
"title" => "Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Location Problems
Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Location Proble
"
"description" => "CORDEAU, J.F., FURINI, F. et LJUBIC, I. (2019). Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Location Problems. <i>European Journal of Operational Research</i>, 275(3), pp. 882-896.
CORDEAU, J.F., FURINI, F. et LJUBIC, I. (2019). Benders Decomposition for Very Large Scale Partial S
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "CORDEAU Jean-François"
]
2 => array:1 [
"name" => "FURINI Fabio"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Combinatorial optimization"
1 => "Location problems"
2 => "Covering"
3 => "Benders decomposition"
4 => "Branch-and-cut algorithms"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S0377221718310737?via%3Dihub"
"publicationInfo" => array:3 [
"pages" => "882-896"
"volume" => "275"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Covering problems constitute a fundamental family of facility location problems. This paper introduces a new exact algorithm for two important members of this family: (i) the maximal covering location problem (MCLP), which requires finding a subset of facilities that maximizes the amount of customer demand covered while respecting a budget constraint on the cost of the facilities; and (ii) the partial set covering location problem (PSCLP), which minimizes the cost of the open facilities while forcing a certain amount of customer demand to be covered. We study an effective decomposition approach to the two problems based on the branch-and-Benders-cut reformulation. Our new approach is designed for the realistic case in which the number of customers is much larger than the number of potential facility locations. We report the results of a series of computational experiments demonstrating that, thanks to this decomposition techniques, optimal solutions can be found very quickly for some benchmark instances with one hundred potential facility locations and involving up to 15 and 40 million customer demand points for the MCLP and the PSCLP, respectively.
Covering problems constitute a fundamental family of facility location problems. This paper introduc
"
"en" => "Covering problems constitute a fundamental family of facility location problems. This paper introduces a new exact algorithm for two important members of this family: (i) the maximal covering location problem (MCLP), which requires finding a subset of facilities that maximizes the amount of customer demand covered while respecting a budget constraint on the cost of the facilities; and (ii) the partial set covering location problem (PSCLP), which minimizes the cost of the open facilities while forcing a certain amount of customer demand to be covered. We study an effective decomposition approach to the two problems based on the branch-and-Benders-cut reformulation. Our new approach is designed for the realistic case in which the number of customers is much larger than the number of potential facility locations. We report the results of a series of computational experiments demonstrating that, thanks to this decomposition techniques, optimal solutions can be found very quickly for some benchmark instances with one hundred potential facility locations and involving up to 15 and 40 million customer demand points for the MCLP and the PSCLP, respectively.
Covering problems constitute a fundamental family of facility location problems. This paper introduc
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
38 => Essec\Faculty\Model\Contribution {#2400
#_index: "academ_contributions"
#_id: "718"
#_source: array:18 [
"id" => "718"
"slug" => "benders-decomposition-without-separability-a-computational-study-for-capacitated-facility-location-problems
benders-decomposition-without-separability-a-computational-study-for-capacitated-facility-location-p
"
"yearMonth" => "2016-09"
"year" => "2016"
"title" => "Benders Decomposition without Separability: A Computational Study for Capacitated Facility Location Problems
Benders Decomposition without Separability: A Computational Study for Capacitated Facility Location
"
"description" => "FICHETTI, M., LJUBIC, I. et SINNL, M. (2016). Benders Decomposition without Separability: A Computational Study for Capacitated Facility Location Problems. <i>European Journal of Operational Research</i>, 253(3), pp. 557-569.
FICHETTI, M., LJUBIC, I. et SINNL, M. (2016). Benders Decomposition without Separability: A Computat
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FICHETTI M."
]
2 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Benders decomposition"
1 => "Congested capacitated facility location"
2 => "Perspective reformulation"
3 => "Branch-and-cut"
4 => "Mixed-integer convex programming"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S0377221716301126"
"publicationInfo" => array:3 [
"pages" => "557-569"
"volume" => "253"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The authors propose a simplified way of deriving Benders cuts for convex optimization. The method is applied to linear / quadratic capacitated facility location problems. For linear case, our Benders method qualifies as one of the best exact solvers. For quadratic case, our Benders method is by far the best available exact solver. Our Benders heuristics outperform previous proposals from the literature
The authors propose a simplified way of deriving Benders cuts for convex optimization. The method is
"
"en" => "The authors propose a simplified way of deriving Benders cuts for convex optimization. The method is applied to linear / quadratic capacitated facility location problems. For linear case, our Benders method qualifies as one of the best exact solvers. For quadratic case, our Benders method is by far the best available exact solver. Our Benders heuristics outperform previous proposals from the literature
The authors propose a simplified way of deriving Benders cuts for convex optimization. The method is
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
39 => Essec\Faculty\Model\Contribution {#2401
#_index: "academ_contributions"
#_id: "956"
#_source: array:18 [
"id" => "956"
"slug" => "decomposition-methods-for-the-two-stage-stochastic-steiner-tree-problem"
"yearMonth" => "2018-04"
"year" => "2018"
"title" => "Decomposition Methods for the Two-Stage Stochastic Steiner Tree Problem"
"description" => "LEITNER, M., LJUBIC, I., LUIPERSBECK, M. et SINNL, M. (2018). Decomposition Methods for the Two-Stage Stochastic Steiner Tree Problem. <i>Computational Optimization and Applications</i>, 69(3), pp. 713-752.
LEITNER, M., LJUBIC, I., LUIPERSBECK, M. et SINNL, M. (2018). Decomposition Methods for the Two-Stag
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER M."
]
2 => array:1 [
"name" => "LUIPERSBECK M."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Lagrangian relaxation"
1 => "Benders decomposition"
2 => "Stochastic optimization"
3 => "Steiner trees"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://link.springer.com/article/10.1007%2Fs10589-017-9966-x"
"publicationInfo" => array:3 [
"pages" => "713-752"
"volume" => "69"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
A new algorithmic approach for solving the stochastic Steiner tree problem based on three procedures for computing lower bounds (dual ascent, Lagrangian relaxation,Benders decomposition) is introduced. Our method is derived from a new integer linear programming formulation, which is shown to be strongest among all known formulations. The resulting method, which relies on an interplay of the dual information retrieved from the respective dual procedures, computes upper and lower bounds and combines them with several rules for fixing variables in order to decrease the size of problem instances. The effectiveness of our method is compared in an extensive computational study with the state-of-the-art exact approach, which employs a Benders decomposition based on two-stage branch-and-cut, and a genetic algorithm introduced during the DIMACS implementation challenge on Steiner trees. Our results indicate that the presented method significantly outperforms existing ones, both on benchmark\n
A new algorithmic approach for solving the stochastic Steiner tree problem based on three procedures
instances from literature, as well as on large-scale telecommunication networks.
"""
"en" => """
A new algorithmic approach for solving the stochastic Steiner tree problem based on three procedures for computing lower bounds (dual ascent, Lagrangian relaxation,Benders decomposition) is introduced. Our method is derived from a new integer linear programming formulation, which is shown to be strongest among all known formulations. The resulting method, which relies on an interplay of the dual information retrieved from the respective dual procedures, computes upper and lower bounds and combines them with several rules for fixing variables in order to decrease the size of problem instances. The effectiveness of our method is compared in an extensive computational study with the state-of-the-art exact approach, which employs a Benders decomposition based on two-stage branch-and-cut, and a genetic algorithm introduced during the DIMACS implementation challenge on Steiner trees. Our results indicate that the presented method significantly outperforms existing ones, both on benchmark\n
A new algorithmic approach for solving the stochastic Steiner tree problem based on three procedures
instances from literature, as well as on large-scale telecommunication networks.
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
40 => Essec\Faculty\Model\Contribution {#2402
#_index: "academ_contributions"
#_id: "10375"
#_source: array:18 [
"id" => "10375"
"slug" => "a-branch-and-cut-and-price-algorithm-for-vertex-biconnectivity-augmentation"
"yearMonth" => "2010-10"
"year" => "2010"
"title" => "A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation"
"description" => "LJUBIC, I. (2010). A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation. <i>Networks</i>, 56(3), pp. 169-182.
LJUBIC, I. (2010). A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation. <i>N
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:33"
"publicationUrl" => "https://www.researchgate.net/publication/220209511_A_Branch-and-Cut-and-Price_Algorithm_for_Vertex-Biconnectivity_Augmentation
https://www.researchgate.net/publication/220209511_A_Branch-and-Cut-and-Price_Algorithm_for_Vertex-B
"
"publicationInfo" => array:3 [
"pages" => "169-182"
"volume" => "56"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In this article, the first approach for solving the vertex-biconnectivity augmentation problem (V2AUG) to optimality is proposed. Given a spanning subgraph of an edge-weighted graph, we search for the cheapest subset of edges to augment this subgraph to make it vertex-biconnected. The problem is reduced to augmentation of the corresponding block-cut tree [Khuller and Thummella, J Algorithms 14 (1993), 214–225], and its connectivity properties are exploited to develop two minimum-cut-based ILP formulations: a directed and an undirected one. In contrast to the recently obtained result for the more general vertex-biconnected Steiner network problem [Chimani et al., Proceedings of 2nd Annual International Conference on Combinatorial Optimization and Applications, Lecture Notes in Computer Science, Vol. 5165, Springer, 2008, pp. 190–200.], our theoretical comparison shows that orienting the undirected graph does not help in improving the quality of lower bounds. Hence, starting from the undirected cut formulation, we develop a branch-and-cut-and-price (BCP) algorithm which represents the first exact approach to V2AUG. Our computational experiments show the practical feasibility of BCP: complete graphs with more than 400 vertices can be solved to provable optimality. Furthermore, BCP is even faster than state-of-the-art metaheuristics and approximation algorithms, for graphs up to 200 vertices. For large graphs with more than 2000 vertices, optimality gaps that are strictly below 2% are reported. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010
In this article, the first approach for solving the vertex-biconnectivity augmentation problem (V2AU
"
"en" => "In this article, the first approach for solving the vertex-biconnectivity augmentation problem (V2AUG) to optimality is proposed. Given a spanning subgraph of an edge-weighted graph, we search for the cheapest subset of edges to augment this subgraph to make it vertex-biconnected. The problem is reduced to augmentation of the corresponding block-cut tree [Khuller and Thummella, J Algorithms 14 (1993), 214–225], and its connectivity properties are exploited to develop two minimum-cut-based ILP formulations: a directed and an undirected one. In contrast to the recently obtained result for the more general vertex-biconnected Steiner network problem [Chimani et al., Proceedings of 2nd Annual International Conference on Combinatorial Optimization and Applications, Lecture Notes in Computer Science, Vol. 5165, Springer, 2008, pp. 190–200.], our theoretical comparison shows that orienting the undirected graph does not help in improving the quality of lower bounds. Hence, starting from the undirected cut formulation, we develop a branch-and-cut-and-price (BCP) algorithm which represents the first exact approach to V2AUG. Our computational experiments show the practical feasibility of BCP: complete graphs with more than 400 vertices can be solved to provable optimality. Furthermore, BCP is even faster than state-of-the-art metaheuristics and approximation algorithms, for graphs up to 200 vertices. For large graphs with more than 2000 vertices, optimality gaps that are strictly below 2% are reported. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010
In this article, the first approach for solving the vertex-biconnectivity augmentation problem (V2AU
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
41 => Essec\Faculty\Model\Contribution {#2403
#_index: "academ_contributions"
#_id: "10405"
#_source: array:18 [
"id" => "10405"
"slug" => "orientation-based-models-for-012-survivable-network-design-theory-and-practice"
"yearMonth" => "2010-07"
"year" => "2010"
"title" => "Orientation-based models for {0,1,2}-survivable network design: theory and practice"
"description" => "CHIMANI, M., KANDYBA, M., LJUBIC, I. et MUTZEL, P. (2010). Orientation-based models for {0,1,2}-survivable network design: theory and practice. <i>Mathematical Programming</i>, 124(1), pp. 413-440.
CHIMANI, M., KANDYBA, M., LJUBIC, I. et MUTZEL, P. (2010). Orientation-based models for {0,1,2}-surv
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "CHIMANI Markus"
]
2 => array:1 [
"name" => "KANDYBA Maria"
]
3 => array:1 [
"name" => "MUTZEL Petra"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:34"
"publicationUrl" => "https://www.researchgate.net/publication/225149430_Orientation-based_models_for_012-survivable_network_design_Theory_and_practice
https://www.researchgate.net/publication/225149430_Orientation-based_models_for_012-survivable_netwo
"
"publicationInfo" => array:3 [
"pages" => "413-440"
"volume" => "124"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We consider {0,1,2}-Survivable Network Design problems with node-connectivity constraints. In the most prominent variant, we are given an edge-weighted graph and two customer sets ℛ1 and ℛ2 ; we ask for a minimum cost subgraph that connects all customers, and guarantees two-node-connectivity for the ℛ2 customers. We also consider an alternative of this problem, in which 2-node-connectivity is only required w.r.t. a certain root node, and its prize-collecting variant. The central result of this paper is a novel graph-theoretical characterization of 2-node-connected graphs via orientation properties. This allows us to derive two classes of ILP formulations based on directed graphs, one using multi-commodity flow and one using cut-inequalities. We prove the theoretical advantages of these directed models compared to the previously known ILP approaches. We show that our two concepts are equivalent from the polyhedral point of view. On the other hand, our experimental study shows that the cut formulation is much more powerful in practice. Moreover, we propose a collection of benchmark instances that can be used for further research on this topic.
We consider {0,1,2}-Survivable Network Design problems with node-connectivity constraints. In the mo
"
"en" => "We consider {0,1,2}-Survivable Network Design problems with node-connectivity constraints. In the most prominent variant, we are given an edge-weighted graph and two customer sets ℛ1 and ℛ2 ; we ask for a minimum cost subgraph that connects all customers, and guarantees two-node-connectivity for the ℛ2 customers. We also consider an alternative of this problem, in which 2-node-connectivity is only required w.r.t. a certain root node, and its prize-collecting variant. The central result of this paper is a novel graph-theoretical characterization of 2-node-connected graphs via orientation properties. This allows us to derive two classes of ILP formulations based on directed graphs, one using multi-commodity flow and one using cut-inequalities. We prove the theoretical advantages of these directed models compared to the previously known ILP approaches. We show that our two concepts are equivalent from the polyhedral point of view. On the other hand, our experimental study shows that the cut formulation is much more powerful in practice. Moreover, we propose a collection of benchmark instances that can be used for further research on this topic.
We consider {0,1,2}-Survivable Network Design problems with node-connectivity constraints. In the mo
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
42 => Essec\Faculty\Model\Contribution {#2404
#_index: "academ_contributions"
#_id: "10415"
#_source: array:18 [
"id" => "10415"
"slug" => "the-regenerator-location-problem"
"yearMonth" => "2010-05"
"year" => "2010"
"title" => "The regenerator location problem"
"description" => "LJUBIC, I. et CHEN, S. (2010). The regenerator location problem. <i>Networks</i>, 55(3), pp. 205-220.
LJUBIC, I. et CHEN, S. (2010). The regenerator location problem. <i>Networks</i>, 55(3), pp. 205-220
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "CHEN Si"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:34"
"publicationUrl" => "https://doi.org/10.1002/net.20366"
"publicationInfo" => array:3 [
"pages" => "205-220"
"volume" => "55"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In this article, we introduce the regenerator location problem (RLP), which deals with a constraint on the geographical extent of transmission in optical networks. Specifically, an optical signal can only travel a maximum distance of dmax before its quality deteriorates to the point that it must be regenerated by installing regenerators at nodes of the network. As the cost of a regenerator is high, we wish to deploy as few regenerators as possible in the network, while ensuring all nodes can communicate with each other. We show that the RLP is NP‐Complete. We then devise three heuristics for the RLP. We show how to represent the RLP as a max leaf spanning tree problem (MLSTP) on a transformed graph. Using this fact, we model the RLP as a Steiner arborescence problem (SAP) with a unit degree constraint on the root node. We also devise a branch‐and‐cut procedure to the directed cut formulation for the SAP problem. In our computational results over 740 test instances, the heuristic procedures obtained the optimal solution in 454 instances, whereas the branch‐and‐cut procedure obtained the optimal solution in 536 instances. These results indicate the quality of the heuristic solutions are quite good, and the branch‐and‐cut approach is viable for the optimal solution of problems with up to 100 nodes. Our approaches are also directly applicable to the MLSTP indicating that both the heuristics and branch‐and‐cut approach are viable options for the MLSTP. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010
In this article, we introduce the regenerator location problem (RLP), which deals with a constraint
"
"en" => "In this article, we introduce the regenerator location problem (RLP), which deals with a constraint on the geographical extent of transmission in optical networks. Specifically, an optical signal can only travel a maximum distance of dmax before its quality deteriorates to the point that it must be regenerated by installing regenerators at nodes of the network. As the cost of a regenerator is high, we wish to deploy as few regenerators as possible in the network, while ensuring all nodes can communicate with each other. We show that the RLP is NP‐Complete. We then devise three heuristics for the RLP. We show how to represent the RLP as a max leaf spanning tree problem (MLSTP) on a transformed graph. Using this fact, we model the RLP as a Steiner arborescence problem (SAP) with a unit degree constraint on the root node. We also devise a branch‐and‐cut procedure to the directed cut formulation for the SAP problem. In our computational results over 740 test instances, the heuristic procedures obtained the optimal solution in 454 instances, whereas the branch‐and‐cut procedure obtained the optimal solution in 536 instances. These results indicate the quality of the heuristic solutions are quite good, and the branch‐and‐cut approach is viable for the optimal solution of problems with up to 100 nodes. Our approaches are also directly applicable to the MLSTP indicating that both the heuristics and branch‐and‐cut approach are viable options for the MLSTP. © 2009 Wiley Periodicals, Inc. NETWORKS, 2010
In this article, we introduce the regenerator location problem (RLP), which deals with a constraint
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
43 => Essec\Faculty\Model\Contribution {#2405
#_index: "academ_contributions"
#_id: "10426"
#_source: array:18 [
"id" => "10426"
"slug" => "mip-models-for-connected-facility-location-a-theoretical-and-computational-study"
"yearMonth" => "2011-02"
"year" => "2011"
"title" => "MIP models for connected facility location: A theoretical and computational study"
"description" => "GOLLOWITZER, S. et LJUBIC, I. (2011). MIP models for connected facility location: A theoretical and computational study. <i>Computers & Operations Research</i>, 38(2), pp. 435-449.
GOLLOWITZER, S. et LJUBIC, I. (2011). MIP models for connected facility location: A theoretical and
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GOLLOWITZER Stefan"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Facility location"
1 => "Steiner trees"
2 => "Mixed integer programming models"
3 => "LP-relaxations"
]
"updatedAt" => "2021-07-13 14:31:35"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2010.07.002"
"publicationInfo" => array:3 [
"pages" => "435-449"
"volume" => "38"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines facility location and Steiner trees: given a set of customers, a set of potential facility locations and some inter-connection nodes, ConFL searches for the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The costs needed for building the Steiner tree, facility opening costs and the assignment costs need to be minimized.\n
This article comprises the first theoretical and computational study on mixed integer programming (M
\n
We model ConFL using seven compact and three mixed integer programming formulations of exponential size. We also show how to transform ConFL into the Steiner arborescence problem. A full hierarchy between the models is provided. For two exponential size models we develop a branch-and-cut algorithm. An extensive computational study is based on two benchmark sets of randomly generated instances with up to 1300 nodes and 115,000 edges. We empirically compare the presented models with respect to the quality of obtained bounds and the corresponding running time. We report optimal values for all but 16 instances for which the obtained gaps are below 0.6%.
We model ConFL using seven compact and three mixed integer programming formulations of exponential s
"""
"en" => """
This article comprises the first theoretical and computational study on mixed integer programming (MIP) models for the connected facility location problem (ConFL). ConFL combines facility location and Steiner trees: given a set of customers, a set of potential facility locations and some inter-connection nodes, ConFL searches for the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The costs needed for building the Steiner tree, facility opening costs and the assignment costs need to be minimized.\n
This article comprises the first theoretical and computational study on mixed integer programming (M
\n
We model ConFL using seven compact and three mixed integer programming formulations of exponential size. We also show how to transform ConFL into the Steiner arborescence problem. A full hierarchy between the models is provided. For two exponential size models we develop a branch-and-cut algorithm. An extensive computational study is based on two benchmark sets of randomly generated instances with up to 1300 nodes and 115,000 edges. We empirically compare the presented models with respect to the quality of obtained bounds and the corresponding running time. We report optimal values for all but 16 instances for which the obtained gaps are below 0.6%.
We model ConFL using seven compact and three mixed integer programming formulations of exponential s
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
44 => Essec\Faculty\Model\Contribution {#2406
#_index: "academ_contributions"
#_id: "10456"
#_source: array:18 [
"id" => "10456"
"slug" => "exact-approaches-to-the-single-source-network-loading-problem"
"yearMonth" => "2012-01"
"year" => "2012"
"title" => "Exact approaches to the single-source network loading problem"
"description" => "LJUBIC, I., PUTZ, P. et SALAZAR-GONZALEZ, J.J. (2012). Exact approaches to the single-source network loading problem. <i>Networks</i>, 59(1), pp. 89-106.
LJUBIC, I., PUTZ, P. et SALAZAR-GONZALEZ, J.J. (2012). Exact approaches to the single-source network
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "PUTZ Peter"
]
2 => array:1 [
"name" => "SALAZAR-GONZALEZ Juan-José"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:35"
"publicationUrl" => "https://doi.org/10.1002/net.20481"
"publicationInfo" => array:3 [
"pages" => "89-106"
"volume" => "59"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "This article considers the network design problem that searches for a minimum‐cost way of installing capacities on the edges of a network to simultaneously route a flow from a given access point to a subset of nodes representing customers with positive demands. We first consider compact and exponential‐sized Mixed Integer Programming (MIP) formulations of the problem and provide their theoretical and computational comparison. We also consider a stronger disaggregated flow formulation. To solve the problem in practice, we project out the flow variables and generate Benders cuts within a branch‐and‐cut framework. To the best of our knowledge, the combination of Benders approach and this specific disaggregation has not been considered so far. In an extensive computational study, we compare the performance of compact MIP models against a textbook implementation and several normalization variants of Benders decomposition. We introduce a set of 32 real‐world instances and use these, together with 64 other instances from the literature, to test our approaches. The results show that our branch‐and‐cut approach outperforms the best performing compact formulation leading to the best exact algorithm today for solving the considered dataset. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012
This article considers the network design problem that searches for a minimum‐cost way of installing
"
"en" => "This article considers the network design problem that searches for a minimum‐cost way of installing capacities on the edges of a network to simultaneously route a flow from a given access point to a subset of nodes representing customers with positive demands. We first consider compact and exponential‐sized Mixed Integer Programming (MIP) formulations of the problem and provide their theoretical and computational comparison. We also consider a stronger disaggregated flow formulation. To solve the problem in practice, we project out the flow variables and generate Benders cuts within a branch‐and‐cut framework. To the best of our knowledge, the combination of Benders approach and this specific disaggregation has not been considered so far. In an extensive computational study, we compare the performance of compact MIP models against a textbook implementation and several normalization variants of Benders decomposition. We introduce a set of 32 real‐world instances and use these, together with 64 other instances from the literature, to test our approaches. The results show that our branch‐and‐cut approach outperforms the best performing compact formulation leading to the best exact algorithm today for solving the considered dataset. © 2011 Wiley Periodicals, Inc. NETWORKS, 2012
This article considers the network design problem that searches for a minimum‐cost way of installing
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
45 => Essec\Faculty\Model\Contribution {#2407
#_index: "academ_contributions"
#_id: "10465"
#_source: array:18 [
"id" => "10465"
"slug" => "layered-graph-approaches-to-the-hop-constrained-connected-facility-location-problem"
"yearMonth" => "2012-04"
"year" => "2012"
"title" => "Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem"
"description" => "LJUBIC, I. et GOLLOWITZER, S. (2012). Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem. <i>INFORMS Journal on Computing</i>, 25(2), pp. 256-270.
LJUBIC, I. et GOLLOWITZER, S. (2012). Layered Graph Approaches to the Hop Constrained Connected Faci
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GOLLOWITZER S."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:36"
"publicationUrl" => "https://www.researchgate.net/publication/228913688_Layered_Graph_Approaches_to_the_Hop_Constrained_Connected_Facility_Location_Problem
https://www.researchgate.net/publication/228913688_Layered_Graph_Approaches_to_the_Hop_Constrained_C
"
"publicationInfo" => array:3 [
"pages" => "256-270"
"volume" => "25"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Given a set of customers, a set of potential facility locations and some inter-connection nodes, the goal of the Connected Facility Location problem (ConFL) is to find the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The sum of costs needed for building the Steiner tree, facility opening costs and the assignment costs needs to be minimized. If the number of edges between a pre-specified node (the so-called root) and each open facility is limited, we speak of the Hop Constrained Facility Location problem (HC ConFL). This problem is of importance in the design of data-management and telecommunication networks. In this article we provide the first theoretical and computational study for this new problem that has not been studied in the literature so far. We propose two disaggregation techniques that enable to model HC ConFL: i) as directed (asymmetric) ConFL on layered graphs, or ii) as the Steiner arborescence problem (SA) on layered graphs. This allows for usage of best-known MIP models for ConFL or SA to solve the corresponding hop constrained problem to optimality. In our polyhedral study, we compare the obtained models with respect to the quality of their LP lower bounds. These models are finally computationally compared in an extensive computational study on a set of publicly available benchmark instances. Optimal values are reported for instances with up to 1300 nodes and 115 000 edges.
Given a set of customers, a set of potential facility locations and some inter-connection nodes, the
"
"en" => "Given a set of customers, a set of potential facility locations and some inter-connection nodes, the goal of the Connected Facility Location problem (ConFL) is to find the minimum-cost way of assigning each customer to exactly one open facility, and connecting the open facilities via a Steiner tree. The sum of costs needed for building the Steiner tree, facility opening costs and the assignment costs needs to be minimized. If the number of edges between a pre-specified node (the so-called root) and each open facility is limited, we speak of the Hop Constrained Facility Location problem (HC ConFL). This problem is of importance in the design of data-management and telecommunication networks. In this article we provide the first theoretical and computational study for this new problem that has not been studied in the literature so far. We propose two disaggregation techniques that enable to model HC ConFL: i) as directed (asymmetric) ConFL on layered graphs, or ii) as the Steiner arborescence problem (SA) on layered graphs. This allows for usage of best-known MIP models for ConFL or SA to solve the corresponding hop constrained problem to optimality. In our polyhedral study, we compare the obtained models with respect to the quality of their LP lower bounds. These models are finally computationally compared in an extensive computational study on a set of publicly available benchmark instances. Optimal values are reported for instances with up to 1300 nodes and 115 000 edges.
Given a set of customers, a set of potential facility locations and some inter-connection nodes, the
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
46 => Essec\Faculty\Model\Contribution {#2408
#_index: "academ_contributions"
#_id: "10471"
#_source: array:18 [
"id" => "10471"
"slug" => "qtl-mapping-using-a-memetic-algorithm-with-modifications-of-bic-as-fitness-function"
"yearMonth" => "2012-05"
"year" => "2012"
"title" => "QTL Mapping Using a Memetic Algorithm with Modifications of BIC as Fitness Function"
"description" => "FROMMLET, F., LJUBIC, I., BJÖRK ARNARDÓTTIR, H. et BOGDAN, M. (2012). QTL Mapping Using a Memetic Algorithm with Modifications of BIC as Fitness Function. <i>Statistical Applications in Genetics and Molecular Biology</i>, 11(4).
FROMMLET, F., LJUBIC, I., BJÖRK ARNARDÓTTIR, H. et BOGDAN, M. (2012). QTL Mapping Using a Memetic Al
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FROMMLET Florian"
]
2 => array:1 [
"name" => "BJÖRK ARNARDÓTTIR Helga"
]
3 => array:1 [
"name" => "BOGDAN Malgorzata"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:36"
"publicationUrl" => "https://www.researchgate.net/publication/225044299_QTL_Mapping_Using_a_Memetic_Algorithm_with_Modifications_of_BIC_as_Fitness_Function
https://www.researchgate.net/publication/225044299_QTL_Mapping_Using_a_Memetic_Algorithm_with_Modifi
"
"publicationInfo" => array:3 [
"pages" => null
"volume" => "11"
"number" => "4"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The problem of locating quantitative trait loci (QTL) for experimental populations can be approached by multiple regression analysis. In this context variable selection using a modification of the Bayesian Information Criterion (mBIC) has been well established in the past. In this article a memetic algorithm (MA) is introduced to find the model which minimizes the selection criterion. Apart from mBIC also a second modification (mBIC2) is considered, which has the property of controlling the false discovery rate. Given the Bayesian nature of our selection criteria, we are not only interested in finding the best model, but also in computing marker posterior probabilities using all models visited by MA. In a simulation study MA (with mBIC and mBIC2) is compared with a parallel genetic algorithm (PGA) which has been previously suggested for QTL mapping. It turns out that MA in combination with mBIC2 performs best, where determining QTL positions based on marker posterior probabilities yields even better results than using the best model selected by MA. Finally we consider a real data set from the literature and show that MA can also be extended to multiple interval mapping, which potentially increases the precision with which the exact location of QTLs can be estimated.
The problem of locating quantitative trait loci (QTL) for experimental populations can be approached
"
"en" => "The problem of locating quantitative trait loci (QTL) for experimental populations can be approached by multiple regression analysis. In this context variable selection using a modification of the Bayesian Information Criterion (mBIC) has been well established in the past. In this article a memetic algorithm (MA) is introduced to find the model which minimizes the selection criterion. Apart from mBIC also a second modification (mBIC2) is considered, which has the property of controlling the false discovery rate. Given the Bayesian nature of our selection criteria, we are not only interested in finding the best model, but also in computing marker posterior probabilities using all models visited by MA. In a simulation study MA (with mBIC and mBIC2) is compared with a parallel genetic algorithm (PGA) which has been previously suggested for QTL mapping. It turns out that MA in combination with mBIC2 performs best, where determining QTL positions based on marker posterior probabilities yields even better results than using the best model selected by MA. Finally we consider a real data set from the literature and show that MA can also be extended to multiple interval mapping, which potentially increases the precision with which the exact location of QTLs can be estimated.
The problem of locating quantitative trait loci (QTL) for experimental populations can be approached
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
47 => Essec\Faculty\Model\Contribution {#2409
#_index: "academ_contributions"
#_id: "10484"
#_source: array:18 [
"id" => "10484"
"slug" => "a-cutting-plane-algorithm-for-the-capacitated-connected-facility-location-problem"
"yearMonth" => "2013-07"
"year" => "2013"
"title" => "A cutting plane algorithm for the Capacitated Connected Facility Location Problem"
"description" => "GOLLOWITZER, S., GENDRON, B. et LJUBIC, I. (2013). A cutting plane algorithm for the Capacitated Connected Facility Location Problem. <i>Computational Optimization and Applications</i>, 55(3), pp. 647-674.
GOLLOWITZER, S., GENDRON, B. et LJUBIC, I. (2013). A cutting plane algorithm for the Capacitated Con
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GOLLOWITZER Stefan"
]
2 => array:1 [
"name" => "GENDRON Bernard"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:36"
"publicationUrl" => "https://doi.org/10.1007/s10589-013-9544-9"
"publicationInfo" => array:3 [
"pages" => "647-674"
"volume" => "55"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We consider a network design problem that arises in the cost-optimal design of last mile telecommunication networks. It extends the Connected Facility Location problem by introducing capacities on the facilities and links of the networks. It combines aspects of the capacitated network design problem and the single-source capacitated facility location problem. We refer to it as the Capacitated Connected Facility Location Problem. We develop a basic integer programming model based on single-commodity flows. Based on valid inequalities for the capacitated network design problem and the single-source capacitated facility location problem we derive several (new) classes of valid inequalities for the Capacitated Connected Facility Location Problem including cut set inequalities, cover inequalities and combinations thereof. We use them in a branch-and-cut framework and show their applicability and efficacy on a set of real-world instances.
We consider a network design problem that arises in the cost-optimal design of last mile telecommuni
"
"en" => "We consider a network design problem that arises in the cost-optimal design of last mile telecommunication networks. It extends the Connected Facility Location problem by introducing capacities on the facilities and links of the networks. It combines aspects of the capacitated network design problem and the single-source capacitated facility location problem. We refer to it as the Capacitated Connected Facility Location Problem. We develop a basic integer programming model based on single-commodity flows. Based on valid inequalities for the capacitated network design problem and the single-source capacitated facility location problem we derive several (new) classes of valid inequalities for the Capacitated Connected Facility Location Problem including cut set inequalities, cover inequalities and combinations thereof. We use them in a branch-and-cut framework and show their applicability and efficacy on a set of real-world instances.
We consider a network design problem that arises in the cost-optimal design of last mile telecommuni
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
48 => Essec\Faculty\Model\Contribution {#2410
#_index: "academ_contributions"
#_id: "10485"
#_source: array:18 [
"id" => "10485"
"slug" => "a-note-on-the-bertsimas-sim-algorithm-for-robust-combinatorial-optimization-problems"
"yearMonth" => "2013-12"
"year" => "2013"
"title" => "A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems"
"description" => "ALVAREZ-MIRANDA, E., LJUBIC, I. et TOTH, P. (2013). A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. <i>4OR: A Quarterly Journal of Operations Research</i>, 11(4), pp. 349-360.
ALVAREZ-MIRANDA, E., LJUBIC, I. et TOTH, P. (2013). A note on the Bertsimas & Sim algorithm for robu
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ALVAREZ-MIRANDA Eduardo"
]
2 => array:1 [
"name" => "TOTH Peter"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:36"
"publicationUrl" => "https://doi.org/10.1007/s10288-013-0231-6"
"publicationInfo" => array:3 [
"pages" => "349-360"
"volume" => "11"
"number" => "4"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We improve the well-known result presented in Bertsimas and Sim (Math Program B98:49–71, 2003) regarding the computation of optimal solutions of Robust Combinatorial Optimization problems with interval uncertainty in the objective function coefficients. We also extend this improvement to a more general class of Combinatorial Optimization problems with interval uncertainty.
We improve the well-known result presented in Bertsimas and Sim (Math Program B98:49–71, 2003) regar
"
"en" => "We improve the well-known result presented in Bertsimas and Sim (Math Program B98:49–71, 2003) regarding the computation of optimal solutions of Robust Combinatorial Optimization problems with interval uncertainty in the objective function coefficients. We also extend this improvement to a more general class of Combinatorial Optimization problems with interval uncertainty.
We improve the well-known result presented in Bertsimas and Sim (Math Program B98:49–71, 2003) regar
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
49 => Essec\Faculty\Model\Contribution {#2411
#_index: "academ_contributions"
#_id: "10491"
#_source: array:18 [
"id" => "10491"
"slug" => "enhanced-formulations-and-branch-and-cut-for-the-two-level-network-design-problem-with-transition-facilities
enhanced-formulations-and-branch-and-cut-for-the-two-level-network-design-problem-with-transition-fa
"
"yearMonth" => "2013-03"
"year" => "2013"
"title" => "Enhanced Formulations and Branch-and-Cut for the Two Level Network Design Problem with Transition Facilities
Enhanced Formulations and Branch-and-Cut for the Two Level Network Design Problem with Transition Fa
"
"description" => "GOLLOWITZER, S., GOUVEIA, L. et LJUBIC, I. (2013). Enhanced Formulations and Branch-and-Cut for the Two Level Network Design Problem with Transition Facilities. <i>European Journal of Operational Research</i>, 225(2), pp. 211-222.
GOLLOWITZER, S., GOUVEIA, L. et LJUBIC, I. (2013). Enhanced Formulations and Branch-and-Cut for the
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GOLLOWITZER Stefan"
]
2 => array:1 [
"name" => "GOUVEIA Luis"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:36"
"publicationUrl" => "https://www.researchgate.net/publication/257196446_Enhanced_formulations_and_branch-and-cut_for_the_two_level_network_design_problem_with_transition_facilities
https://www.researchgate.net/publication/257196446_Enhanced_formulations_and_branch-and-cut_for_the_
"
"publicationInfo" => array:3 [
"pages" => "211-222"
"volume" => "225"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We consider a new combinatorial optimization problem that combines network design and facility location aspects. Given a graph with two types of customers and two technologies that can be installed on the edges, the objective is to find a minimum cost subtree connecting all customers while the primary customers are served by a primary subtree that is embedded into the secondary subtree. In addition, besides fixed link installation costs, facility opening costs, associated to each node where primary and secondary subtree connect, have to be paid. The problem is called the Two Level Network Design Problem with Transition Facilities (TLNDF).We first model the problem on an extended graph where an additional set of arcs corresponds to the installation of node facilities and propose a cut set based model for the TLNDF that is defined on this extended graph. We present several theoretical results relating families of cut set inequalities on the extended graph with subfamilies of cut set inequalities on the original graph. We then show how a standard multi-commodity flow model defined on the original graph can be strengthened using disaggregation “by technology”. We prove that the disaggregated compact formulation on the original graph provides the same lower bound as the cut set formulation on the extended graph.We develop a branch-and-cut algorithm for solving the TLNDF. The performance of this algorithm is improved by separating subfamilies of cut set inequalities on the original graph. Our computational study confirms the efficiency and applicability of the new approach.
We consider a new combinatorial optimization problem that combines network design and facility locat
"
"en" => "We consider a new combinatorial optimization problem that combines network design and facility location aspects. Given a graph with two types of customers and two technologies that can be installed on the edges, the objective is to find a minimum cost subtree connecting all customers while the primary customers are served by a primary subtree that is embedded into the secondary subtree. In addition, besides fixed link installation costs, facility opening costs, associated to each node where primary and secondary subtree connect, have to be paid. The problem is called the Two Level Network Design Problem with Transition Facilities (TLNDF).We first model the problem on an extended graph where an additional set of arcs corresponds to the installation of node facilities and propose a cut set based model for the TLNDF that is defined on this extended graph. We present several theoretical results relating families of cut set inequalities on the extended graph with subfamilies of cut set inequalities on the original graph. We then show how a standard multi-commodity flow model defined on the original graph can be strengthened using disaggregation “by technology”. We prove that the disaggregated compact formulation on the original graph provides the same lower bound as the cut set formulation on the extended graph.We develop a branch-and-cut algorithm for solving the TLNDF. The performance of this algorithm is improved by separating subfamilies of cut set inequalities on the original graph. Our computational study confirms the efficiency and applicability of the new approach.
We consider a new combinatorial optimization problem that combines network design and facility locat
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
50 => Essec\Faculty\Model\Contribution {#2412
#_index: "academ_contributions"
#_id: "10492"
#_source: array:18 [
"id" => "10492"
"slug" => "exact-approaches-for-solving-robust-prize-collecting-steiner-tree-problems-european-journal-of-operational-research
exact-approaches-for-solving-robust-prize-collecting-steiner-tree-problems-european-journal-of-opera
"
"yearMonth" => "2013-09"
"year" => "2013"
"title" => "Exact Approaches for Solving Robust Prize-Collecting Steiner Tree Problems, European Journal of Operational Research
Exact Approaches for Solving Robust Prize-Collecting Steiner Tree Problems, European Journal of Oper
"
"description" => "ALVAREZ-MIRANDA, E., LJUBIC, I. et TOTH, P. (2013). Exact Approaches for Solving Robust Prize-Collecting Steiner Tree Problems, European Journal of Operational Research. <i>European Journal of Operational Research</i>, 229(3), pp. 599-612.
ALVAREZ-MIRANDA, E., LJUBIC, I. et TOTH, P. (2013). Exact Approaches for Solving Robust Prize-Collec
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ALVAREZ-MIRANDA Eduardo"
]
2 => array:1 [
"name" => "TOTH Peter"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:36"
"publicationUrl" => "https://www.researchgate.net/publication/257196505_Exact_approaches_for_solving_robust_prize-collecting_Steiner_tree_problems
https://www.researchgate.net/publication/257196505_Exact_approaches_for_solving_robust_prize-collect
"
"publicationInfo" => array:3 [
"pages" => "599-612"
"volume" => "229"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In the Prize-Collecting Steiner Tree Problem (PCStT) we are given a set of customers with potential revenues and a set of possible links connecting these customers with fixed installation costs. The goal is to decide which customers to connect into a tree structure so that the sum of the link costs plus the revenues of the customers that are left out is minimized. The problem, as well as some of its variants, is used to model a wide range of applications in telecommunications, gas distribution networks, protein–protein interaction networks, or image segmentation.In many applications it is unrealistic to assume that the revenues or the installation costs are known in advance. In this paper we consider the well-known Bertsimas and Sim (B&S) robust optimization approach, in which the input parameters are subject to interval uncertainty, and the level of robustness is controlled by introducing a control parameter, which represents the perception of the decision maker regarding the number of uncertain elements that will present an adverse behavior.We propose branch-and-cut approaches to solve the robust counterparts of the PCStT and the Budget Constraint variant and provide an extensive computational study on a set of benchmark instances that are adapted from the deterministic PCStT inputs. We show how the Price of Robustness influences the cost of the solutions and the algorithmic performance.Finally, we adapt our recent theoretical results regarding algorithms for a general class of B&S robust optimization problems for the robust PCStT and its budget and quota constrained variants.
In the Prize-Collecting Steiner Tree Problem (PCStT) we are given a set of customers with potential
"
"en" => "In the Prize-Collecting Steiner Tree Problem (PCStT) we are given a set of customers with potential revenues and a set of possible links connecting these customers with fixed installation costs. The goal is to decide which customers to connect into a tree structure so that the sum of the link costs plus the revenues of the customers that are left out is minimized. The problem, as well as some of its variants, is used to model a wide range of applications in telecommunications, gas distribution networks, protein–protein interaction networks, or image segmentation.In many applications it is unrealistic to assume that the revenues or the installation costs are known in advance. In this paper we consider the well-known Bertsimas and Sim (B&S) robust optimization approach, in which the input parameters are subject to interval uncertainty, and the level of robustness is controlled by introducing a control parameter, which represents the perception of the decision maker regarding the number of uncertain elements that will present an adverse behavior.We propose branch-and-cut approaches to solve the robust counterparts of the PCStT and the Budget Constraint variant and provide an extensive computational study on a set of benchmark instances that are adapted from the deterministic PCStT inputs. We show how the Price of Robustness influences the cost of the solutions and the algorithmic performance.Finally, we adapt our recent theoretical results regarding algorithms for a general class of B&S robust optimization problems for the robust PCStT and its budget and quota constrained variants.
In the Prize-Collecting Steiner Tree Problem (PCStT) we are given a set of customers with potential
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
51 => Essec\Faculty\Model\Contribution {#2413
#_index: "academ_contributions"
#_id: "10500"
#_source: array:18 [
"id" => "10500"
"slug" => "lagrangian-decompositions-for-the-two-level-fttx-network-design-problem"
"yearMonth" => "2013-11"
"year" => "2013"
"title" => "Lagrangian decompositions for the two-level FTTx network design problem"
"description" => "BLEY, A., LJUBIC, I. et MAURER, O. (2013). Lagrangian decompositions for the two-level FTTx network design problem. <i>Computational Optimization and Applications</i>, 1(3), pp. 221-252.
BLEY, A., LJUBIC, I. et MAURER, O. (2013). Lagrangian decompositions for the two-level FTTx network
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "BLEY Andrea"
]
2 => array:1 [
"name" => "MAURER Olaf"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:37"
"publicationUrl" => "https://doi.org/10.1007/s13675-013-0014-z"
"publicationInfo" => array:3 [
"pages" => "221-252"
"volume" => "1"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We consider the design of a passive optical telecommunication access network, where clients have to be connected to an intermediate level of distribution points (DPs) and further on to some central offices (COs) in a tree-like fashion. Each client demands a given number of fiber connections to its CO. Passive optical splitters installed at the DPs allow k connections to share a single common fiber between the DP and the CO. We consider fixed charge costs for the use of an edge of the underlying street network, of a DP, and of a CO and variable costs for installing fibers along the street edges and for installing splitters at the DPs. We present two Lagrangian decomposition approaches that decompose the problem based on the network structure and on the cost structure, respectively. The subproblems are solved using mixed integer programming (MIP) techniques. We report computational results for realistic instances and compare the efficiency of the Lagrangian approaches to the solutions of an integrated MIP model.
We consider the design of a passive optical telecommunication access network, where clients have to
"
"en" => "We consider the design of a passive optical telecommunication access network, where clients have to be connected to an intermediate level of distribution points (DPs) and further on to some central offices (COs) in a tree-like fashion. Each client demands a given number of fiber connections to its CO. Passive optical splitters installed at the DPs allow k connections to share a single common fiber between the DP and the CO. We consider fixed charge costs for the use of an edge of the underlying street network, of a DP, and of a CO and variable costs for installing fibers along the street edges and for installing splitters at the DPs. We present two Lagrangian decomposition approaches that decompose the problem based on the network structure and on the cost structure, respectively. The subproblems are solved using mixed integer programming (MIP) techniques. We report computational results for realistic instances and compare the efficiency of the Lagrangian approaches to the solutions of an integrated MIP model.
We consider the design of a passive optical telecommunication access network, where clients have to
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
52 => Essec\Faculty\Model\Contribution {#2414
#_index: "academ_contributions"
#_id: "10528"
#_source: array:18 [
"id" => "10528"
"slug" => "a-mip-based-heuristic-approach-to-solve-a-prize-collecting-local-access-network-design-problem"
"yearMonth" => "2014-06"
"year" => "2014"
"title" => "A MIP-based Heuristic Approach to solve a Prize-Collecting Local Access Network Design Problem"
"description" => "LJUBIC, I., PUTZ, P. et SALAZAR-GONZALEZ, J.J. (2014). A MIP-based Heuristic Approach to solve a Prize-Collecting Local Access Network Design Problem. <i>European Journal of Operational Research</i>, 235(3), pp. 727-739.
LJUBIC, I., PUTZ, P. et SALAZAR-GONZALEZ, J.J. (2014). A MIP-based Heuristic Approach to solve a Pri
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "PUTZ Peter"
]
2 => array:1 [
"name" => "SALAZAR-GONZALEZ Juan-José"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Network loading"
1 => "Local access"
2 => "Prize-collecting"
3 => "Matheuristic algorithm"
]
"updatedAt" => "2021-07-13 14:31:37"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2013.11.003"
"publicationInfo" => array:3 [
"pages" => "727-739"
"volume" => "235"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
This paper presents a new combinatorial optimization problem that can be used to model the deployment of broadband telecommunications systems in which optical fiber cables are installed between a central office and a number of end-customers. In this capacitated network design problem the installation of optical fiber cables with sufficient capacity is required to carry the traffic from the central office to the end-customers at minimum cost. In the situation motivating this research the network does not necessarily need to connect all customers (or at least not with the best available technology). Instead, some nodes are potential customers. The aim is to select the customers to be connected to the central server and to choose the cable capacities to establish these connections. The telecom company takes the strategic decision of fixing a percentage of customers that should be served, and aims for minimizing the total cost of the network providing this minimum service. For that reason the underlying problem is called the Prize-Collecting Local Access Network Design problem (PC-LAN).\n
This paper presents a new combinatorial optimization problem that can be used to model the deploymen
\n
We propose a branch-and-cut approach for solving small instances. For large instances of practical importance, our approach turns into a mixed integer programming (MIP) based heuristic procedure which combines the cutting-plane algorithm with a multi-start heuristic algorithm. The multi-start heuristic algorithm starts with fractional values of the LP-solutions and creates feasible solutions that are later improved using a local improvement strategy.\n
We propose a branch-and-cut approach for solving small instances. For large instances of practical i
\n
Computational experiments are conducted on small instances from the literature. In addition, we introduce a new benchmark set of real-world instances with up to 86,000 nodes, 116,000 edges and 1500 potential customers. Using our MIP-based approach we are able to solve most of the small instances to proven optimality. For more difficult instances, we are not only able to provide high-quality feasible solutions, but also to provide certificate on their quality by calculating lower bounds to the optimal solution values.
Computational experiments are conducted on small instances from the literature. In addition, we intr
"""
"en" => """
This paper presents a new combinatorial optimization problem that can be used to model the deployment of broadband telecommunications systems in which optical fiber cables are installed between a central office and a number of end-customers. In this capacitated network design problem the installation of optical fiber cables with sufficient capacity is required to carry the traffic from the central office to the end-customers at minimum cost. In the situation motivating this research the network does not necessarily need to connect all customers (or at least not with the best available technology). Instead, some nodes are potential customers. The aim is to select the customers to be connected to the central server and to choose the cable capacities to establish these connections. The telecom company takes the strategic decision of fixing a percentage of customers that should be served, and aims for minimizing the total cost of the network providing this minimum service. For that reason the underlying problem is called the Prize-Collecting Local Access Network Design problem (PC-LAN).\n
This paper presents a new combinatorial optimization problem that can be used to model the deploymen
\n
We propose a branch-and-cut approach for solving small instances. For large instances of practical importance, our approach turns into a mixed integer programming (MIP) based heuristic procedure which combines the cutting-plane algorithm with a multi-start heuristic algorithm. The multi-start heuristic algorithm starts with fractional values of the LP-solutions and creates feasible solutions that are later improved using a local improvement strategy.\n
We propose a branch-and-cut approach for solving small instances. For large instances of practical i
\n
Computational experiments are conducted on small instances from the literature. In addition, we introduce a new benchmark set of real-world instances with up to 86,000 nodes, 116,000 edges and 1500 potential customers. Using our MIP-based approach we are able to solve most of the small instances to proven optimality. For more difficult instances, we are not only able to provide high-quality feasible solutions, but also to provide certificate on their quality by calculating lower bounds to the optimal solution values.
Computational experiments are conducted on small instances from the literature. In addition, we intr
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
53 => Essec\Faculty\Model\Contribution {#2415
#_index: "academ_contributions"
#_id: "10549"
#_source: array:18 [
"id" => "10549"
"slug" => "hop-constrained-steiner-trees-with-multiple-root-nodes"
"yearMonth" => "2014-06"
"year" => "2014"
"title" => "Hop constrained Steiner trees with multiple root nodes"
"description" => "GOUVEIA, L., LEITNER, M. et LJUBIC, I. (2014). Hop constrained Steiner trees with multiple root nodes. <i>European Journal of Operational Research</i>, 236(1), pp. 100-112.
GOUVEIA, L., LEITNER, M. et LJUBIC, I. (2014). Hop constrained Steiner trees with multiple root node
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GOUVEIA Luis"
]
2 => array:1 [
"name" => "LEITNER Markus"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Integer programming"
1 => "OR in telecommunications"
2 => "Steiner tree"
3 => "Hop-constraints"
]
"updatedAt" => "2021-07-13 14:31:38"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2013.11.029"
"publicationInfo" => array:3 [
"pages" => "100-112"
"volume" => "236"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We consider a network design problem that generalizes the hop and diameter constrained Steiner tree problem as follows: Given an edge-weighted undirected graph with two disjoint subsets representing roots and terminals, find a minimum-weight subtree that spans all the roots and terminals so that the number of hops between each relevant node and an arbitrary root does not exceed a given hop limit H. The set of relevant nodes may be equal to the set of terminals, or to the union of terminals and root nodes. This article proposes integer linear programming models utilizing one layered graph for each root node. Different possibilities to relate solutions on each of the layered graphs as well as additional strengthening inequalities are then discussed. Furthermore, theoretical comparisons between these models and to previously proposed flow- and path-based formulations are given. To solve the problem to optimality, we implement branch-and-cut algorithms for the layered graph formulations. Our computational study shows their clear advantages over previously existing approaches.
We consider a network design problem that generalizes the hop and diameter constrained Steiner tree
"
"en" => "We consider a network design problem that generalizes the hop and diameter constrained Steiner tree problem as follows: Given an edge-weighted undirected graph with two disjoint subsets representing roots and terminals, find a minimum-weight subtree that spans all the roots and terminals so that the number of hops between each relevant node and an arbitrary root does not exceed a given hop limit H. The set of relevant nodes may be equal to the set of terminals, or to the union of terminals and root nodes. This article proposes integer linear programming models utilizing one layered graph for each root node. Different possibilities to relate solutions on each of the layered graphs as well as additional strengthening inequalities are then discussed. Furthermore, theoretical comparisons between these models and to previously proposed flow- and path-based formulations are given. To solve the problem to optimality, we implement branch-and-cut algorithms for the layered graph formulations. Our computational study shows their clear advantages over previously existing approaches.
We consider a network design problem that generalizes the hop and diameter constrained Steiner tree
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
54 => Essec\Faculty\Model\Contribution {#2416
#_index: "academ_contributions"
#_id: "10565"
#_source: array:18 [
"id" => "10565"
"slug" => "the-bi-objective-prize-collecting-steiner-tree-problem"
"yearMonth" => "2014-12"
"year" => "2014"
"title" => "The bi-objective prize-collecting Steiner tree problem"
"description" => "LEITNER, M., LJUBIC, I. et SINNL, M. (2014). The bi-objective prize-collecting Steiner tree problem. <i>INFORMS Journal on Computing</i>, 27(1), pp. 118-134.
LEITNER, M., LJUBIC, I. et SINNL, M. (2014). The bi-objective prize-collecting Steiner tree problem.
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER Markus"
]
2 => array:1 [
"name" => "SINNL Markus"
]
]
"ouvrage" => ""
"keywords" => array:3 [
0 => "bi-objective combinatorial optimization"
1 => "Steiner tree problemϵ"
2 => "constraint method"
]
"updatedAt" => "2021-07-13 14:31:38"
"publicationUrl" => "https://doi.org/10.1016/j.endm.2013.05.091"
"publicationInfo" => array:3 [
"pages" => "118-134"
"volume" => "27"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In this paper, we study the bi-objective prize-collecting Steiner tree problem, whose goal is to find a subtree that minimizes the edge costs for building that tree, and, at the same time, to maximize the collected node revenues. We propose to solve the problem using an ϵ-constraint algorithm. This is an iterative mixed-integer-programming framework that identifies one solution for every point on the Pareto front. In this framework, a branch-and-cut approach for the single-objective variant of the problem is enhanced with warm-start procedures that are used to (i) generate feasible solutions, (ii) generate violated cutting planes, and (iii) guide the branching process. Standard benchmark instances from the literature are used to assess the efficacy of our method.
In this paper, we study the bi-objective prize-collecting Steiner tree problem, whose goal is to fin
"
"en" => "In this paper, we study the bi-objective prize-collecting Steiner tree problem, whose goal is to find a subtree that minimizes the edge costs for building that tree, and, at the same time, to maximize the collected node revenues. We propose to solve the problem using an ϵ-constraint algorithm. This is an iterative mixed-integer-programming framework that identifies one solution for every point on the Pareto front. In this framework, a branch-and-cut approach for the single-objective variant of the problem is enhanced with warm-start procedures that are used to (i) generate feasible solutions, (ii) generate violated cutting planes, and (iii) guide the branching process. Standard benchmark instances from the literature are used to assess the efficacy of our method.
In this paper, we study the bi-objective prize-collecting Steiner tree problem, whose goal is to fin
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
55 => Essec\Faculty\Model\Contribution {#2417
#_index: "academ_contributions"
#_id: "10568"
#_source: array:18 [
"id" => "10568"
"slug" => "the-recoverable-robust-two-level-network-design-problem"
"yearMonth" => "2014-09"
"year" => "2014"
"title" => "The Recoverable Robust Two-Level Network Design Problem"
"description" => "ÁLVAREZ-MIRANDA, E., LJUBIC, I. et RAGHAVAN, S. (2014). The Recoverable Robust Two-Level Network Design Problem. <i>INFORMS Journal on Computing</i>, 27(1), pp. 1-19.
ÁLVAREZ-MIRANDA, E., LJUBIC, I. et RAGHAVAN, S. (2014). The Recoverable Robust Two-Level Network Des
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ÁLVAREZ-MIRANDA Eduardo"
]
2 => array:1 [
"name" => "RAGHAVAN S."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:38"
"publicationUrl" => "https://doi.org/10.1287/ijoc.2014.0606"
"publicationInfo" => array:3 [
"pages" => "1-19"
"volume" => "27"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We consider a network design application that is modeled as the two-level network design problem under uncertainty. In this problem, one of the two available technologies can be installed on each edge and all customers of the network need to be served by at least the lower level (secondary) technology. The decision maker is confronted with uncertainty regarding the set of primary customers, i.e., the set of nodes that need to be served by the higher level (primary) technology. A set of discrete scenarios associated with the possible realizations of primary customers is available. The network is built in two stages. In the first stage the network topology must be determined. One may decide to install the primary technology on some of the edges in the first stage, or one can wait to see which scenario will be realized, in which case, edges with the installed secondary technology may be upgraded, if necessary to primary technology, but at higher recovery cost. The overall goal then is to build a “recoverable robust” spanning tree in the first stage that serves all customers by at least the lower level technology, and that minimizes the first-stage installation cost plus the worst-case cost needed to upgrade the edges of the selected tree, so that the primary customers of each scenario can be served using the primary technology. We discuss the complexity of the problem, provide mixed-integer programming models, and develop a branch-and-cut algorithm to solve it. Our extensive computational experiments demonstrate the efficacy of our approach.
We consider a network design application that is modeled as the two-level network design problem und
"
"en" => "We consider a network design application that is modeled as the two-level network design problem under uncertainty. In this problem, one of the two available technologies can be installed on each edge and all customers of the network need to be served by at least the lower level (secondary) technology. The decision maker is confronted with uncertainty regarding the set of primary customers, i.e., the set of nodes that need to be served by the higher level (primary) technology. A set of discrete scenarios associated with the possible realizations of primary customers is available. The network is built in two stages. In the first stage the network topology must be determined. One may decide to install the primary technology on some of the edges in the first stage, or one can wait to see which scenario will be realized, in which case, edges with the installed secondary technology may be upgraded, if necessary to primary technology, but at higher recovery cost. The overall goal then is to build a “recoverable robust” spanning tree in the first stage that serves all customers by at least the lower level technology, and that minimizes the first-stage installation cost plus the worst-case cost needed to upgrade the edges of the selected tree, so that the primary customers of each scenario can be served using the primary technology. We discuss the complexity of the problem, provide mixed-integer programming models, and develop a branch-and-cut algorithm to solve it. Our extensive computational experiments demonstrate the efficacy of our approach.
We consider a network design application that is modeled as the two-level network design problem und
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
56 => Essec\Faculty\Model\Contribution {#2418
#_index: "academ_contributions"
#_id: "10615"
#_source: array:18 [
"id" => "10615"
"slug" => "the-generalized-regenerator-location-problem"
"yearMonth" => "2015-03"
"year" => "2015"
"title" => "The Generalized Regenerator Location Problem"
"description" => "CHEN, S., LJUBIC, I. et RAGHAVAN, S. (2015). The Generalized Regenerator Location Problem. <i>INFORMS Journal on Computing</i>, 27(2), pp. 204-220.
CHEN, S., LJUBIC, I. et RAGHAVAN, S. (2015). The Generalized Regenerator Location Problem. <i>INFORM
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "CHEN Si"
]
2 => array:1 [
"name" => "RAGHAVAN S."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:39"
"publicationUrl" => "https://doi.org/10.1287/ijoc.2014.0621"
"publicationInfo" => array:3 [
"pages" => "204-220"
"volume" => "27"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In an optical network a signal can only travel a maximum distance dmax before its quality deteriorates to the point that it must be regenerated by installing regenerators at nodes of the network. As the cost of a regenerator is high, we wish to deploy as few regenerators as possible in the network, while ensuring all nodes can communicate with each other. In this paper we introduce the generalized regenerator location problem (GRLP) in which we are given a set S of nodes that corresponds to candidate locations for regenerators, and a set T of nodes that must communicate with each other. If S = T = N, we obtain the regenerator location problem (RLP), which we have studied previously and shown to be NP-complete. Our solution procedure to the RLP is based on its equivalence to the maximum leaf spanning tree problem (MLSTP). Unfortunately, this equivalence does not apply to the GRLP, nor do the procedures developed previously for the RLP. To solve the GRLP, we propose reduction procedures, two construction heuristics, and a local search procedure that we collectively refer to as a heuristic framework. We also establish a correspondence between the (node-weighted) directed Steiner forest problem and the GRLP. Using this fact, we provide several ways to derive natural and extended integer programming (IP) and mixed-integer programming (MIP) models for the GRLP and compare the strength of these models. Using the strongest model derived on the natural node selection variables we develop a branch-and-cut approach to solve the problem to optimality. The results indicate that the exact approach can easily solve instances with up to 200 nodes to optimality, whereas the heuristic framework is a high-quality approach for solving large-scale instances.
In an optical network a signal can only travel a maximum distance dmax before its quality deteriorat
"
"en" => "In an optical network a signal can only travel a maximum distance dmax before its quality deteriorates to the point that it must be regenerated by installing regenerators at nodes of the network. As the cost of a regenerator is high, we wish to deploy as few regenerators as possible in the network, while ensuring all nodes can communicate with each other. In this paper we introduce the generalized regenerator location problem (GRLP) in which we are given a set S of nodes that corresponds to candidate locations for regenerators, and a set T of nodes that must communicate with each other. If S = T = N, we obtain the regenerator location problem (RLP), which we have studied previously and shown to be NP-complete. Our solution procedure to the RLP is based on its equivalence to the maximum leaf spanning tree problem (MLSTP). Unfortunately, this equivalence does not apply to the GRLP, nor do the procedures developed previously for the RLP. To solve the GRLP, we propose reduction procedures, two construction heuristics, and a local search procedure that we collectively refer to as a heuristic framework. We also establish a correspondence between the (node-weighted) directed Steiner forest problem and the GRLP. Using this fact, we provide several ways to derive natural and extended integer programming (IP) and mixed-integer programming (MIP) models for the GRLP and compare the strength of these models. Using the strongest model derived on the natural node selection variables we develop a branch-and-cut approach to solve the problem to optimality. The results indicate that the exact approach can easily solve instances with up to 200 nodes to optimality, whereas the heuristic framework is a high-quality approach for solving large-scale instances.
In an optical network a signal can only travel a maximum distance dmax before its quality deteriorat
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
57 => Essec\Faculty\Model\Contribution {#2419
#_index: "academ_contributions"
#_id: "10619"
#_source: array:18 [
"id" => "10619"
"slug" => "the-two-level-diameter-constrained-spanning-tree-problem"
"yearMonth" => "2015-04"
"year" => "2015"
"title" => "The Two-Level Diameter Constrained Spanning Tree Problem"
"description" => "GOUVEIA, L., LEITNER, M. et LJUBIC, I. (2015). The Two-Level Diameter Constrained Spanning Tree Problem. <i>Mathematical Programming</i>, 150(1), pp. 49-78.
GOUVEIA, L., LEITNER, M. et LJUBIC, I. (2015). The Two-Level Diameter Constrained Spanning Tree Prob
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GOUVEIA Luis"
]
2 => array:1 [
"name" => "LEITNER Markus"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:39"
"publicationUrl" => "https://www.semanticscholar.org/paper/The-two-level-diameter-constrained-spanning-tree-Gouveia-Leitner/f5d267d43a2b0d4dce0226713ccbd3e3b2b5fb22
https://www.semanticscholar.org/paper/The-two-level-diameter-constrained-spanning-tree-Gouveia-Leitn
"
"publicationInfo" => array:3 [
"pages" => "49-78"
"volume" => "150"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In this article, we introduce the two-level diameter constrained spanning tree problem (2-DMSTP), which generalizes the classical DMSTP by considering two sets of nodes with different latency requirements. We first observe that any feasible solution to the 2-DMSTP can be viewed as a DMST that contains a diameter constrained Steiner tree. This observation allows us to prove graph theoretical properties related to the centers of each tree which are then exploited to develop mixed integer programming formulations, valid inequalities, and symmetry breaking constraints. In particular, we propose a novel modeling approach based on a three-dimensional layered graph. In an extensive computational study we show that a branch-and-cut algorithm based on the latter model is highly effective in practice.
In this article, we introduce the two-level diameter constrained spanning tree problem (2-DMSTP), wh
"
"en" => "In this article, we introduce the two-level diameter constrained spanning tree problem (2-DMSTP), which generalizes the classical DMSTP by considering two sets of nodes with different latency requirements. We first observe that any feasible solution to the 2-DMSTP can be viewed as a DMST that contains a diameter constrained Steiner tree. This observation allows us to prove graph theoretical properties related to the centers of each tree which are then exploited to develop mixed integer programming formulations, valid inequalities, and symmetry breaking constraints. In particular, we propose a novel modeling approach based on a three-dimensional layered graph. In an extensive computational study we show that a branch-and-cut algorithm based on the latter model is highly effective in practice.
In this article, we introduce the two-level diameter constrained spanning tree problem (2-DMSTP), wh
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
58 => Essec\Faculty\Model\Contribution {#2420
#_index: "academ_contributions"
#_id: "10636"
#_source: array:18 [
"id" => "10636"
"slug" => "intersection-cuts-for-bilevel-optimization"
"yearMonth" => "2016-05"
"year" => "2016"
"title" => "Intersection Cuts for Bilevel Optimization"
"description" => "FISCHETTI, M., LJUBIC, I., MONACI, M. et SINNL, M. (2016). Intersection Cuts for Bilevel Optimization. Dans: <i>Integer Programming and Combinatorial Optimization</i>. 1st ed. Berlin: Springer Computer Science, pp. 77-88.
FISCHETTI, M., LJUBIC, I., MONACI, M. et SINNL, M. (2016). Intersection Cuts for Bilevel Optimizatio
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FISCHETTI Matteo"
]
2 => array:1 [
"name" => "MONACI Michele"
]
3 => array:1 [
"name" => "SINNL Markus"
]
]
"ouvrage" => "Integer Programming and Combinatorial Optimization"
"keywords" => array:3 [
0 => "Mixed Integer Programming"
1 => "Bilevel Optimization"
2 => "Stackelberg Games"
]
"updatedAt" => "2023-01-27 15:07:22"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "77-88"
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
The exact solution of bilevel optimization problems is a very challenging task that received more and more attention in recent years, as witnessed by the flourishing recent literature on this topic. In this paper we present ideas and algorithms to solve to proven optimality generic Mixed-Integer Bilevel Linear Programs (MIBLP’s) where all constraints are linear, and some/all variables are required to take integer values.\n
The exact solution of bilevel optimization problems is a very challenging task that received more an
In doing so, we look for a general-purpose approach applicable to any MIBLP (under mild conditions), rather than ad-hoc methods for specific cases. Our approach concentrates on minimal additions required to convert an effective branch-and-cut MILP exact code into a valid MIBLP solver, thus inheriting the wide arsenal of MILP tools (cuts, branching rules, heuristics) available in modern solvers.
In doing so, we look for a general-purpose approach applicable to any MIBLP (under mild conditions)
"""
"en" => """
The exact solution of bilevel optimization problems is a very challenging task that received more and more attention in recent years, as witnessed by the flourishing recent literature on this topic. In this paper we present ideas and algorithms to solve to proven optimality generic Mixed-Integer Bilevel Linear Programs (MIBLP’s) where all constraints are linear, and some/all variables are required to take integer values.\n
The exact solution of bilevel optimization problems is a very challenging task that received more an
In doing so, we look for a general-purpose approach applicable to any MIBLP (under mild conditions), rather than ad-hoc methods for specific cases. Our approach concentrates on minimal additions required to convert an effective branch-and-cut MILP exact code into a valid MIBLP solver, thus inheriting the wide arsenal of MILP tools (cuts, branching rules, heuristics) available in modern solvers.
In doing so, we look for a general-purpose approach applicable to any MIBLP (under mild conditions)
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
59 => Essec\Faculty\Model\Contribution {#2421
#_index: "academ_contributions"
#_id: "10847"
#_source: array:18 [
"id" => "10847"
"slug" => "two-branch-and-cut-algorithms-for-the-directed-network-design-problem-with-relays"
"yearMonth" => "2020-04"
"year" => "2020"
"title" => "Two Branch-and-cut Algorithms for the Directed Network Design Problem with Relays"
"description" => "LEITNER, M., LJUBIC, I., RIEDLER, M. et RUTHMAIR, M. (2020). Two Branch-and-cut Algorithms for the Directed Network Design Problem with Relays. Dans: 15th INFORMS Telecommunications and Network Analytics Conference.
LEITNER, M., LJUBIC, I., RIEDLER, M. et RUTHMAIR, M. (2020). Two Branch-and-cut Algorithms for the D
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER Markus"
]
2 => array:1 [
"name" => "RIEDLER Martin"
]
3 => array:1 [
"name" => "RUTHMAIR Mario"
]
]
"ouvrage" => "15th INFORMS Telecommunications and Network Analytics Conference"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
60 => Essec\Faculty\Model\Contribution {#2422
#_index: "academ_contributions"
#_id: "10916"
#_source: array:18 [
"id" => "10916"
"slug" => "casting-light-on-the-hidden-bilevel-combinatorial-structure-of-the-capacitated-vertex-separator-problem
casting-light-on-the-hidden-bilevel-combinatorial-structure-of-the-capacitated-vertex-separator-prob
"
"yearMonth" => "2020-05"
"year" => "2020"
"title" => "Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Prob
"
"description" => "LJUBIC, I., FURINI, F., MALAGUTI, E. et PARONUZZI, P. (2020). Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem. Dans: Mixed Integer Programming Workshop 2020 Online Edition.
LJUBIC, I., FURINI, F., MALAGUTI, E. et PARONUZZI, P. (2020). Casting Light on the Hidden Bilevel Co
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI Fabio"
]
2 => array:1 [
"name" => "MALAGUTI Enrico"
]
3 => array:1 [
"name" => "PARONUZZI Paolo"
]
]
"ouvrage" => "Mixed Integer Programming Workshop 2020 Online Edition"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
61 => Essec\Faculty\Model\Contribution {#2423
#_index: "academ_contributions"
#_id: "10918"
#_source: array:18 [
"id" => "10918"
"slug" => "the-maximum-clique-interdiction-problem"
"yearMonth" => "2019-02"
"year" => "2019"
"title" => "The Maximum Clique Interdiction Problem"
"description" => "FURINI, F., LJUBIC, I., MARTIN, S. et SAN SEGUNDO, P. (2019). The Maximum Clique Interdiction Problem. <i>European Journal of Operational Research</i>, 277(1), pp. 112-127.
FURINI, F., LJUBIC, I., MARTIN, S. et SAN SEGUNDO, P. (2019). The Maximum Clique Interdiction Proble
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI Fabio"
]
2 => array:1 [
"name" => "MARTIN Sébastien"
]
3 => array:1 [
"name" => "SAN SEGUNDO Pablo"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Combinatorial optimization"
1 => "Interdiction problems"
2 => "Maximum clique"
3 => "(Social) Network analysis"
4 => "Most vital vertices"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2019.02.028"
"publicationInfo" => array:3 [
"pages" => "112-127"
"volume" => "277"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Given a graph G and an interdiction budget k, the Maximum Clique Interdiction Problem asks to find a subset of at most k vertices to remove from G so that the size of the maximum clique in the remaining graph is minimized. This problem has applications in many areas, such as crime detection, prevention of outbreaks of infectious diseases and surveillance of communication networks. We propose an integer linear programming formulation of the problem based on an exponential family of Clique-Interdiction Cuts and we give necessary and sufficient conditions under which these cuts are facet-defining. Our new approach provides a useful tool for analyzing the resilience of (social) networks with respect to clique-interdiction attacks, i.e., the decrease of the size of the maximum clique as a function of an incremental interdiction budget level. On a benchmark set of publicly available instances, including large-scale social networks with up to one hundred thousand vertices and three million edges, we show that most of them can be analyzed and solved to proven optimality within short computing time.
Given a graph G and an interdiction budget k, the Maximum Clique Interdiction Problem asks to find a
"
"en" => "Given a graph G and an interdiction budget k, the Maximum Clique Interdiction Problem asks to find a subset of at most k vertices to remove from G so that the size of the maximum clique in the remaining graph is minimized. This problem has applications in many areas, such as crime detection, prevention of outbreaks of infectious diseases and surveillance of communication networks. We propose an integer linear programming formulation of the problem based on an exponential family of Clique-Interdiction Cuts and we give necessary and sufficient conditions under which these cuts are facet-defining. Our new approach provides a useful tool for analyzing the resilience of (social) networks with respect to clique-interdiction attacks, i.e., the decrease of the size of the maximum clique as a function of an incremental interdiction budget level. On a benchmark set of publicly available instances, including large-scale social networks with up to one hundred thousand vertices and three million edges, we show that most of them can be analyzed and solved to proven optimality within short computing time.
Given a graph G and an interdiction budget k, the Maximum Clique Interdiction Problem asks to find a
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
62 => Essec\Faculty\Model\Contribution {#2424
#_index: "academ_contributions"
#_id: "10920"
#_source: array:18 [
"id" => "10920"
"slug" => "interdiction-games-and-monotonicity-with-application-to-knapsack-problems"
"yearMonth" => "2019-04"
"year" => "2019"
"title" => "Interdiction Games and Monotonicity, with Application to Knapsack Problems"
"description" => "FISCHETTI, M., LJUBIC, I., MONACI, M. et SINNI, M. (2019). Interdiction Games and Monotonicity, with Application to Knapsack Problems. <i>INFORMS Journal on Computing</i>, 31(2), pp. 390-410.
FISCHETTI, M., LJUBIC, I., MONACI, M. et SINNI, M. (2019). Interdiction Games and Monotonicity, with
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FISCHETTI Matteo"
]
2 => array:1 [
"name" => "MONACI Mchele"
]
3 => array:1 [
"name" => "SINNI Markus"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://www.researchgate.net/publication/332688686_Interdiction_Games_and_Monotonicity_with_Application_to_Knapsack_Problems
https://www.researchgate.net/publication/332688686_Interdiction_Games_and_Monotonicity_with_Applicat
"
"publicationInfo" => array:3 [
"pages" => "390-410"
"volume" => "31"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Two-person interdiction games represent an important modeling concept for applications in marketing, defending critical infrastructure, stopping nuclear weapons projects, or preventing drug smuggling. We present an exact branch-and-cut algorithm for interdiction games under the assumption that feasible solutions of the follower problem satisfy a certain monotonicity property. Prominent examples from the literature that fall into this category are knapsack interdiction, matching interdiction, and packing interdiction problems. We also show how practically relevant interdiction variants of facility location and prize-collecting problems can be modeled in our setting. Our branch-and-cut algorithm uses a solution scheme akin to Benders decomposition based on a family of so-called interdiction cuts. We present modified and lifted versions of these cuts along with exact and heuristic procedures for the separation of interdiction cuts and heuristic separation procedures for the other versions. In addition, we derive further valid inequalities and present a new heuristic procedure. We computationally evaluate the proposed algorithm on a benchmark of 360 knapsack interdiction instances from literature, including 27 instances for which the optimal solution was not known. Our approach is able to solve each of them to optimality within about one minute of computing time on a standard PC (in most cases, within just seconds), and it is up to some orders of magnitude faster than any previous approach from the literature. To further assess the effectiveness of our branch-and-cut algorithm, an additional computational study is performed on 144 randomly generated instances based on 0/1 multidimensional knapsack problems.
Two-person interdiction games represent an important modeling concept for applications in marketing,
"
"en" => "Two-person interdiction games represent an important modeling concept for applications in marketing, defending critical infrastructure, stopping nuclear weapons projects, or preventing drug smuggling. We present an exact branch-and-cut algorithm for interdiction games under the assumption that feasible solutions of the follower problem satisfy a certain monotonicity property. Prominent examples from the literature that fall into this category are knapsack interdiction, matching interdiction, and packing interdiction problems. We also show how practically relevant interdiction variants of facility location and prize-collecting problems can be modeled in our setting. Our branch-and-cut algorithm uses a solution scheme akin to Benders decomposition based on a family of so-called interdiction cuts. We present modified and lifted versions of these cuts along with exact and heuristic procedures for the separation of interdiction cuts and heuristic separation procedures for the other versions. In addition, we derive further valid inequalities and present a new heuristic procedure. We computationally evaluate the proposed algorithm on a benchmark of 360 knapsack interdiction instances from literature, including 27 instances for which the optimal solution was not known. Our approach is able to solve each of them to optimality within about one minute of computing time on a standard PC (in most cases, within just seconds), and it is up to some orders of magnitude faster than any previous approach from the literature. To further assess the effectiveness of our branch-and-cut algorithm, an additional computational study is performed on 144 randomly generated instances based on 0/1 multidimensional knapsack problems.
Two-person interdiction games represent an important modeling concept for applications in marketing,
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
63 => Essec\Faculty\Model\Contribution {#2425
#_index: "academ_contributions"
#_id: "10921"
#_source: array:18 [
"id" => "10921"
"slug" => "the-incremental-connected-facility-location-problem"
"yearMonth" => "2019-12"
"year" => "2019"
"title" => "The Incremental Connected Facility Location Problem"
"description" => "ARULSELVAN, A., BLEY, A. et LJUBIC, I. (2019). The Incremental Connected Facility Location Problem. <i>Computers & Operations Research</i>, 112.
ARULSELVAN, A., BLEY, A. et LJUBIC, I. (2019). The Incremental Connected Facility Location Problem.
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ARULSELVAN Ashwin"
]
2 => array:1 [
"name" => "BLEY Andreas"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Mixed integer programming"
1 => "Facility location"
2 => "Branch-and-cut"
3 => "Multi-period network design"
4 => "Incremental network design"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2019.104763"
"publicationInfo" => array:3 [
"pages" => null
"volume" => "112"
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
We consider the incremental connected facility location problem (incremental ConFL), in which we are given a set of potential facilities, a set of interconnection nodes, a set of customers with demands, and a planning horizon. For each time period, we have to select a set of facilities to open, a set of customers to be served, the assignment of these customers to the open facilities, and a network that connects the open facilities. Once a customer is served, it must remain served in subsequent periods. Furthermore, in each time period the total demand of all customers served must be at least equal to a given minimum coverage requirement for that period. The objective is to minimize the total cost for building the network given by the investment and maintenance costs for the facilities and the network summed up over all time periods.\n
We consider the incremental connected facility location problem (incremental ConFL), in which we are
\n
We propose a mixed integer programming approach in which, in each time period, a single period ConFL with coverage restrictions has to be solved. For this latter problem, which is of particular interest in itself, new families of valid inequalities are proposed: these are set union knapsack cover (SUKC) inequalities, which are further enhanced by lifting and/or combined with cut-set inequalities, which are primarily used to ensure connectivity requirements. Details of an efficient branch-and-cut implementation are presented and computational results on a benchmark set of large instances are given, including examples of telecommunication networks in Germany.
We propose a mixed integer programming approach in which, in each time period, a single period ConFL
"""
"en" => """
We consider the incremental connected facility location problem (incremental ConFL), in which we are given a set of potential facilities, a set of interconnection nodes, a set of customers with demands, and a planning horizon. For each time period, we have to select a set of facilities to open, a set of customers to be served, the assignment of these customers to the open facilities, and a network that connects the open facilities. Once a customer is served, it must remain served in subsequent periods. Furthermore, in each time period the total demand of all customers served must be at least equal to a given minimum coverage requirement for that period. The objective is to minimize the total cost for building the network given by the investment and maintenance costs for the facilities and the network summed up over all time periods.\n
We consider the incremental connected facility location problem (incremental ConFL), in which we are
\n
We propose a mixed integer programming approach in which, in each time period, a single period ConFL with coverage restrictions has to be solved. For this latter problem, which is of particular interest in itself, new families of valid inequalities are proposed: these are set union knapsack cover (SUKC) inequalities, which are further enhanced by lifting and/or combined with cut-set inequalities, which are primarily used to ensure connectivity requirements. Details of an efficient branch-and-cut implementation are presented and computational results on a benchmark set of large instances are given, including examples of telecommunication networks in Germany.
We propose a mixed integer programming approach in which, in each time period, a single period ConFL
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
64 => Essec\Faculty\Model\Contribution {#2426
#_index: "academ_contributions"
#_id: "11973"
#_source: array:18 [
"id" => "11973"
"slug" => "ilp-and-cp-formulations-for-the-lazy-bureaucrat-problem"
"yearMonth" => "2015-01"
"year" => "2015"
"title" => "ILP and CP Formulations for the Lazy Bureaucrat Problem"
"description" => "FURINI, F., LJUBIC, I. et SINNL, M. (2015). ILP and CP Formulations for the Lazy Bureaucrat Problem. Dans: Laurent Michel (ed.). <i>Integration of AI and OR Techniques in Constraint Programming (CPAIOR 2015)</i>. 1st ed. Cham, New York: Springer, pp. 255-270.
FURINI, F., LJUBIC, I. et SINNL, M. (2015). ILP and CP Formulations for the Lazy Bureaucrat Problem.
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI Fabio"
]
2 => array:1 [
"name" => "SINNL Markus"
]
]
"ouvrage" => "Integration of AI and OR Techniques in Constraint Programming (CPAIOR 2015)"
"keywords" => array:3 [
0 => "computational study"
1 => "combinatorial optimization problems"
2 => "dynamic programming algorithm"
]
"updatedAt" => "2024-04-18 11:33:36"
"publicationUrl" => "https://link.springer.com/chapter/10.1007/978-3-319-18008-3_18"
"publicationInfo" => array:3 [
"pages" => "255-270"
"volume" => "LNTCS, volume 9075"
"number" => "18"
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
Lazy reformulations of classical combinatorial optimization problems are new and challenging classes of problems. In this paper we focus on the Lazy Bureaucrat Problem (LBP) which is the lazy counterpart of the knapsack problem. Given a set of tasks with a common arrival time and deadline, the goal of a lazy bureaucrat is to schedule a least profitable subset of tasks, while having an excuse that no other tasks can be scheduled without exceeding the deadline.\n
Lazy reformulations of classical combinatorial optimization problems are new and challenging classes
\n
Three ILP formulations and their CP counterparts are studied and implemented. In addition, a dynamic programming algorithm that runs is pseudo-polynomial time and polynomial greedy heuristics are implemented and computationally compared with ILP/CP approaches. For the computational study, a large set of knapsack-type instances with various characteristics is used to examine the applicability and strength of the proposed approaches.
Three ILP formulations and their CP counterparts are studied and implemented. In addition, a dynamic
"""
"en" => """
Lazy reformulations of classical combinatorial optimization problems are new and challenging classes of problems. In this paper we focus on the Lazy Bureaucrat Problem (LBP) which is the lazy counterpart of the knapsack problem. Given a set of tasks with a common arrival time and deadline, the goal of a lazy bureaucrat is to schedule a least profitable subset of tasks, while having an excuse that no other tasks can be scheduled without exceeding the deadline.\n
Lazy reformulations of classical combinatorial optimization problems are new and challenging classes
\n
Three ILP formulations and their CP counterparts are studied and implemented. In addition, a dynamic programming algorithm that runs is pseudo-polynomial time and polynomial greedy heuristics are implemented and computationally compared with ILP/CP approaches. For the computational study, a large set of knapsack-type instances with various characteristics is used to examine the applicability and strength of the proposed approaches.
Three ILP formulations and their CP counterparts are studied and implemented. In addition, a dynamic
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
65 => Essec\Faculty\Model\Contribution {#2427
#_index: "academ_contributions"
#_id: "11977"
#_source: array:18 [
"id" => "11977"
"slug" => "on-the-two-architecture-connected-facility-location-problem"
"yearMonth" => "2013-01"
"year" => "2013"
"title" => "On the two-architecture connected facility location problem"
"description" => "LEITNER, M., LJUBIC, I., SINNL, M. et WERNER, A. (2013). On the two-architecture connected facility location problem. Dans: <i>Proceedings of INOC 2013</i>. Electronic Notes in Discrete Mathematics (ENDM), pp. 359-366.
LEITNER, M., LJUBIC, I., SINNL, M. et WERNER, A. (2013). On the two-architecture connected facility
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER M."
]
2 => array:1 [
"name" => "SINNL M."
]
3 => array:1 [
"name" => "WERNER A."
]
]
"ouvrage" => "Proceedings of INOC 2013"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:57"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "359-366"
"volume" => "41"
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
66 => Essec\Faculty\Model\Contribution {#2428
#_index: "academ_contributions"
#_id: "11978"
#_source: array:18 [
"id" => "11978"
"slug" => "solving-the-bi-objective-prize-collecting-steiner-tree-problem-with-the-e-constraint-method"
"yearMonth" => "2013-01"
"year" => "2013"
"title" => "Solving the bi-objective prize-collecting Steiner tree problem with the e-constraint method"
"description" => "LEITNER, M., LJUBIC, I. et SINNL, M. (2013). Solving the bi-objective prize-collecting Steiner tree problem with the e-constraint method. Dans: <i>Proceedings of INOC 2013</i>. Electronic Notes in Discrete Mathematics (ENDM), pp. 181-188.
LEITNER, M., LJUBIC, I. et SINNL, M. (2013). Solving the bi-objective prize-collecting Steiner tree
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER M."
]
2 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => "Proceedings of INOC 2013"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:57"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "181-188"
"volume" => "41"
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
67 => Essec\Faculty\Model\Contribution {#2429
#_index: "academ_contributions"
#_id: "11979"
#_source: array:18 [
"id" => "11979"
"slug" => "on-the-hop-constrained-steiner-tree-problem-with-multiple-root-nodes"
"yearMonth" => "2012-01"
"year" => "2012"
"title" => "On the hop constrained Steiner tree problem with multiple root nodes"
"description" => "GOUVEIA, L., LEITNER, M. et LJUBIC, I. (2012). On the hop constrained Steiner tree problem with multiple root nodes. Dans: <i>Proceedings of the 2nd International Symposium on Combinatorial Optimization</i>. Springer, pp. 201-212.
GOUVEIA, L., LEITNER, M. et LJUBIC, I. (2012). On the hop constrained Steiner tree problem with mult
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GOUVEIA Luis"
]
2 => array:1 [
"name" => "LEITNER M."
]
]
"ouvrage" => "Proceedings of the 2nd International Symposium on Combinatorial Optimization"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:57"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "201-212"
"volume" => "7422 of LNCS"
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
68 => Essec\Faculty\Model\Contribution {#2430
#_index: "academ_contributions"
#_id: "11980"
#_source: array:18 [
"id" => "11980"
"slug" => "variable-neighborhood-search-for-solving-the-balanced-location-problem"
"yearMonth" => "2012-01"
"year" => "2012"
"title" => "Variable neighborhood search for solving the balanced location problem"
"description" => "GOLLOWITZER, S., GOUVEIA, L. et LJUBIC, I. (2012). Variable neighborhood search for solving the balanced location problem. Dans: <i>Proceedings of EUROmC XXVIII VNS</i>. Electronic Notes in Discrete Mathematics (ENDM), pp. 21-28.
GOLLOWITZER, S., GOUVEIA, L. et LJUBIC, I. (2012). Variable neighborhood search for solving the bala
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GOLLOWITZER S."
]
2 => array:1 [
"name" => "GOUVEIA Luis"
]
]
"ouvrage" => "Proceedings of EUROmC XXVIII VNS"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:57"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "21-28"
"volume" => "39"
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
69 => Essec\Faculty\Model\Contribution {#2431
#_index: "academ_contributions"
#_id: "11981"
#_source: array:18 [
"id" => "11981"
"slug" => "exact-solutions-for-the-robust-prize-collecting-steiner-tree-problem"
"yearMonth" => "2011-01"
"year" => "2011"
"title" => "Exact solutions for the robust prize-collecting Steiner tree problem"
"description" => "ÁLVAREZ-MIRANDA, E., LJUBIC, I. et TOTH, P. (2011). Exact solutions for the robust prize-collecting Steiner tree problem. Dans: <i>ICUMT 2011, Budapest, Hungary, Proceedings</i>. Institute of Electrical and Electronics Engineers (IEEE), pp. 1-7.
ÁLVAREZ-MIRANDA, E., LJUBIC, I. et TOTH, P. (2011). Exact solutions for the robust prize-collecting
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ÁLVAREZ-MIRANDA E."
]
2 => array:1 [
"name" => "TOTH Peter"
]
]
"ouvrage" => "ICUMT 2011, Budapest, Hungary, Proceedings"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:57"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "1-7"
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
70 => Essec\Faculty\Model\Contribution {#2432
#_index: "academ_contributions"
#_id: "11983"
#_source: array:18 [
"id" => "11983"
"slug" => "a-heuristic-algorithm-for-a-prize-collecting-local-access-network-design-problem"
"yearMonth" => "2011-01"
"year" => "2011"
"title" => "A heuristic algorithm for a prize-collecting local access network design problem"
"description" => "LJUBIC, I., PUTZ, P. et SALAZAR-GONZALEZ, J.J. (2011). A heuristic algorithm for a prize-collecting local access network design problem. Dans: <i>Proceedings of INOC 2011</i>. Springer, pp. 139-144.
LJUBIC, I., PUTZ, P. et SALAZAR-GONZALEZ, J.J. (2011). A heuristic algorithm for a prize-collecting
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "PUTZ Peter"
]
2 => array:1 [
"name" => "SALAZAR-GONZALEZ J.-J."
]
]
"ouvrage" => "Proceedings of INOC 2011"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:57"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "139-144"
"volume" => "6701 of LNCS"
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
71 => Essec\Faculty\Model\Contribution {#2433
#_index: "academ_contributions"
#_id: "11984"
#_source: array:18 [
"id" => "11984"
"slug" => "a-node-splitting-technique-for-two-level-network-design-problems-with-transition-nodes"
"yearMonth" => "2011-01"
"year" => "2011"
"title" => "A node splitting technique for two level network design problems with transition nodes"
"description" => "GOLLOWITZER, S., LJUBIC, I. et GOUVEIA, L. (2011). A node splitting technique for two level network design problems with transition nodes. Dans: <i>Proceedings of INOC 2011</i>. Springer, pp. 57-70.
GOLLOWITZER, S., LJUBIC, I. et GOUVEIA, L. (2011). A node splitting technique for two level network
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GOLLOWITZER S."
]
2 => array:1 [
"name" => "GOUVEIA Luis"
]
]
"ouvrage" => "Proceedings of INOC 2011"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:57"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "57-70"
"volume" => "6701 of LNCS"
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
72 => Essec\Faculty\Model\Contribution {#2434
#_index: "academ_contributions"
#_id: "11985"
#_source: array:18 [
"id" => "11985"
"slug" => "solving-two-stage-stochastic-steiner-tree-problems-by-two-stage-branch-and-cut"
"yearMonth" => "2010-01"
"year" => "2010"
"title" => "Solving two-stage stochastic Steiner tree problems by two-stage branch-and-cut"
"description" => "BOMZE, I.M., LJUBIC, I., CHIMANI, M., JÜNGER, M., MUTZEL, P. et ZEY, B. (2010). Solving two-stage stochastic Steiner tree problems by two-stage branch-and-cut. Dans: <i>Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010)</i>. Springer, pp. 427-439.
BOMZE, I.M., LJUBIC, I., CHIMANI, M., JÜNGER, M., MUTZEL, P. et ZEY, B. (2010). Solving two-stage st
"
"authors" => array:6 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "BOMZE Immanuel M."
]
2 => array:1 [
"name" => "CHIMANI Markus"
]
3 => array:1 [
"name" => "JÜNGER M"
]
4 => array:1 [
"name" => "MUTZEL P."
]
5 => array:1 [
"name" => "ZEY B."
]
]
"ouvrage" => "Proceedings of the 21st International Symposium on Algorithms and Computation (ISAAC 2010)"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:57"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "427-439"
"volume" => "6506 of LNCS"
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
73 => Essec\Faculty\Model\Contribution {#2435
#_index: "academ_contributions"
#_id: "11986"
#_source: array:18 [
"id" => "11986"
"slug" => "modelling-the-hop-constrained-connected-facility-location-problem-on-layered-graphs"
"yearMonth" => "2010-01"
"year" => "2010"
"title" => "Modelling the hop constrained connected facility location problem on layered graphs"
"description" => "LJUBIC, I. et GOLLOWITZER, S. (2010). Modelling the hop constrained connected facility location problem on layered graphs. Dans: <i>Proceedings of the International Symposium on Combinatorial Optimization (ISCO) 2010</i>. Electronic Notes in Discrete Mathematics (ENDM), pp. 207-214.
LJUBIC, I. et GOLLOWITZER, S. (2010). Modelling the hop constrained connected facility location prob
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GOLLOWITZER S."
]
]
"ouvrage" => "Proceedings of the International Symposium on Combinatorial Optimization (ISCO) 2010"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:57"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "207-214"
"volume" => "38"
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
74 => Essec\Faculty\Model\Contribution {#2436
#_index: "academ_contributions"
#_id: "11987"
#_source: array:18 [
"id" => "11987"
"slug" => "strong-formulations-for-2-node-connected-steiner-network-problems"
"yearMonth" => "2008-01"
"year" => "2008"
"title" => "Strong formulations for 2-node-connected Steiner network problems"
"description" => "CHIMANI, M., LJUBIC, I., KANDYBA, M. et MUTZEL, P. (2008). Strong formulations for 2-node-connected Steiner network problems. Dans: <i>Combinatorial Optimization and Applications, Second International Conference, COCOA</i>. Springer, pp. 190-200.
CHIMANI, M., LJUBIC, I., KANDYBA, M. et MUTZEL, P. (2008). Strong formulations for 2-node-connected
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "CHIMANI Markus"
]
2 => array:1 [
"name" => "KANDYBA Maria"
]
3 => array:1 [
"name" => "MUTZEL P."
]
]
"ouvrage" => "Combinatorial Optimization and Applications, Second International Conference, COCOA"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "190-200"
"volume" => "5165 of LNCS"
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
75 => Essec\Faculty\Model\Contribution {#2437
#_index: "academ_contributions"
#_id: "11988"
#_source: array:18 [
"id" => "11988"
"slug" => "a-grasp-algorithm-for-the-connected-facility-location-problem"
"yearMonth" => "2008-01"
"year" => "2008"
"title" => "A GRASP algorithm for the connected facility location problem"
"description" => "TOMAZIC, A. et LJUBIC, I. (2008). A GRASP algorithm for the connected facility location problem. Dans: <i>IEEE/IPSJ International Symposium on Applications and the Internet</i>. Institute of Electrical and Electronics Engineers (IEEE), pp. 257-260.
TOMAZIC, A. et LJUBIC, I. (2008). A GRASP algorithm for the connected facility location problem. Dan
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "TOMAZIC Alessandro"
]
]
"ouvrage" => "IEEE/IPSJ International Symposium on Applications and the Internet"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "257-260"
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
76 => Essec\Faculty\Model\Contribution {#2438
#_index: "academ_contributions"
#_id: "11990"
#_source: array:18 [
"id" => "11990"
"slug" => "a-hybrid-vns-for-connected-facility-location"
"yearMonth" => "2007-01"
"year" => "2007"
"title" => "A Hybrid VNS for Connected Facility Location"
"description" => "LJUBIC, I. (2007). A Hybrid VNS for Connected Facility Location. Dans: Thomas Bartz-Beielstein, María José Blesa Aguilera, Christian Blum, Boris Naujoks, Andrea Roli, Günter Rudolph, Michael Sampels eds. <i>Hybrid Metaheuristics</i>. 1 ed. Springer Berlin Heidelberg, pp. 157-169.
LJUBIC, I. (2007). A Hybrid VNS for Connected Facility Location. Dans: Thomas Bartz-Beielstein, Marí
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Hybrid Metaheuristics"
"keywords" => []
"updatedAt" => "2020-12-17 18:37:46"
"publicationUrl" => "https://link.springer.com/chapter/10.1007/978-3-540-75514-2_12"
"publicationInfo" => array:3 [
"pages" => "157-169"
"volume" => "4771 of LNCS"
"number" => null
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
77 => Essec\Faculty\Model\Contribution {#2439
#_index: "academ_contributions"
#_id: "11991"
#_source: array:18 [
"id" => "11991"
"slug" => "solving-the-prize-collecting-steiner-tree-problem-to-optimality"
"yearMonth" => "2005-01"
"year" => "2005"
"title" => "Solving the prize-collecting Steiner tree problem to optimality"
"description" => "LJUBIC, I., WEISKIRCHER, R., PFERSCHY, U., KLAU, G., MUTZEL, P. et FISCHETTI, M. (2005). Solving the prize-collecting Steiner tree problem to optimality. Dans: <i>ALENEX/ANALCO</i>. SIAM, pp. 68-76.
LJUBIC, I., WEISKIRCHER, R., PFERSCHY, U., KLAU, G., MUTZEL, P. et FISCHETTI, M. (2005). Solving the
"
"authors" => array:6 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "WEISKIRCHER René"
]
2 => array:1 [
"name" => "PFERSCHY Ulrich"
]
3 => array:1 [
"name" => "KLAU Gunnar"
]
4 => array:1 [
"name" => "MUTZEL P."
]
5 => array:1 [
"name" => "FISCHETTI M."
]
]
"ouvrage" => "ALENEX/ANALCO"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "68-76"
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
78 => Essec\Faculty\Model\Contribution {#2440
#_index: "academ_contributions"
#_id: "11992"
#_source: array:18 [
"id" => "11992"
"slug" => "combining-a-memetic-algorithm-with-integer-programming-to-solve-the-prize-collecting-steiner-tree-problem
combining-a-memetic-algorithm-with-integer-programming-to-solve-the-prize-collecting-steiner-tree-pr
"
"yearMonth" => "2004-01"
"year" => "2004"
"title" => "Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem
Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Pr
"
"description" => "KLAU, G.W., LJUBIC, I., MOSER, A., MUTZEL, P., NEUNER, P., PFERSCHY, U. et WEISKIRCHER, R. (2004). Combining a Memetic Algorithm with Integer Programming to Solve the Prize-Collecting Steiner Tree Problem. Dans: Kalyanmoy Deb (ed.). <i>Genetic and Evolutionary Computation – GECCO 2004</i>. 1 ed. Springer Berlin Heidelberg, pp. 1304-1315.
KLAU, G.W., LJUBIC, I., MOSER, A., MUTZEL, P., NEUNER, P., PFERSCHY, U. et WEISKIRCHER, R. (2004). C
"
"authors" => array:7 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "KLAU Gunnar W."
]
2 => array:1 [
"name" => "MOSER Andreas"
]
3 => array:1 [
"name" => "MUTZEL Petra"
]
4 => array:1 [
"name" => "NEUNER Philipp"
]
5 => array:1 [
"name" => "PFERSCHY Ulrich"
]
6 => array:1 [
"name" => "WEISKIRCHER René"
]
]
"ouvrage" => "Genetic and Evolutionary Computation – GECCO 2004"
"keywords" => []
"updatedAt" => "2020-12-17 18:37:46"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "1304-1315"
"volume" => "3102 of LNCS"
"number" => null
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
79 => Essec\Faculty\Model\Contribution {#2441
#_index: "academ_contributions"
#_id: "11993"
#_source: array:18 [
"id" => "11993"
"slug" => "the-fractional-prize-collecting-steiner-tree-problem-on-trees-extended-abstract"
"yearMonth" => "2003-01"
"year" => "2003"
"title" => "The fractional prize collecting Steiner tree problem on trees: Extended abstract"
"description" => "KLAU, G., LJUBIC, I., MUTZEL, P., PFERSCHY, U. et WEISKIRCHER, R. (2003). The fractional prize collecting Steiner tree problem on trees: Extended abstract. Dans: <i>ESA</i>. Springer, pp. 691-702.
KLAU, G., LJUBIC, I., MUTZEL, P., PFERSCHY, U. et WEISKIRCHER, R. (2003). The fractional prize colle
"
"authors" => array:5 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "KLAU Gunnar"
]
2 => array:1 [
"name" => "MUTZEL P."
]
3 => array:1 [
"name" => "PFERSCHY Ulrich"
]
4 => array:1 [
"name" => "WEISKIRCHER René"
]
]
"ouvrage" => "ESA"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "691-702"
"volume" => "2832"
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
80 => Essec\Faculty\Model\Contribution {#2442
#_index: "academ_contributions"
#_id: "11994"
#_source: array:18 [
"id" => "11994"
"slug" => "a-genetic-algorithm-for-the-index-selection-problem"
"yearMonth" => "2003-01"
"year" => "2003"
"title" => "A Genetic Algorithm for the Index Selection Problem"
"description" => "KRATICA, J., LJUBIC, I. et TOŠIĆ, D. (2003). A Genetic Algorithm for the Index Selection Problem. Dans: Stefano Cagnoni, Colin G. Johnson, Juan J. Romero Cardalda, Elena Marchiori, David W. Corne, Jean-Arcady Meyer, Jens Gottlieb, Martin Middendorf, Agnès Guillot, Günther R. Raidl, Emma Hart eds. <i>Applications of Evolutionary Computing</i>. 1 ed. Springer Berlin Heidelberg, pp. 280-290.
KRATICA, J., LJUBIC, I. et TOŠIĆ, D. (2003). A Genetic Algorithm for the Index Selection Problem. Da
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "KRATICA Jozef"
]
2 => array:1 [
"name" => "TOŠIĆ Dušan"
]
]
"ouvrage" => "Applications of Evolutionary Computing"
"keywords" => []
"updatedAt" => "2020-12-17 18:37:46"
"publicationUrl" => "https://link.springer.com/chapter/10.1007/3-540-36605-9_26"
"publicationInfo" => array:3 [
"pages" => "280-290"
"volume" => "2279"
"number" => null
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
81 => Essec\Faculty\Model\Contribution {#2443
#_index: "academ_contributions"
#_id: "11995"
#_source: array:18 [
"id" => "11995"
"slug" => "a-memetic-algorithm-for-vertex-biconnectivity-augmentation"
"yearMonth" => "2002-01"
"year" => "2002"
"title" => "A Memetic Algorithm for Vertex-Biconnectivity Augmentation"
"description" => "KERSTING, S., RAIDL, G.R. et LJUBIC, I. (2002). A Memetic Algorithm for Vertex-Biconnectivity Augmentation. Dans: Stefano Cagnoni, Jens Gottlieb, Emma Hart, Martin Middendorf, Günther R. Raidl eds. <i>Applications of Evolutionary Computing</i>. 1 ed. Springer Berlin Heidelberg, pp. 102-111.
KERSTING, S., RAIDL, G.R. et LJUBIC, I. (2002). A Memetic Algorithm for Vertex-Biconnectivity Augmen
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "KERSTING Sandor"
]
2 => array:1 [
"name" => "RAIDL Günther R."
]
]
"ouvrage" => "Applications of Evolutionary Computing"
"keywords" => []
"updatedAt" => "2020-12-17 18:37:46"
"publicationUrl" => "https://link.springer.com/chapter/10.1007/3-540-46004-7_11"
"publicationInfo" => array:3 [
"pages" => "102-111"
"volume" => "2279"
"number" => null
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
82 => Essec\Faculty\Model\Contribution {#2444
#_index: "academ_contributions"
#_id: "11996"
#_source: array:18 [
"id" => "11996"
"slug" => "a-hybrid-ga-for-the-edge-biconnectivity-augmentation-problem"
"yearMonth" => "2000-01"
"year" => "2000"
"title" => "A Hybrid GA for the Edge-Biconnectivity Augmentation Problem"
"description" => "LJUBIC, I., RAIDL, G.R. et KRATICA, J. (2000). A Hybrid GA for the Edge-Biconnectivity Augmentation Problem. Dans: Marc Schoenauer, Kalyanmoy Deb, Günther Rudolph, Xin Yao, Evelyne Lutton, Juan Julian Merelo, Hans-Paul Schwefel eds. <i>Parallel Problem Solving from Nature PPSN VI</i>. 1 ed. Springer Berlin Heidelberg, pp. 641-650.
LJUBIC, I., RAIDL, G.R. et KRATICA, J. (2000). A Hybrid GA for the Edge-Biconnectivity Augmentation
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "RAIDL Günther R."
]
2 => array:1 [
"name" => "KRATICA Jozef"
]
]
"ouvrage" => "Parallel Problem Solving from Nature PPSN VI"
"keywords" => []
"updatedAt" => "2020-12-17 18:37:46"
"publicationUrl" => "https://link.springer.com/chapter/10.1007/3-540-45356-3_63"
"publicationInfo" => array:3 [
"pages" => "641-650"
"volume" => "1917"
"number" => null
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
83 => Essec\Faculty\Model\Contribution {#2445
#_index: "academ_contributions"
#_id: "11999"
#_source: array:18 [
"id" => "11999"
"slug" => "a-new-branch-and-bound-algorithm-for-the-maximum-edge-weighted-clique-problem"
"yearMonth" => "2019-10"
"year" => "2019"
"title" => "A new branch-and-bound algorithm for the maximum edge-weighted clique problem"
"description" => "SAN SEGUNDO, P., CONIGLIO, S., FURINI, F. et LJUBIC, I. (2019). A new branch-and-bound algorithm for the maximum edge-weighted clique problem. <i>European Journal of Operational Research</i>, 278(1), pp. 76-90.
SAN SEGUNDO, P., CONIGLIO, S., FURINI, F. et LJUBIC, I. (2019). A new branch-and-bound algorithm for
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "SAN SEGUNDO Pablo"
]
2 => array:1 [
"name" => "CONIGLIO Stefano"
]
3 => array:1 [
"name" => "FURINI Fabio"
]
]
"ouvrage" => ""
"keywords" => array:1 [
0 => "Combinatorial optimization, Branch-and-bound, Maximum edge-weighted clique problem"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://www.sciencedirect.com/science/article/pii/S0377221719303054"
"publicationInfo" => array:3 [
"pages" => "76-90"
"volume" => "278"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We study the maximum edge-weighted clique problem, a problem related to the maximum (vertex-weighted) clique problem which asks for finding a complete subgraph (i.e., a clique) of maximum total weight on its edges. The problem appears in a wide range of applications, including bioinformatics, material science, computer vision, robotics, and many more. In this work, we propose a new combinatorial branch-and-bound algorithm for the problem which relies on a novel bounding procedure capable of pruning a very large amount of nodes of the branch-and-bound tree. Extensive computational experiments on random and structured graphs, encompassing standard benchmarks used in the literature as well as recently introduced real-world large-scale graphs, show that our new algorithm outperforms the state-of-the-art by several orders of magnitude on many instances.
We study the maximum edge-weighted clique problem, a problem related to the maximum (vertex-weighted
"
"en" => "We study the maximum edge-weighted clique problem, a problem related to the maximum (vertex-weighted) clique problem which asks for finding a complete subgraph (i.e., a clique) of maximum total weight on its edges. The problem appears in a wide range of applications, including bioinformatics, material science, computer vision, robotics, and many more. In this work, we propose a new combinatorial branch-and-bound algorithm for the problem which relies on a novel bounding procedure capable of pruning a very large amount of nodes of the branch-and-bound tree. Extensive computational experiments on random and structured graphs, encompassing standard benchmarks used in the literature as well as recently introduced real-world large-scale graphs, show that our new algorithm outperforms the state-of-the-art by several orders of magnitude on many instances.
We study the maximum edge-weighted clique problem, a problem related to the maximum (vertex-weighted
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
84 => Essec\Faculty\Model\Contribution {#2446
#_index: "academ_contributions"
#_id: "12004"
#_source: array:18 [
"id" => "12004"
"slug" => "the-connected-facility-location-polytope"
"yearMonth" => "2018-01"
"year" => "2018"
"title" => "The Connected Facility Location Polytope"
"description" => "LEITNER, M., LJUBIC, I., SALAZAR-GONZALEZ, J.J. et SINNL, M. (2018). The Connected Facility Location Polytope. <i>Discrete Applied Mathematics</i>, 234, pp. 151-167.
LEITNER, M., LJUBIC, I., SALAZAR-GONZALEZ, J.J. et SINNL, M. (2018). The Connected Facility Location
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER Markus"
]
2 => array:1 [
"name" => "SALAZAR-GONZALEZ Juan-José"
]
3 => array:1 [
"name" => "SINNL Markus"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Valid inequalities"
1 => "Facets"
2 => "Facility location"
3 => "Steiner trees"
]
"updatedAt" => "2022-06-17 11:40:41"
"publicationUrl" => "https://doi.org/10.1016/j.dam.2016.08.010"
"publicationInfo" => array:3 [
"pages" => "151-167"
"volume" => "234"
"number" => ""
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We analyze the polytope associated with a combinatorial problem that combines the Steiner tree problem and the uncapacitated facility location problem. The problem, called connected facility location problem, is motivated by a real-world application in the design of a telecommunication network, and concerns with deciding the facilities to open, the assignment of customers to open facilities, and the connection of the open facilities through a Steiner tree. Several solution approaches are proposed in the literature, and the contribution of our work is a polyhedral analysis for the problem. We compute the dimension of the polytope, present valid inequalities, and analyze conditions for these inequalities to be facet defining. Some inequalities are taken from the Steiner tree polytope and the uncapacitated facility location polytope. Other inequalities are new.
We analyze the polytope associated with a combinatorial problem that combines the Steiner tree probl
"
"en" => "We analyze the polytope associated with a combinatorial problem that combines the Steiner tree problem and the uncapacitated facility location problem. The problem, called connected facility location problem, is motivated by a real-world application in the design of a telecommunication network, and concerns with deciding the facilities to open, the assignment of customers to open facilities, and the connection of the open facilities through a Steiner tree. Several solution approaches are proposed in the literature, and the contribution of our work is a polyhedral analysis for the problem. We compute the dimension of the polytope, present valid inequalities, and analyze conditions for these inequalities to be facet defining. Some inequalities are taken from the Steiner tree polytope and the uncapacitated facility location polytope. Other inequalities are new.
We analyze the polytope associated with a combinatorial problem that combines the Steiner tree probl
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
85 => Essec\Faculty\Model\Contribution {#2447
#_index: "academ_contributions"
#_id: "12000"
#_source: array:18 [
"id" => "12000"
"slug" => "on-integer-and-bilevel-formulations-for-the-k-vertex-cut-problem"
"yearMonth" => "2020-07"
"year" => "2020"
"title" => "On Integer and Bilevel Formulations for the k-Vertex Cut Problem"
"description" => "LJUBIC, I., FURINI, F., MALAGUTI, E. et PARONUZZI, P. (2020). On Integer and Bilevel Formulations for the k-Vertex Cut Problem. <i>Mathematical Programming Computation</i>, 12, pp. 133-164.
LJUBIC, I., FURINI, F., MALAGUTI, E. et PARONUZZI, P. (2020). On Integer and Bilevel Formulations fo
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI Fabio"
]
2 => array:1 [
"name" => "MALAGUTI Enrico"
]
3 => array:1 [
"name" => "PARONUZZI Paolo"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1007/s12532-019-00167-1"
"publicationInfo" => array:3 [
"pages" => "133-164"
"volume" => "12"
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The family of critical node detection problems asks for finding a subset of vertices, deletion of which minimizes or maximizes a predefined connectivity measure on the remaining network. We study a problem of this family called the k-vertex cut problem. The problem asks for determining the minimum weight subset of nodes whose removal disconnects a graph into at least k components. We provide two new integer linear programming formulations, along with families of strengthening valid inequalities. Both models involve an exponential number of constraints for which we provide poly-time separation procedures and design the respective branch-and-cut algorithms. In the first formulation one representative vertex is chosen for each of the k mutually disconnected vertex subsets of the remaining graph. In the second formulation, the model is derived from the perspective of a two-phase Stackelberg game in which a leader deletes the vertices in the first phase, and in the second phase a follower builds connected components in the remaining graph. Our computational study demonstrates that a hybrid model in which valid inequalities of both formulations are combined significantly outperforms the state-of-the-art exact methods from the literature.
The family of critical node detection problems asks for finding a subset of vertices, deletion of wh
"
"en" => "The family of critical node detection problems asks for finding a subset of vertices, deletion of which minimizes or maximizes a predefined connectivity measure on the remaining network. We study a problem of this family called the k-vertex cut problem. The problem asks for determining the minimum weight subset of nodes whose removal disconnects a graph into at least k components. We provide two new integer linear programming formulations, along with families of strengthening valid inequalities. Both models involve an exponential number of constraints for which we provide poly-time separation procedures and design the respective branch-and-cut algorithms. In the first formulation one representative vertex is chosen for each of the k mutually disconnected vertex subsets of the remaining graph. In the second formulation, the model is derived from the perspective of a two-phase Stackelberg game in which a leader deletes the vertices in the first phase, and in the second phase a follower builds connected components in the remaining graph. Our computational study demonstrates that a hybrid model in which valid inequalities of both formulations are combined significantly outperforms the state-of-the-art exact methods from the literature.
The family of critical node detection problems asks for finding a subset of vertices, deletion of wh
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
86 => Essec\Faculty\Model\Contribution {#2448
#_index: "academ_contributions"
#_id: "12006"
#_source: array:18 [
"id" => "12006"
"slug" => "feature-cluster-recent-advances-in-exact-methods-for-multi-objective-optimisation"
"yearMonth" => "2017-08"
"year" => "2017"
"title" => "Feature cluster: Recent advances in exact methods for multi-objective optimisation"
"description" => "EHRGOTT, M., LJUBIC, I. et PARRAGH, S.N. (2017). Feature cluster: Recent advances in exact methods for multi-objective optimisation. <i>European Journal of Operational Research</i>, 260(3), pp. 805-806.
EHRGOTT, M., LJUBIC, I. et PARRAGH, S.N. (2017). Feature cluster: Recent advances in exact methods f
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "EHRGOTT Matthias"
]
2 => array:1 [
"name" => "PARRAGH Sophie N."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://www.sciencedirect.com/science/article/abs/pii/S0377221717301091?via%3Dihub"
"publicationInfo" => array:3 [
"pages" => "805-806"
"volume" => "260"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Editorial to a feature cluster increasing the visibility of research concerning exact methods for multi-objective optimisation and to motivate a broader group of researchers to contribute to the field.
Editorial to a feature cluster increasing the visibility of research concerning exact methods for mu
"
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
87 => Essec\Faculty\Model\Contribution {#2449
#_index: "academ_contributions"
#_id: "12001"
#_source: array:18 [
"id" => "12001"
"slug" => "the-generalized-reserve-set-covering-problem-with-connectivity-and-buffer-requirements"
"yearMonth" => "2021-03"
"year" => "2021"
"title" => "The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements"
"description" => "ÁLVAREZ-MIRANDA, E., GOYCOOLEA, M., LJUBIC, I. et SINNL, M. (2021). The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements. <i>European Journal of Operational Research</i>, 289(3), pp. 1013-1029.
ÁLVAREZ-MIRANDA, E., GOYCOOLEA, M., LJUBIC, I. et SINNL, M. (2021). The Generalized Reserve Set Cove
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ÁLVAREZ-MIRANDA Eduardo"
]
2 => array:1 [
"name" => "GOYCOOLEA Marcos"
]
3 => array:1 [
"name" => "SINNL Markus"
]
]
"ouvrage" => ""
"keywords" => array:1 [
0 => "Combinatorial optimization, Maximum weight connected subgraph problem, Wildlife reserve design, Reserve set covering problem, Branch-and-cut
Combinatorial optimization, Maximum weight connected subgraph problem, Wildlife reserve design, Rese
"
]
"updatedAt" => "2023-09-22 16:41:04"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2019.07.017"
"publicationInfo" => array:3 [
"pages" => "1013-1029"
"volume" => "289"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
The design of nature reserves is becoming, more and more, a crucial task for ensuring the conservation of endangered wildlife. In order to guarantee the preservation of species and a general ecological functioning, the designed reserves must typically verify a series of spatial requirements. Among the required characteristics, practitioners and researchers have pointed out two crucial aspects: (i) connectivity, so as to avoid spatial fragmentation, and (ii) the design of buffer zones surrounding (or protecting) so-called core areas.\n
The design of nature reserves is becoming, more and more, a crucial task for ensuring the conservati
\n
In this paper, we introduce the Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements. This problem extends the classical Reserve Set Covering Problem and allows to address these two requirements simultaneously. A solution framework based on Integer Linear Programming and branch-and-cut is developed. The framework is enhanced by valid inequalities, a construction and a primal heuristic and local branching. The problem and the framework are presented in a modular way to allow practitioners to select the constraints fitting to their needs and to analyze the effect of e.g., only enforcing connectivity or buffer zones.\n
In this paper, we introduce the Generalized Reserve Set Covering Problem with Connectivity and Buffe
\n
An extensive computational study on grid-graph instances and real-life instances based on data from three states of the U.S. and one region of Australia is carried out to assess the suitability of the proposed model to deal with the challenges faced by decision-makers in natural reserve design. In the study, we also analyze the effects on the structure of solutions when only enforcing connectivity or buffer zones or just solving a generalized version of the classical Reserve Set Covering Problem. The results show, on the one hand, the flexibility of the proposed models to provide solutions according to the decision-makers’ requirements, and on the other hand, the effectiveness of the devised algorithm for providing good solutions in reasonable computing times.
An extensive computational study on grid-graph instances and real-life instances based on data from
"""
"en" => """
The design of nature reserves is becoming, more and more, a crucial task for ensuring the conservation of endangered wildlife. In order to guarantee the preservation of species and a general ecological functioning, the designed reserves must typically verify a series of spatial requirements. Among the required characteristics, practitioners and researchers have pointed out two crucial aspects: (i) connectivity, so as to avoid spatial fragmentation, and (ii) the design of buffer zones surrounding (or protecting) so-called core areas.\n
The design of nature reserves is becoming, more and more, a crucial task for ensuring the conservati
\n
In this paper, we introduce the Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements. This problem extends the classical Reserve Set Covering Problem and allows to address these two requirements simultaneously. A solution framework based on Integer Linear Programming and branch-and-cut is developed. The framework is enhanced by valid inequalities, a construction and a primal heuristic and local branching. The problem and the framework are presented in a modular way to allow practitioners to select the constraints fitting to their needs and to analyze the effect of e.g., only enforcing connectivity or buffer zones.\n
In this paper, we introduce the Generalized Reserve Set Covering Problem with Connectivity and Buffe
\n
An extensive computational study on grid-graph instances and real-life instances based on data from three states of the U.S. and one region of Australia is carried out to assess the suitability of the proposed model to deal with the challenges faced by decision-makers in natural reserve design. In the study, we also analyze the effects on the structure of solutions when only enforcing connectivity or buffer zones or just solving a generalized version of the classical Reserve Set Covering Problem. The results show, on the one hand, the flexibility of the proposed models to provide solutions according to the decision-makers’ requirements, and on the other hand, the effectiveness of the devised algorithm for providing good solutions in reasonable computing times.
An extensive computational study on grid-graph instances and real-life instances based on data from
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
88 => Essec\Faculty\Model\Contribution {#2450
#_index: "academ_contributions"
#_id: "12002"
#_source: array:18 [
"id" => "12002"
"slug" => "location-of-charging-stations-in-electric-car-sharing-systems"
"yearMonth" => "2020-09"
"year" => "2020"
"title" => "Location of Charging Stations in Electric Car Sharing Systems"
"description" => "BRANDSTÄTTER, G., LEITNER, M. et LJUBIC, I. (2020). Location of Charging Stations in Electric Car Sharing Systems. <i>Transportation Science</i>, 54(5), pp. 1408-1438.
BRANDSTÄTTER, G., LEITNER, M. et LJUBIC, I. (2020). Location of Charging Stations in Electric Car Sh
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "BRANDSTÄTTER Georg"
]
2 => array:1 [
"name" => "LEITNER Markus"
]
]
"ouvrage" => ""
"keywords" => array:1 [
0 => "green logistics, location analysis, electric vehicles, car sharing, charging station location, integer linear programming
green logistics, location analysis, electric vehicles, car sharing, charging station location, integ
"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1287/trsc.2019.0931"
"publicationInfo" => array:3 [
"pages" => "1408-1438"
"volume" => "54"
"number" => "5"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Electric vehicles are prime candidates for use within urban car sharing systems, both from economic and environmental perspectives. However, their relatively short range necessitates frequent and rather time-consuming recharging throughout the day. Thus, charging stations must be built throughout the system’s operational area where cars can be charged between uses. In this work, we introduce and study an optimization problem that models the task of finding optimal locations and sizes for charging stations, using the number of expected trips that can be accepted (or their resulting revenue) as a gauge of quality. Integer linear programming formulations and construction heuristics are introduced, and the resulting algorithms are tested on grid-graph-based instances, as well as on real-world instances from Vienna. The results of our computational study show that the best-performing exact algorithm solves most of the benchmark instances to optimality and usually provides small optimality gaps for the remaining ones, whereas our heuristics provide high-quality solutions very quickly. Our algorithms also provide better solutions than a sequential approach that considers strategic and operational decisions separately. A cross-validation study analyzes the algorithms’ performance in cases where demand is uncertain and shows the advantage of combining individual solutions into a single consensus solution, and a simulation study investigates their behavior in car sharing systems that provide their customers with more flexibility regarding vehicle selection.
Electric vehicles are prime candidates for use within urban car sharing systems, both from economic
"
"en" => "Electric vehicles are prime candidates for use within urban car sharing systems, both from economic and environmental perspectives. However, their relatively short range necessitates frequent and rather time-consuming recharging throughout the day. Thus, charging stations must be built throughout the system’s operational area where cars can be charged between uses. In this work, we introduce and study an optimization problem that models the task of finding optimal locations and sizes for charging stations, using the number of expected trips that can be accepted (or their resulting revenue) as a gauge of quality. Integer linear programming formulations and construction heuristics are introduced, and the resulting algorithms are tested on grid-graph-based instances, as well as on real-world instances from Vienna. The results of our computational study show that the best-performing exact algorithm solves most of the benchmark instances to optimality and usually provides small optimality gaps for the remaining ones, whereas our heuristics provide high-quality solutions very quickly. Our algorithms also provide better solutions than a sequential approach that considers strategic and operational decisions separately. A cross-validation study analyzes the algorithms’ performance in cases where demand is uncertain and shows the advantage of combining individual solutions into a single consensus solution, and a simulation study investigates their behavior in car sharing systems that provide their customers with more flexibility regarding vehicle selection.
Electric vehicles are prime candidates for use within urban car sharing systems, both from economic
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
89 => Essec\Faculty\Model\Contribution {#2451
#_index: "academ_contributions"
#_id: "12010"
#_source: array:18 [
"id" => "12010"
"slug" => "special-issue-on-decomposition-methods-for-hard-optimization-problems"
"yearMonth" => "2020-01"
"year" => "2020"
"title" => "Special issue on “Decomposition Methods for Hard Optimization Problems”"
"description" => "LJUBIC, I., FURINI, F. et TRAVERSI, E. (2020). Special issue on “Decomposition Methods for Hard Optimization Problems”. <i>Annals of Operations Research</i>, 284(2).
LJUBIC, I., FURINI, F. et TRAVERSI, E. (2020). Special issue on “Decomposition Methods for Hard Opti
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI Fabio"
]
2 => array:1 [
"name" => "TRAVERSI Emiliano"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://link.springer.com/journal/10479/volumes-and-issues/284-2"
"publicationInfo" => array:3 [
"pages" => null
"volume" => "284"
"number" => "2"
]
"type" => array:2 [
"fr" => "Editeur invité d'un numéro spécial"
"en" => "Guest editor of a journal special issue"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
90 => Essec\Faculty\Model\Contribution {#2452
#_index: "academ_contributions"
#_id: "12012"
#_source: array:18 [
"id" => "12012"
"slug" => "operations-research-proceedings-2015-issn-0721-5924"
"yearMonth" => "2017-01"
"year" => "2017"
"title" => "Operations Research Proceedings 2015 ISSN: 0721-5924"
"description" => "DOERNER, K., LJUBIC, I., PFLUG, G. et TRAGLER, G. (2017). Operations Research Proceedings 2015 ISSN: 0721-5924. <i>Operations Research Proceedings</i>.
DOERNER, K., LJUBIC, I., PFLUG, G. et TRAGLER, G. (2017). Operations Research Proceedings 2015 ISSN:
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "DOERNER Karl"
]
2 => array:1 [
"name" => "PFLUG Georg"
]
3 => array:1 [
"name" => "TRAGLER Gernot"
]
]
"ouvrage" => ""
"keywords" => array:1 [
0 => "optimization and simulation, transportation, logistics, cutting and packing, OR applications in production, OR applications in supply chains, OR applications in energy, OR applications in finance
optimization and simulation, transportation, logistics, cutting and packing, OR applications in prod
"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1007/978-3-319-42902-1"
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Editeur invité d'un numéro spécial"
"en" => "Guest editor of a journal special issue"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
91 => Essec\Faculty\Model\Contribution {#2453
#_index: "academ_contributions"
#_id: "12013"
#_source: array:18 [
"id" => "12013"
"slug" => "branch-and-benders-cut-algorithms-modern-implementations-of-benders-decomposition-invited-tutorial"
"yearMonth" => "2020-01"
"year" => "2020"
"title" => "Branch-and-Benders-cut algorithms: modern implementations of Benders Decomposition, (Invited Tutorial),
Branch-and-Benders-cut algorithms: modern implementations of Benders Decomposition, (Invited Tutori
"
"description" => "LJUBIC, I. (2020). Branch-and-Benders-cut algorithms: modern implementations of Benders Decomposition, (Invited Tutorial), Dans: 9th Winter School on Network Optimization (NetOpt2020). Estoril.
LJUBIC, I. (2020). Branch-and-Benders-cut algorithms: modern implementations of Benders Decompositi
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "9th Winter School on Network Optimization (NetOpt2020)"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
92 => Essec\Faculty\Model\Contribution {#2454
#_index: "academ_contributions"
#_id: "12015"
#_source: array:18 [
"id" => "12015"
"slug" => "solving-very-large-scale-covering-location-problems-using-branch-and-benders-cuts"
"yearMonth" => "2019-01"
"year" => "2019"
"title" => "Solving Very Large Scale Covering Location Problems using Branch-and- Benders-Cuts"
"description" => "LJUBIC, I. (2019). Solving Very Large Scale Covering Location Problems using Branch-and- Benders-Cuts. Dans: IX International Workshop on Locational Analysis and Related Problems 2019. Cadiz.
LJUBIC, I. (2019). Solving Very Large Scale Covering Location Problems using Branch-and- Benders-Cut
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "IX International Workshop on Locational Analysis and Related Problems 2019"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
93 => Essec\Faculty\Model\Contribution {#2455
#_index: "academ_contributions"
#_id: "12022"
#_source: array:18 [
"id" => "12022"
"slug" => "on-benders-decomposition-for-facility-location"
"yearMonth" => "2015-12"
"year" => "2015"
"title" => "On Benders Decomposition for Facility Location"
"description" => "LJUBIC, I. (2015). On Benders Decomposition for Facility Location. Dans: 9ème Journée d’Automne d’Optimisation dans les Réseaux, ROADEF GT d’Optimisation des Réseaux, Institut Henri Poincaré.
LJUBIC, I. (2015). On Benders Decomposition for Facility Location. Dans: 9ème Journée d’Automne d’Op
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "9ème Journée d’Automne d’Optimisation dans les Réseaux, ROADEF GT d’Optimisation des Réseaux, Institut Henri Poincaré
9ème Journée d’Automne d’Optimisation dans les Réseaux, ROADEF GT d’Optimisation des Réseaux, Instit
"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
94 => Essec\Faculty\Model\Contribution {#2456
#_index: "academ_contributions"
#_id: "12029"
#_source: array:18 [
"id" => "12029"
"slug" => "a-polyhedral-study-of-the-diameter-constrained-minimum-spanning-tree-problem"
"yearMonth" => "2015-03"
"year" => "2015"
"title" => "A polyhedral study of the diameter constrained minimum spanning tree problem"
"description" => "LJUBIC, I. (2015). A polyhedral study of the diameter constrained minimum spanning tree problem. Dans: Seminario conjunto ACGO y Matemáticas Discretas, Center of Mathematical Modeling. Santiago.
LJUBIC, I. (2015). A polyhedral study of the diameter constrained minimum spanning tree problem. Dan
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Seminario conjunto ACGO y Matemáticas Discretas, Center of Mathematical Modeling"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
95 => Essec\Faculty\Model\Contribution {#2457
#_index: "academ_contributions"
#_id: "12031"
#_source: array:18 [
"id" => "12031"
"slug" => "the-maximum-weight-connected-subgraph-problem-applications-in-bioinformatics"
"yearMonth" => "2013-08"
"year" => "2013"
"title" => "The Maximum Weight Connected Subgraph Problem: Applications in Bioinformatics"
"description" => "LJUBIC, I. (2013). The Maximum Weight Connected Subgraph Problem: Applications in Bioinformatics. Dans: The Centre for Bioinformatics, Biomarker Discovery and Information-Based Medicine (CIBM), University of Newcastle. Newcastle.
LJUBIC, I. (2013). The Maximum Weight Connected Subgraph Problem: Applications in Bioinformatics. Da
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "The Centre for Bioinformatics, Biomarker Discovery and Information-Based Medicine (CIBM), University of Newcastle
The Centre for Bioinformatics, Biomarker Discovery and Information-Based Medicine (CIBM), University
"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
96 => Essec\Faculty\Model\Contribution {#2458
#_index: "academ_contributions"
#_id: "12033"
#_source: array:18 [
"id" => "12033"
"slug" => "solving-2-stage-stochastic-network-design-problems-by-2-stage-branch-and-cut"
"yearMonth" => "2012-07"
"year" => "2012"
"title" => "Solving 2-Stage Stochastic Network Design Problems by 2-Stage Branch- and-Cut"
"description" => "LJUBIC, I. (2012). Solving 2-Stage Stochastic Network Design Problems by 2-Stage Branch- and-Cut. Dans: Seminarios CIO, Centro de Investigacao Operacional, Faculdade de Ciencias, Universidade de Lisboa. Lisboa.
LJUBIC, I. (2012). Solving 2-Stage Stochastic Network Design Problems by 2-Stage Branch- and-Cut. Da
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Seminarios CIO, Centro de Investigacao Operacional, Faculdade de Ciencias, Universidade de Lisboa"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
97 => Essec\Faculty\Model\Contribution {#2459
#_index: "academ_contributions"
#_id: "12035"
#_source: array:18 [
"id" => "12035"
"slug" => "the-recoverable-robust-two-level-network-design-problem"
"yearMonth" => "2012-04"
"year" => "2012"
"title" => "The Recoverable Robust Two-Level Network Design Problem"
"description" => "LJUBIC, I. (2012). The Recoverable Robust Two-Level Network Design Problem. Dans: Kolloquium Optimierung und Operations Research der Wirtschafts- und Sozialwis- senschaftlichen Fakultät, der Fakultät für Informatik und der Fakultät für Mathematik, TU Dortmund. Dortmund.
LJUBIC, I. (2012). The Recoverable Robust Two-Level Network Design Problem. Dans: Kolloquium Optimi
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Kolloquium Optimierung und Operations Research der Wirtschafts- und Sozialwis- senschaftlichen Fakultät, der Fakultät für Informatik und der Fakultät für Mathematik, TU Dortmund
Kolloquium Optimierung und Operations Research der Wirtschafts- und Sozialwis- senschaftlichen Faku
"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
98 => Essec\Faculty\Model\Contribution {#2460
#_index: "academ_contributions"
#_id: "12036"
#_source: array:18 [
"id" => "12036"
"slug" => "solving-two-stage-stochastic-steiner-tree-problems-by-two-stage-branch-and-cut"
"yearMonth" => "2012-01"
"year" => "2012"
"title" => "Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch- and-Cut"
"description" => "LJUBIC, I. (2012). Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch- and-Cut. Dans: Department of Decision Sciences, I2SDS Seminar, George Washington University. Washington DC.
LJUBIC, I. (2012). Solving Two-Stage Stochastic Steiner Tree Problems by Two-Stage Branch- and-Cut.
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Department of Decision Sciences, I2SDS Seminar, George Washington University"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
99 => Essec\Faculty\Model\Contribution {#2461
#_index: "academ_contributions"
#_id: "12042"
#_source: array:18 [
"id" => "12042"
"slug" => "optimization-in-telecommunication-networks-multicommodity-flow-facil-ity-location-and-steiner-tree-problems
optimization-in-telecommunication-networks-multicommodity-flow-facil-ity-location-and-steiner-tree-p
"
"yearMonth" => "2006-07"
"year" => "2006"
"title" => "Optimization in Telecommunication Networks: Multicommodity Flow, Facil- ity Location and Steiner Tree Problems
Optimization in Telecommunication Networks: Multicommodity Flow, Facil- ity Location and Steiner Tre
"
"description" => "LJUBIC, I. (2006). Optimization in Telecommunication Networks: Multicommodity Flow, Facil- ity Location and Steiner Tree Problems. Dans: CI-Colloquium, Sonderforschung-bereich Computational Intelligence, University of Dortmund. Dortmund.
LJUBIC, I. (2006). Optimization in Telecommunication Networks: Multicommodity Flow, Facil- ity Locat
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "CI-Colloquium, Sonderforschung-bereich Computational Intelligence, University of Dortmund"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
100 => Essec\Faculty\Model\Contribution {#2462
#_index: "academ_contributions"
#_id: "12082"
#_source: array:18 [
"id" => "12082"
"slug" => "preface-decomposition-methods-for-hard-optimization-problems"
"yearMonth" => "2020-01"
"year" => "2020"
"title" => "Preface: decomposition methods for hard optimization problems"
"description" => "FURINI, F., LJUBIC, I. et TRAVERSI, E. (2020). Preface: decomposition methods for hard optimization problems. <i>Annals of Operations Research</i>, 284(2), pp. 483–485.
FURINI, F., LJUBIC, I. et TRAVERSI, E. (2020). Preface: decomposition methods for hard optimization
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI Fabio"
]
2 => array:1 [
"name" => "TRAVERSI Emiliano"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1007/s10479-019-03415-8"
"publicationInfo" => array:3 [
"pages" => "483–485"
"volume" => "284"
"number" => "2"
]
"type" => array:2 [
"fr" => "Préfaces / Introductions de revue"
"en" => "Prefaces of a journal"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Divide and conquer, from Latin divide et impera, is one of the key techniques for tackling combinatorial optimization problems. It relies on the idea of decomposing complex problems into a sequence of subproblems that are then easier to handle. Decomposition techniques (such as Dantzig-Wolfe, Lagrangian, or Benders decomposition) are extremely effective in a wide range of applications, including cutting and packing, production and scheduling, routing and logistics, telecommunications, transportation, and many others. Moreover, decomposition techniques play an important role in many different fields of mixed-integer linear and non-linear optimization, multi objective optimization, optimization under uncertainty, bilevel optimization, etc. Despite the tremendous amount of research on these topics, the mathematical optimization community is constantly faced with new challenges coming from theoretical aspects and real world applications that require the development of new advanced tools.
Divide and conquer, from Latin divide et impera, is one of the key techniques for tackling combinato
"
"en" => "Divide and conquer, from Latin divide et impera, is one of the key techniques for tackling combinatorial optimization problems. It relies on the idea of decomposing complex problems into a sequence of subproblems that are then easier to handle. Decomposition techniques (such as Dantzig-Wolfe, Lagrangian, or Benders decomposition) are extremely effective in a wide range of applications, including cutting and packing, production and scheduling, routing and logistics, telecommunications, transportation, and many others. Moreover, decomposition techniques play an important role in many different fields of mixed-integer linear and non-linear optimization, multi objective optimization, optimization under uncertainty, bilevel optimization, etc. Despite the tremendous amount of research on these topics, the mathematical optimization community is constantly faced with new challenges coming from theoretical aspects and real world applications that require the development of new advanced tools.
Divide and conquer, from Latin divide et impera, is one of the key techniques for tackling combinato
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
101 => Essec\Faculty\Model\Contribution {#2463
#_index: "academ_contributions"
#_id: "12094"
#_source: array:18 [
"id" => "12094"
"slug" => "a-polyhedral-study-of-the-diameter-constrained-minimum-spanning-tree-problem"
"yearMonth" => "2020-10"
"year" => "2020"
"title" => "A polyhedral study of the diameter constrained minimum spanning tree problem"
"description" => "GOUVEIA, L., LEITNER, M. et LJUBIC, I. (2020). A polyhedral study of the diameter constrained minimum spanning tree problem. <i>Discrete Applied Mathematics</i>, 285, pp. 364-379.
GOUVEIA, L., LEITNER, M. et LJUBIC, I. (2020). A polyhedral study of the diameter constrained minimu
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GOUVEIA Luis"
]
2 => array:1 [
"name" => "LEITNER Markus"
]
]
"ouvrage" => ""
"keywords" => array:1 [
0 => "Integer programming, Diameter constrained trees, Facet"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.dam.2020.05.020"
"publicationInfo" => array:3 [
"pages" => "364-379"
"volume" => "285"
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "This paper provides a first polyhedral study of the diameter constrained minimum spanning tree problem (DMSTP). We introduce a new set of inequalities, the circular-jump inequalities which strengthen the well-known jump inequalities. These inequalities are further generalized in two ways: either by increasing the number of partitions defining a jump, or by combining jumps with cutsets. Most of the proposed new inequalities are shown to define facets of the DMSTP polytope under very mild conditions. Currently best known lower bounds for the DMSTP are obtained from an extended formulation on a layered graph using the concept of central nodes/edges. A subset of the new families of inequalities is shown to be not implied by this layered graph formulation.
This paper provides a first polyhedral study of the diameter constrained minimum spanning tree probl
"
"en" => "This paper provides a first polyhedral study of the diameter constrained minimum spanning tree problem (DMSTP). We introduce a new set of inequalities, the circular-jump inequalities which strengthen the well-known jump inequalities. These inequalities are further generalized in two ways: either by increasing the number of partitions defining a jump, or by combining jumps with cutsets. Most of the proposed new inequalities are shown to define facets of the DMSTP polytope under very mild conditions. Currently best known lower bounds for the DMSTP are obtained from an extended formulation on a layered graph using the concept of central nodes/edges. A subset of the new families of inequalities is shown to be not implied by this layered graph formulation.
This paper provides a first polyhedral study of the diameter constrained minimum spanning tree probl
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
102 => Essec\Faculty\Model\Contribution {#2464
#_index: "academ_contributions"
#_id: "12095"
#_source: array:18 [
"id" => "12095"
"slug" => "solving-steiner-trees-recent-advances-challenges-and-perspectives"
"yearMonth" => "2021-03"
"year" => "2021"
"title" => "Solving Steiner trees: Recent advances, challenges, and perspectives"
"description" => "LJUBIC, I. (2021). Solving Steiner trees: Recent advances, challenges, and perspectives. <i>Networks</i>, 77(2), pp. 177-204.
LJUBIC, I. (2021). Solving Steiner trees: Recent advances, challenges, and perspectives. <i>Networks
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => ""
"keywords" => array:1 [
0 => "combinatorial optimization, exact methods, heuristics, integer programming, Steiner tree problem"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1002/net.22005"
"publicationInfo" => array:3 [
"pages" => "177-204"
"volume" => "77"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The Steiner tree problem (STP) in graphs is one of the most studied problems in combinatorial optimization. Since its inception in 1970, numerous articles published in the journal Networks have stimulated new theoretical and computational studies on Steiner trees: from approximation algorithms, heuristics, metaheuristics, all the way to exact algorithms based on (mixed) integer linear programming, fixed parameter tractability, or combinatorial branch‐and‐bounds. The pervasive applicability and relevance of Steiner trees have been reinforced by the recent 11th DIMACS Implementation Challenge in 2014 and the PACE 2018 Challenge. This article provides an overview of the rich developments from the last three decades for the STP in graphs and highlights the most recent computational studies for some of its closely related variants.
The Steiner tree problem (STP) in graphs is one of the most studied problems in combinatorial optimi
"
"en" => "The Steiner tree problem (STP) in graphs is one of the most studied problems in combinatorial optimization. Since its inception in 1970, numerous articles published in the journal Networks have stimulated new theoretical and computational studies on Steiner trees: from approximation algorithms, heuristics, metaheuristics, all the way to exact algorithms based on (mixed) integer linear programming, fixed parameter tractability, or combinatorial branch‐and‐bounds. The pervasive applicability and relevance of Steiner trees have been reinforced by the recent 11th DIMACS Implementation Challenge in 2014 and the PACE 2018 Challenge. This article provides an overview of the rich developments from the last three decades for the STP in graphs and highlights the most recent computational studies for some of its closely related variants.
The Steiner tree problem (STP) in graphs is one of the most studied problems in combinatorial optimi
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
103 => Essec\Faculty\Model\Contribution {#2465
#_index: "academ_contributions"
#_id: "12096"
#_source: array:18 [
"id" => "12096"
"slug" => "an-exact-method-for-assortment-optimization-under-the-nested-logit-model"
"yearMonth" => "2021-06"
"year" => "2021"
"title" => "An Exact Method for Assortment Optimization under the Nested Logit Model"
"description" => "ALFANDARI, L., HASSANZADEH, A. et LJUBIC, I. (2021). An Exact Method for Assortment Optimization under the Nested Logit Model. <i>European Journal of Operational Research</i>, 291(3), pp. 830-845.
ALFANDARI, L., HASSANZADEH, A. et LJUBIC, I. (2021). An Exact Method for Assortment Optimization und
"
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "HASSANZADEH Alborz"
]
]
"ouvrage" => ""
"keywords" => array:2 [
0 => "combinatorial optimization"
1 => "revenue management -assortment optimization -fractional programming -nested logit"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2020.12.007"
"publicationInfo" => array:3 [
"pages" => "830-845"
"volume" => "291"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
We study the problem of finding an optimal assortment of products maximizing the expected revenue, in which customer preferences are modeled using a Nested Logit choice model. This problem is known to be polynomially solvable in a specific case and NP-hard otherwise, with only approximation algorithms existing in the literature. For the NP-hard cases, we provide a general exact method that embeds a tailored Branch-and-Bound algorithm into a fractional\n
We study the problem of finding an optimal assortment of products maximizing the expected revenue, i
programming framework. Contrary to the existing literature, in which sssumptions are imposed on either the structure of nests or the combination and characteristics of products, no assumptions on the input data are imposed, and hence our approach can solve the most general problem setting. We show that the parameterized subproblem of the fractional programming scheme, which is a binary highly non-linear optimization problem, is decomposable by nests, which is a main advantage of the approach. To solve the subproblem for each nest, we propose a two-stage approach. In the first stage, we identify those products that are undoubtedly beneficial to offer, or not, which can significantly reduce the problem size. In the second stage, we design a tailored Branch-and-Bound algorithm with problem-specific upper bounds. \n
programming framework. Contrary to the existing literature, in which sssumptions are imposed on eith
Numerical results show that the approach is able to solve assortment instances with up to 5,000 products per nest. The most challenging instances for our approach are those in which the dissimilarity parameters of nests can be either less or greater than one.
Numerical results show that the approach is able to solve assortment instances with up to 5,000 prod
"""
"en" => """
We study the problem of finding an optimal assortment of products maximizing the expected revenue, in which customer preferences are modeled using a Nested Logit choice model. This problem is known to be polynomially solvable in a specific case and NP-hard otherwise, with only approximation algorithms existing in the literature. For the NP-hard cases, we provide a general exact method that embeds a tailored Branch-and-Bound algorithm into a fractional\n
We study the problem of finding an optimal assortment of products maximizing the expected revenue, i
programming framework. Contrary to the existing literature, in which sssumptions are imposed on either the structure of nests or the combination and characteristics of products, no assumptions on the input data are imposed, and hence our approach can solve the most general problem setting. We show that the parameterized subproblem of the fractional programming scheme, which is a binary highly non-linear optimization problem, is decomposable by nests, which is a main advantage of the approach. To solve the subproblem for each nest, we propose a two-stage approach. In the first stage, we identify those products that are undoubtedly beneficial to offer, or not, which can significantly reduce the problem size. In the second stage, we design a tailored Branch-and-Bound algorithm with problem-specific upper bounds. \n
programming framework. Contrary to the existing literature, in which sssumptions are imposed on eith
Numerical results show that the approach is able to solve assortment instances with up to 5,000 products per nest. The most challenging instances for our approach are those in which the dissimilarity parameters of nests can be either less or greater than one.
Numerical results show that the approach is able to solve assortment instances with up to 5,000 prod
"""
]
"authors_fields" => array:2 [
"fr" => "Management des opérations"
"en" => "Operations Management"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
104 => Essec\Faculty\Model\Contribution {#2466
#_index: "academ_contributions"
#_id: "12200"
#_source: array:18 [
"id" => "12200"
"slug" => "casting-light-on-the-hidden-bilevel-combinatorial-structure-of-the-capacitated-vertex-separator-problem
casting-light-on-the-hidden-bilevel-combinatorial-structure-of-the-capacitated-vertex-separator-prob
"
"yearMonth" => "2022-07"
"year" => "2022"
"title" => "Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator problem
Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator prob
"
"description" => "FURINI, F., LJUBIC, I., MALAGUTI, E. et PARONUZZI, P. (2022). Casting light on the hidden bilevel combinatorial structure of the capacitated vertex separator problem. <i>Operations Research</i>, 70(4), pp. 2399–2420.
FURINI, F., LJUBIC, I., MALAGUTI, E. et PARONUZZI, P. (2022). Casting light on the hidden bilevel co
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI Fabio"
]
2 => array:1 [
"name" => "MALAGUTI Enrico"
]
3 => array:1 [
"name" => "PARONUZZI Paolo"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Networks/graphs"
1 => "Integer programming"
2 => "Benders decomposition"
3 => "Cutting plane"
]
"updatedAt" => "2022-09-12 16:07:53"
"publicationUrl" => "https://doi.org/10.1287/opre.2021.2110"
"publicationInfo" => array:3 [
"pages" => "2399–2420"
"volume" => "70"
"number" => "4"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Given an undirected graph, we study the capacitated vertex separator problem that asks to find a subset of vertices of minimum cardinality, the removal of which induces a graph having a bounded number of pairwise disconnected shores (subsets of vertices) of limited cardinality. The problem is of great importance in the analysis and protection of communication or social networks against possible viral attacks and for matrix decomposition algorithms. In this article, we provide a new bilevel interpretation of the problem and model it as a two-player Stackelberg game in which the leader interdicts the vertices (i.e., decides on the subset of vertices to remove), and the follower solves a combinatorial optimization problem on the resulting graph. This approach allows us to develop a computational framework based on an integer programming formulation in the natural space of the variables.
Given an undirected graph, we study the capacitated vertex separator problem that asks to find a sub
"
"en" => "Given an undirected graph, we study the capacitated vertex separator problem that asks to find a subset of vertices of minimum cardinality, the removal of which induces a graph having a bounded number of pairwise disconnected shores (subsets of vertices) of limited cardinality. The problem is of great importance in the analysis and protection of communication or social networks against possible viral attacks and for matrix decomposition algorithms. In this article, we provide a new bilevel interpretation of the problem and model it as a two-player Stackelberg game in which the leader interdicts the vertices (i.e., decides on the subset of vertices to remove), and the follower solves a combinatorial optimization problem on the resulting graph. This approach allows us to develop a computational framework based on an integer programming formulation in the natural space of the variables.
Given an undirected graph, we study the capacitated vertex separator problem that asks to find a sub
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
105 => Essec\Faculty\Model\Contribution {#2467
#_index: "academ_contributions"
#_id: "12232"
#_source: array:18 [
"id" => "12232"
"slug" => "new-integer-and-bilevel-formulations-for-the-k-vertex-cut-problem"
"yearMonth" => "2020-10"
"year" => "2020"
"title" => "New Integer and Bilevel Formulations for the k-Vertex Cut Problem"
"description" => "LJUBIC, I., FURINI, F., MALAGUTI, E. et PARONUZZI, P. (2020). New Integer and Bilevel Formulations for the k-Vertex Cut Problem. Dans: 22ème séminaire du groupe Polyèdres et Optimisation Combinatoire (POC). Online.
LJUBIC, I., FURINI, F., MALAGUTI, E. et PARONUZZI, P. (2020). New Integer and Bilevel Formulations f
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI Fabio"
]
2 => array:1 [
"name" => "MALAGUTI Enrico"
]
3 => array:1 [
"name" => "PARONUZZI Paolo"
]
]
"ouvrage" => "22ème séminaire du groupe Polyèdres et Optimisation Combinatoire (POC)"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
106 => Essec\Faculty\Model\Contribution {#2468
#_index: "academ_contributions"
#_id: "12573"
#_source: array:18 [
"id" => "12573"
"slug" => "a-tailored-benders-decomposition-approach-for-last-mile-delivery-withautonomous-robots"
"yearMonth" => "2021-07"
"year" => "2021"
"title" => """
A tailored Benders Decomposition Approach for Last-Mile Delivery With\n
autonomous Robots
"""
"description" => """
ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2021). A tailored Benders Decomposition Approach for Last-Mile Delivery With\n
ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2021). A tailored Benders Decomposition Approach
autonomous Robots. Dans: 31st European Conference on Operational Research 2021 (EURO 2021). Athens.
"""
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "DE MELO DA SILVA Marco"
]
]
"ouvrage" => "31st European Conference on Operational Research 2021 (EURO 2021)"
"keywords" => []
"updatedAt" => "2022-06-20 16:38:47"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
107 => Essec\Faculty\Model\Contribution {#2469
#_index: "academ_contributions"
#_id: "12598"
#_source: array:18 [
"id" => "12598"
"slug" => "a-branch-and-cut-algorithm-for-the-edge-interdiction-clique-problem"
"yearMonth" => "2021-10"
"year" => "2021"
"title" => "A branch-and-cut algorithm for the Edge Interdiction Clique Problem"
"description" => "FURINI, F., LJUBIC, I., SAN SEGUNDO, P. et ZHAO, Y. (2021). A branch-and-cut algorithm for the Edge Interdiction Clique Problem. <i>European Journal of Operational Research</i>, 294(1), pp. 54-69.
FURINI, F., LJUBIC, I., SAN SEGUNDO, P. et ZHAO, Y. (2021). A branch-and-cut algorithm for the Edge
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:3 [
"name" => "ZHAO Yanlu"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:1 [
"name" => "FURINI Fabio"
]
3 => array:1 [
"name" => "SAN SEGUNDO Pablo"
]
]
"ouvrage" => ""
"keywords" => array:1 [
0 => "Combinatorial optimization -Interdiction problems -Maximum clique -Most vital edges"
]
"updatedAt" => "2023-01-27 01:00:40"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2021.01.030"
"publicationInfo" => array:3 [
"pages" => "54-69"
"volume" => "294"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Given a graph G and an interdiction budget k, the Edge Interdiction Clique Problem (EICP) asks to find a subset of at most k edges to remove from G so that the size of the maximum clique, in the interdicted graph, is minimized. The EICP belongs to the family of interdiction problems with the aim of reducing the clique number of the graph. The EICP optimal solutions, called optimal interdiction policies, determine the subset of most vital edges of a graph which are crucial for preserving its clique number. We propose a new set-covering-based Integer Linear Programming (ILP) formulation for the EICP with an exponential number of constraints, called the clique-covering inequalities. We design a new branch-and-cut algorithm which is enhanced by a tailored separation procedure and by an effective heuristic initialization phase. Thanks to the new exact algorithm, we manage to solve the EICP in several sets of instances from the literature. Extensive tests show that the new exact algorithm greatly outperforms the state-of-the-art approaches for the EICP.
Given a graph G and an interdiction budget k, the Edge Interdiction Clique Problem (EICP) asks to fi
"
"en" => "Given a graph G and an interdiction budget k, the Edge Interdiction Clique Problem (EICP) asks to find a subset of at most k edges to remove from G so that the size of the maximum clique, in the interdicted graph, is minimized. The EICP belongs to the family of interdiction problems with the aim of reducing the clique number of the graph. The EICP optimal solutions, called optimal interdiction policies, determine the subset of most vital edges of a graph which are crucial for preserving its clique number. We propose a new set-covering-based Integer Linear Programming (ILP) formulation for the EICP with an exponential number of constraints, called the clique-covering inequalities. We design a new branch-and-cut algorithm which is enhanced by a tailored separation procedure and by an effective heuristic initialization phase. Thanks to the new exact algorithm, we manage to solve the EICP in several sets of instances from the literature. Extensive tests show that the new exact algorithm greatly outperforms the state-of-the-art approaches for the EICP.
Given a graph G and an interdiction budget k, the Edge Interdiction Clique Problem (EICP) asks to fi
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
108 => Essec\Faculty\Model\Contribution {#2470
#_index: "academ_contributions"
#_id: "12599"
#_source: array:18 [
"id" => "12599"
"slug" => "benders-decomposition-for-a-node-capacitated-virtual-network-function-placement-and-routing-problem"
"yearMonth" => "2021-06"
"year" => "2021"
"title" => "Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem"
"description" => "LJUBIC, I., MOUACI, A., PERROT, N. et GOURDIN, E. (2021). Benders decomposition for a node-capacitated Virtual Network Function placement and routing problem. <i>Computers & Operations Research</i>, 130(105227).
LJUBIC, I., MOUACI, A., PERROT, N. et GOURDIN, E. (2021). Benders decomposition for a node-capacitat
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "MOUACI Ahlam"
]
2 => array:1 [
"name" => "PERROT Nancy"
]
3 => array:1 [
"name" => "GOURDIN Eric"
]
]
"ouvrage" => ""
"keywords" => array:6 [
0 => "Combinatorial optimization"
1 => "Benders decomposition"
2 => "Software defined networking"
3 => "Network Function"
4 => "Virtualization"
5 => "Service function chaining"
]
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "https://doi.org/10.1016/j.cor.2021.105227"
"publicationInfo" => array:3 [
"pages" => null
"volume" => "130"
"number" => "105227"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In this paper we study a problem faced by network service providers in which a set of Virtual Network Functions (VNFs) has to be installed in a telecommunication network at minimum cost. For each given origin-destination pair of nodes (commodities), a latency-constrained routing path has to be found that visits the required VNFs in a pre-defined order. A limited number of functions can be installed at each node. We first prove that the problem is NP-hard in a strong sense, even for a single commodity and without node-capacity, latency and precedence constraints. We then provide a compact Mixed Integer Linear Programming (MILP) formulation, along with several families of valid inequalities. To tackle the problem from a computational perspective, we provide theoretical results that allow us to derive Benders reformulation of the problem. We also exploit an alternative path-based MILP formulation to derive heuristic solutions. All these ingredients are combined in a Branch-and-Benders-Cut framework and computationally tested on a wide range of realistic instances. Our results are also compared with the Automatic Benders decomposition provided by Cplex. Computational results indicate that our decomposition approach is more efficient compared to the two methods provided by the off-the-shelf solver, both in terms of the CPU time and the overall solution quality. The results also indicate that our MILP-heuristic provides high-quality solutions.
In this paper we study a problem faced by network service providers in which a set of Virtual Networ
"
"en" => "In this paper we study a problem faced by network service providers in which a set of Virtual Network Functions (VNFs) has to be installed in a telecommunication network at minimum cost. For each given origin-destination pair of nodes (commodities), a latency-constrained routing path has to be found that visits the required VNFs in a pre-defined order. A limited number of functions can be installed at each node. We first prove that the problem is NP-hard in a strong sense, even for a single commodity and without node-capacity, latency and precedence constraints. We then provide a compact Mixed Integer Linear Programming (MILP) formulation, along with several families of valid inequalities. To tackle the problem from a computational perspective, we provide theoretical results that allow us to derive Benders reformulation of the problem. We also exploit an alternative path-based MILP formulation to derive heuristic solutions. All these ingredients are combined in a Branch-and-Benders-Cut framework and computationally tested on a wide range of realistic instances. Our results are also compared with the Automatic Benders decomposition provided by Cplex. Computational results indicate that our decomposition approach is more efficient compared to the two methods provided by the off-the-shelf solver, both in terms of the CPU time and the overall solution quality. The results also indicate that our MILP-heuristic provides high-quality solutions.
In this paper we study a problem faced by network service providers in which a set of Virtual Networ
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
109 => Essec\Faculty\Model\Contribution {#2471
#_index: "academ_contributions"
#_id: "12600"
#_source: array:18 [
"id" => "12600"
"slug" => "a-tailored-benders-decomposition-approach-for-last-mile-delivery-with-autonomous-robots"
"yearMonth" => "2022-06"
"year" => "2022"
"title" => "A tailored Benders decomposition approach for last-mile delivery with autonomous robots"
"description" => "ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2022). A tailored Benders decomposition approach for last-mile delivery with autonomous robots. <i>European Journal of Operational Research</i>, 299(2), pp. 510-525.
ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2022). A tailored Benders decomposition approach
"
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "DE MELO DA SILVA Marco"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Integer Programming"
1 => "Last-mile delivery"
2 => "Self-driving robots"
3 => "Benders decomposition"
]
"updatedAt" => "2022-06-03 10:49:33"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2021.06.048"
"publicationInfo" => array:3 [
"pages" => "510-525"
"volume" => "299"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "This work addresses an operational problem of a logistics service provider that consists of finding an optimal route for a vehicle carrying customer parcels from a central depot to selected facilities, from where autonomous devices like robots are launched to perform last-mile deliveries. The objective is to minimize a tardiness indicator based on the customer delivery deadlines. This article provides a better understanding of how three major tardiness indicators can be used to improve the quality of service by minimizing the maximum tardiness, the total tardiness, or the number of late deliveries. We study the problem complexity, devise a unifying Mixed Integer Programming formulation and propose an efficient branch-and-Benders-cut scheme to deal with instances of realistic size. Numerical results show that this novel Benders approach with a tailored combinatorial algorithm for generating Benders cuts largely outperforms all other alternatives. In our managerial study, we vary the number of available facilities, the coverage radius of autonomous robots and their speed, to assess their impact on the quality of service and environmental costs.
This work addresses an operational problem of a logistics service provider that consists of finding
"
"en" => "This work addresses an operational problem of a logistics service provider that consists of finding an optimal route for a vehicle carrying customer parcels from a central depot to selected facilities, from where autonomous devices like robots are launched to perform last-mile deliveries. The objective is to minimize a tardiness indicator based on the customer delivery deadlines. This article provides a better understanding of how three major tardiness indicators can be used to improve the quality of service by minimizing the maximum tardiness, the total tardiness, or the number of late deliveries. We study the problem complexity, devise a unifying Mixed Integer Programming formulation and propose an efficient branch-and-Benders-cut scheme to deal with instances of realistic size. Numerical results show that this novel Benders approach with a tailored combinatorial algorithm for generating Benders cuts largely outperforms all other alternatives. In our managerial study, we vary the number of available facilities, the coverage radius of autonomous robots and their speed, to assess their impact on the quality of service and environmental costs.
This work addresses an operational problem of a logistics service provider that consists of finding
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
110 => Essec\Faculty\Model\Contribution {#2472
#_index: "academ_contributions"
#_id: "12715"
#_source: array:18 [
"id" => "12715"
"slug" => "budgeting-in-international-humanitarian-organizations"
"yearMonth" => "2022-06"
"year" => "2022"
"title" => "Budgeting in International Humanitarian Organizations"
"description" => "KESHVARI FARD, M., LJUBIC, I. et PAPIER, F. (2022). Budgeting in International Humanitarian Organizations. <i>Manufacturing & Service Operations Management</i>, 24(3), pp. 1562-1577.
KESHVARI FARD, M., LJUBIC, I. et PAPIER, F. (2022). Budgeting in International Humanitarian Organiza
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:3 [
"name" => "PAPIER Felix"
"bid" => "B00325218"
"slug" => "papier-felix"
]
2 => array:1 [
"name" => "KESHVARI FARD Milad"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "international humanitarian organization"
1 => "earmarked donations"
2 => "budgeting"
3 => "nonlinear stochastic programming"
4 => "generalized Benders decomposition"
]
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://pubsonline.informs.org/doi/abs/10.1287/msom.2021.1016"
"publicationInfo" => array:3 [
"pages" => "1562-1577"
"volume" => "24"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "International humanitarian organizations (IHOs) prepare a detailed annual allocation plan for operations that are conducted in the countries they serve. The annual plan is strongly affected by the available financial budget. The budget of IHOs is derived from donations, which are typically limited, uncertain, and to a large extent earmarked for specific countries or programs. These factors, together with the specific utility function of IHOs, render budgeting for IHOs a challenging managerial problem. In this paper, we develop an approach to optimize budget allocation plans for each country of operations. Academic/practical relevance: The current research provides a better understanding of the budgeting problem in IHOs given the increasing interest of the operations management community for nonprofit operations.
International humanitarian organizations (IHOs) prepare a detailed annual allocation plan for operat
"
"en" => "International humanitarian organizations (IHOs) prepare a detailed annual allocation plan for operations that are conducted in the countries they serve. The annual plan is strongly affected by the available financial budget. The budget of IHOs is derived from donations, which are typically limited, uncertain, and to a large extent earmarked for specific countries or programs. These factors, together with the specific utility function of IHOs, render budgeting for IHOs a challenging managerial problem. In this paper, we develop an approach to optimize budget allocation plans for each country of operations. Academic/practical relevance: The current research provides a better understanding of the budgeting problem in IHOs given the increasing interest of the operations management community for nonprofit operations.
International humanitarian organizations (IHOs) prepare a detailed annual allocation plan for operat
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
111 => Essec\Faculty\Model\Contribution {#2473
#_index: "academ_contributions"
#_id: "12766"
#_source: array:18 [
"id" => "12766"
"slug" => "comparison-of-formulations-for-the-inventory-routing-problem"
"yearMonth" => "2022-12"
"year" => "2022"
"title" => "Comparison of formulations for the Inventory Routing Problem"
"description" => "ARCHETTI, C. et LJUBIC, I. (2022). Comparison of formulations for the Inventory Routing Problem. <i>European Journal of Operational Research</i>, 303(3), pp. 997-1008.
ARCHETTI, C. et LJUBIC, I. (2022). Comparison of formulations for the Inventory Routing Problem. <i>
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Routing"
1 => "Inventory routing"
2 => "Aggregated formulation"
3 => "Linear programming relaxation"
4 => "Polyhedral projection"
]
"updatedAt" => "2023-03-15 12:09:09"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2021.12.051"
"publicationInfo" => array:3 [
"pages" => "997-1008"
"volume" => "303"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In this paper we propose an analysis and comparison of the strength of the lower bound, measured as the value of the linear programming relaxation, of different formulations for the Inventory Routing Problem (IRP). In particular, we first focus on aggregated formulations, i.e., formulations where variables have no index associated with vehicles, and we analyse the link between compact formulations and their counterparts involving exponentially many constraints. We show that they are equivalent in terms of value of the linear relaxation. In addition, we study the link between aggregated and disaggregated formulations, i.e., formulations where variables have an index related to vehicles. Also in this case, we show that aggregated and disaggregated formulations are equivalent in terms of the value of the corresponding linear relaxation. To the best of our knowledge, this analysis has never been done for the IRP, which instead is gaining a lot of popularity in the literature. Finally, we propose different exact solution approaches based on the aggregated formulations and we compare them with state-of-the-art exact methods for the IRP. Results show that the approaches based on aggregated formulations are competitive in terms of quality of both upper and lower bounds.
In this paper we propose an analysis and comparison of the strength of the lower bound, measured as
"
"en" => "In this paper we propose an analysis and comparison of the strength of the lower bound, measured as the value of the linear programming relaxation, of different formulations for the Inventory Routing Problem (IRP). In particular, we first focus on aggregated formulations, i.e., formulations where variables have no index associated with vehicles, and we analyse the link between compact formulations and their counterparts involving exponentially many constraints. We show that they are equivalent in terms of value of the linear relaxation. In addition, we study the link between aggregated and disaggregated formulations, i.e., formulations where variables have an index related to vehicles. Also in this case, we show that aggregated and disaggregated formulations are equivalent in terms of the value of the corresponding linear relaxation. To the best of our knowledge, this analysis has never been done for the IRP, which instead is gaining a lot of popularity in the literature. Finally, we propose different exact solution approaches based on the aggregated formulations and we compare them with state-of-the-art exact methods for the IRP. Results show that the approaches based on aggregated formulations are competitive in terms of quality of both upper and lower bounds.
In this paper we propose an analysis and comparison of the strength of the lower bound, measured as
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
112 => Essec\Faculty\Model\Contribution {#2474
#_index: "academ_contributions"
#_id: "13227"
#_source: array:18 [
"id" => "13227"
"slug" => "freight-on-transit-for-urban-last-mile-deliveries-a-strategic-planning-approach"
"yearMonth" => "2022-05"
"year" => "2022"
"title" => "Freight-on-Transit for urban last-mile deliveries: A Strategic Planning Approach"
"description" => "DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2022). Freight-on-Transit for urban last-mile deliveries: A Strategic Planning Approach. Dans: International Workshop on Freight Transportation and Logistics (ODYSSEUS). Tanger.
DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2022). Freight-on-Transit for urban last
"
"authors" => array:4 [
0 => array:3 [
"name" => "DELLE DONNE Diego"
"bid" => "B00788133"
"slug" => "delle-donne-diego"
]
1 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
3 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => "International Workshop on Freight Transportation and Logistics (ODYSSEUS)"
"keywords" => []
"updatedAt" => "2023-01-27 01:00:45"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
113 => Essec\Faculty\Model\Contribution {#2475
#_index: "academ_contributions"
#_id: "13230"
#_source: array:18 [
"id" => "13230"
"slug" => "freight-on-public-transport-strategical-decision-making-with-mixed-integer-programming"
"yearMonth" => "2021-07"
"year" => "2021"
"title" => "Freight on Public Transport: Strategical decision making with mixed integer programming"
"description" => "DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2021). Freight on Public Transport: Strategical decision making with mixed integer programming. Dans: European Conference on Operational Research (EURO). Athens.
DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2021). Freight on Public Transport: Stra
"
"authors" => array:4 [
0 => array:3 [
"name" => "DELLE DONNE Diego"
"bid" => "B00788133"
"slug" => "delle-donne-diego"
]
1 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
3 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => "European Conference on Operational Research (EURO)"
"keywords" => []
"updatedAt" => "2023-01-27 01:00:45"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
114 => Essec\Faculty\Model\Contribution {#2476
#_index: "academ_contributions"
#_id: "13237"
#_source: array:18 [
"id" => "13237"
"slug" => "freight-on-transit-for-urban-last-mile-deliveries-a-strategic-planning-approach"
"yearMonth" => "2022-06"
"year" => "2022"
"title" => "Freight-on-Transit for urban last-mile deliveries: A Strategic Planning Approach"
"description" => "DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2022). Freight-on-Transit for urban last-mile deliveries: A Strategic Planning Approach. Dans: Spanish Conference on Statistics and Operations Research (SEIO). Granada.
DELLE DONNE, D., ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2022). Freight-on-Transit for urban last
"
"authors" => array:4 [
0 => array:3 [
"name" => "DELLE DONNE Diego"
"bid" => "B00788133"
"slug" => "delle-donne-diego"
]
1 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
3 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => "Spanish Conference on Statistics and Operations Research (SEIO)"
"keywords" => []
"updatedAt" => "2023-07-20 12:06:05"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
115 => Essec\Faculty\Model\Contribution {#2477
#_index: "academ_contributions"
#_id: "13242"
#_source: array:18 [
"id" => "13242"
"slug" => "a-survey-on-mixed-integer-programming-techniques-in-bilevel-optimization"
"yearMonth" => "2021-07"
"year" => "2021"
"title" => "A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization"
"description" => "KLEINERT, T., LABBÉ, M., LJUBIC, I. et SCHMIDT, M. (2021). A Survey on Mixed-Integer Programming Techniques in Bilevel Optimization. <i>European Journal on Computational Optimization</i>, 9, pp. 100007.
KLEINERT, T., LABBÉ, M., LJUBIC, I. et SCHMIDT, M. (2021). A Survey on Mixed-Integer Programming Tec
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "KLEINERT Thomas"
]
2 => array:1 [
"name" => "LABBÉ Martine"
]
3 => array:1 [
"name" => "SCHMIDT Martin"
]
]
"ouvrage" => ""
"keywords" => array:6 [
0 => "Bilevel optimization"
1 => "Mixed-integer programming"
2 => "Applications"
3 => "Branch-and-bound"
4 => "Branch-and-cut"
5 => "Survey"
]
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://doi.org/10.1016/j.ejco.2021.100007"
"publicationInfo" => array:3 [
"pages" => "100007"
"volume" => "9"
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue professionnelle"
"en" => "Professional journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
We survey mixed-integer programming techniques as they are applied in bilevel optimization.\n
We focus on bilevel problems with convex or linear lower-level problems as well as on problems with mixed-integer lower levels.\n
We focus on bilevel problems with convex or linear lower-level problems as well as on problems with
Special attention is given to bilevel pricing problems, Stackelberg games, and interdiction problems.\n
Special attention is given to bilevel pricing problems, Stackelberg games, and interdiction problems
The survey contains more than 250 references.
"""
"en" => """
We survey mixed-integer programming techniques as they are applied in bilevel optimization.\n
We focus on bilevel problems with convex or linear lower-level problems as well as on problems with mixed-integer lower levels.\n
We focus on bilevel problems with convex or linear lower-level problems as well as on problems with
Special attention is given to bilevel pricing problems, Stackelberg games, and interdiction problems.\n
Special attention is given to bilevel pricing problems, Stackelberg games, and interdiction problems
The survey contains more than 250 references.
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
116 => Essec\Faculty\Model\Contribution {#2478
#_index: "academ_contributions"
#_id: "13243"
#_source: array:18 [
"id" => "13243"
"slug" => "arc-routing-with-electric-vehicles-dynamic-charging-and-speed-dependent-energy-consumption"
"yearMonth" => "2022-09"
"year" => "2022"
"title" => "Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption"
"description" => "FERNÁNDEZ, E., LEITNER, M., LJUBIC, I. et RUTHMAIR, M. (2022). Arc Routing with Electric Vehicles: Dynamic Charging and Speed-Dependent Energy Consumption. <i>Transportation Science</i>, 56(5), pp. 1111-1408.
FERNÁNDEZ, E., LEITNER, M., LJUBIC, I. et RUTHMAIR, M. (2022). Arc Routing with Electric Vehicles: D
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FERNÁNDEZ Elena"
]
2 => array:1 [
"name" => "LEITNER M."
]
3 => array:1 [
"name" => "RUTHMAIR Mario"
]
]
"ouvrage" => ""
"keywords" => array:7 [
0 => "arc routing"
1 => "branch-and-cut"
2 => "electric vehicles"
3 => "heuristics"
4 => "integer programming"
5 => "non-linear charging"
6 => "speed-dependent energy consumption"
]
"updatedAt" => "2023-01-27 01:00:45"
"publicationUrl" => "https://doi.org/10.1287/trsc.2022.1126"
"publicationInfo" => array:3 [
"pages" => "1111-1408"
"volume" => "56"
"number" => "5"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Concerns about greenhouse gas emissions and government regulations foster the use of electric vehicles. Several recently published articles study the use of electric vehicles (EVs) in node-routing problems. In contrast, this article considers EVs in the context of arc routing while also addressing practically relevant aspects that have not been addressed sufficiently so far. These include dynamic charging of EVs while driving, speed-dependent energy consumption, and nonlinear charging functions that depend on the battery’s state of charge and the charging time. A generic way of dealing with these aspects is introduced through the concept of an energy-indexed graph, which is used to derive an integer linear programming formulation and a solution framework based on branch and cut. Efficient construction heuristics and a local search for approximately solving large-scale instances are proposed. A computational study is performed on realistic problem instances. Besides analyzing the performance of all proposed methods, the obtained results also provide insights into strategic decisions related to the battery size and the amount of charging facilities.
Concerns about greenhouse gas emissions and government regulations foster the use of electric vehicl
"
"en" => "Concerns about greenhouse gas emissions and government regulations foster the use of electric vehicles. Several recently published articles study the use of electric vehicles (EVs) in node-routing problems. In contrast, this article considers EVs in the context of arc routing while also addressing practically relevant aspects that have not been addressed sufficiently so far. These include dynamic charging of EVs while driving, speed-dependent energy consumption, and nonlinear charging functions that depend on the battery’s state of charge and the charging time. A generic way of dealing with these aspects is introduced through the concept of an energy-indexed graph, which is used to derive an integer linear programming formulation and a solution framework based on branch and cut. Efficient construction heuristics and a local search for approximately solving large-scale instances are proposed. A computational study is performed on realistic problem instances. Besides analyzing the performance of all proposed methods, the obtained results also provide insights into strategic decisions related to the battery size and the amount of charging facilities.
Concerns about greenhouse gas emissions and government regulations foster the use of electric vehicl
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
117 => Essec\Faculty\Model\Contribution {#2479
#_index: "academ_contributions"
#_id: "13274"
#_source: array:18 [
"id" => "13274"
"slug" => "submodular-maximization-of-concave-utility-functions-composed-with-a-set-union-operator-with-applications-to-maximal-covering-location-problems
submodular-maximization-of-concave-utility-functions-composed-with-a-set-union-operator-with-applica
"
"yearMonth" => "2022-11"
"year" => "2022"
"title" => "Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems
Submodular maximization of concave utility functions composed with a set-union operator with applica
"
"description" => "CONIGLIO, S., FURINI, F. et LJUBIC, I. (2022). Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems. <i>Mathematical Programming</i>, 196(1-2), pp. 9-56.
CONIGLIO, S., FURINI, F. et LJUBIC, I. (2022). Submodular maximization of concave utility functions
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "CONIGLIO Stefano"
]
2 => array:1 [
"name" => "FURINI Fabio"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Submodular maximization"
1 => "Branch-and-Cut"
2 => "Benders decomposition"
3 => "Stochastic maximal covering location problems"
4 => "Influence maximization"
]
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://doi.org/10.1007/s10107-022-01884-7"
"publicationInfo" => array:3 [
"pages" => "9-56"
"volume" => "196"
"number" => "1-2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We study a family of discrete optimization problems asking for the maximization of the expected value of a concave, strictly increasing, and differentiable function composed with a set-union operator. The expected value is computed with respect to a set of coefficients taking values from a discrete set of scenarios. The function models the utility function of the decision maker, while the set-union operator models a covering relationship between two ground sets, a set of items and a set of metaitems. This problem generalizes the problem introduced by Ahmed S, Atamtürk A (Mathematical programming 128(1-2):149–169, 2011), and it can be modeled as a mixed integer nonlinear program involving binary decision variables associated with the items and metaitems. Its goal is to find a subset of metaitems that maximizes the total utility corresponding to the items it covers.
We study a family of discrete optimization problems asking for the maximization of the expected valu
"
"en" => "We study a family of discrete optimization problems asking for the maximization of the expected value of a concave, strictly increasing, and differentiable function composed with a set-union operator. The expected value is computed with respect to a set of coefficients taking values from a discrete set of scenarios. The function models the utility function of the decision maker, while the set-union operator models a covering relationship between two ground sets, a set of items and a set of metaitems. This problem generalizes the problem introduced by Ahmed S, Atamtürk A (Mathematical programming 128(1-2):149–169, 2011), and it can be modeled as a mixed integer nonlinear program involving binary decision variables associated with the items and metaitems. Its goal is to find a subset of metaitems that maximizes the total utility corresponding to the items it covers.
We study a family of discrete optimization problems asking for the maximization of the expected valu
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
118 => Essec\Faculty\Model\Contribution {#2480
#_index: "academ_contributions"
#_id: "13315"
#_source: array:18 [
"id" => "13315"
"slug" => "plenary-speaker-mixed-integer-bilevel-optimization"
"yearMonth" => "2021-07"
"year" => "2021"
"title" => "[Plenary Speaker] Mixed Integer Bilevel Optimization"
"description" => "LJUBIC, I. (2021). [Plenary Speaker] Mixed Integer Bilevel Optimization. Dans: SIAM Conference on Optimization (OP21). Virtual.
LJUBIC, I. (2021). [Plenary Speaker] Mixed Integer Bilevel Optimization. Dans: SIAM Conference on Op
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "SIAM Conference on Optimization (OP21)"
"keywords" => []
"updatedAt" => "2022-11-03 13:29:22"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
In bilevel optimization there are two decision makers, commonly denoted as the leader and the follower. Decisions are made in a hierarchical manner: the leader makes the first move, and then the follower reacts optimally to the leader’s action. It is assumed that the leader can anticipate the decisions of the follower, hence the leader's optimization task is a nested optimization problem that takes into consideration the follower’s response.\n
In bilevel optimization there are two decision makers, commonly denoted as the leader and the follow
\n
In this talk we focus on branch-and-cut algorithms for dealing with mixed-integer bilevel linear programs (MIBLPs). We focus on a subfamily of MIBLPs in which the leader and the follower share a set of items, and the leader can select some of the items to inhibit their usage by the follower. Interdiction Problems, Blocker Problems, and Critical Node/Edge Detection Problems are some examples of optimization problems that satisfy these conditions. We show how modeling of these problems as two-player Stackelberg games leads to integer programming formulations in the natural space of the variables. We also demonstrate how solving these problems using branch-and-cut algorithms often outperforms state-of-the-art methods from literature.
In this talk we focus on branch-and-cut algorithms for dealing with mixed-integer bilevel linear pro
"""
"en" => """
In bilevel optimization there are two decision makers, commonly denoted as the leader and the follower. Decisions are made in a hierarchical manner: the leader makes the first move, and then the follower reacts optimally to the leader’s action. It is assumed that the leader can anticipate the decisions of the follower, hence the leader's optimization task is a nested optimization problem that takes into consideration the follower’s response.\n
In bilevel optimization there are two decision makers, commonly denoted as the leader and the follow
\n
In this talk we focus on branch-and-cut algorithms for dealing with mixed-integer bilevel linear programs (MIBLPs). We focus on a subfamily of MIBLPs in which the leader and the follower share a set of items, and the leader can select some of the items to inhibit their usage by the follower. Interdiction Problems, Blocker Problems, and Critical Node/Edge Detection Problems are some examples of optimization problems that satisfy these conditions. We show how modeling of these problems as two-player Stackelberg games leads to integer programming formulations in the natural space of the variables. We also demonstrate how solving these problems using branch-and-cut algorithms often outperforms state-of-the-art methods from literature.
In this talk we focus on branch-and-cut algorithms for dealing with mixed-integer bilevel linear pro
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
119 => Essec\Faculty\Model\Contribution {#2481
#_index: "academ_contributions"
#_id: "13349"
#_source: array:18 [
"id" => "13349"
"slug" => "an-exact-method-for-binary-fortification-games"
"yearMonth" => "2023-06"
"year" => "2023"
"title" => "An Exact Method for Binary Fortification Games"
"description" => "LEITNER, M., LJUBIC, I., MONACI, M., SINNL, M. et TANINMIS, K. (2023). An Exact Method for Binary Fortification Games. <i>European Journal of Operational Research</i>, 307(3), pp. 1026-1039.
LEITNER, M., LJUBIC, I., MONACI, M., SINNL, M. et TANINMIS, K. (2023). An Exact Method for Binary Fo
"
"authors" => array:5 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER Markus"
]
2 => array:1 [
"name" => "MONACI Michele"
]
3 => array:1 [
"name" => "SINNL Markus"
]
4 => array:1 [
"name" => "TANINMIS Kubra"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Combinatorial Optimization"
1 => "Three-Level Optimization"
2 => "Branch-and-Cut"
3 => "Shortest Path Fortification"
4 => "Maximum Knapsack Fortification"
]
"updatedAt" => "2023-03-09 13:46:33"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2022.10.038"
"publicationInfo" => array:3 [
"pages" => "1026-1039"
"volume" => "307"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "A fortification game (FG) is a three-level, two-player hierarchical game, also known as defender-attacker-defender game, in which at the uppermost level, the defender selects some assets to be protected from potential malicious attacks. At the middle level, the attacker solves an interdiction game by depreciating unprotected assets, i.e., reducing the values of such assets for the defender, while at the innermost level the defender solves a recourse problem over the surviving or partially damaged assets. Fortification games have applications in various important areas, such as military operations, design of survivable networks, protection of facilities or power grid protection. In this work, we present an exact solution algorithm for FGs, in which the recourse problems correspond to (possibly NP-hard) combinatorial optimization problems. The algorithm is based on a new generic mixed-integer linear programming reformulation in the natural space of fortification variables. Our new model makes use of fortification cuts that measure the contribution of a given fortification strategy to the objective function value. These cuts are generated when needed by solving separation problems, which correspond to (modified) middle-level interdiction games. We design a branch-and-cut-based solution algorithm based on fortification cuts, their strengthened versions and other speed-up techniques. We present a computational study using the knapsack fortification game and the shortest path fortification game. For the latter one, we include a comparison with a state-of-the-art solution method from the literature. Our algorithm outperforms this method and allows us to solve previously unsolved instances with up to 330 386 nodes and 1 202 458 arcs to optimality.
A fortification game (FG) is a three-level, two-player hierarchical game, also known as defender-att
"
"en" => "A fortification game (FG) is a three-level, two-player hierarchical game, also known as defender-attacker-defender game, in which at the uppermost level, the defender selects some assets to be protected from potential malicious attacks. At the middle level, the attacker solves an interdiction game by depreciating unprotected assets, i.e., reducing the values of such assets for the defender, while at the innermost level the defender solves a recourse problem over the surviving or partially damaged assets. Fortification games have applications in various important areas, such as military operations, design of survivable networks, protection of facilities or power grid protection. In this work, we present an exact solution algorithm for FGs, in which the recourse problems correspond to (possibly NP-hard) combinatorial optimization problems. The algorithm is based on a new generic mixed-integer linear programming reformulation in the natural space of fortification variables. Our new model makes use of fortification cuts that measure the contribution of a given fortification strategy to the objective function value. These cuts are generated when needed by solving separation problems, which correspond to (modified) middle-level interdiction games. We design a branch-and-cut-based solution algorithm based on fortification cuts, their strengthened versions and other speed-up techniques. We present a computational study using the knapsack fortification game and the shortest path fortification game. For the latter one, we include a comparison with a state-of-the-art solution method from the literature. Our algorithm outperforms this method and allows us to solve previously unsolved instances with up to 330 386 nodes and 1 202 458 arcs to optimality.
A fortification game (FG) is a three-level, two-player hierarchical game, also known as defender-att
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
120 => Essec\Faculty\Model\Contribution {#2482
#_index: "academ_contributions"
#_id: "13713"
#_source: array:18 [
"id" => "13713"
"slug" => "freight-on-transit-for-urban-last-mile-deliveries-a-strategic-planning-approach"
"yearMonth" => "2023-03"
"year" => "2023"
"title" => "Freight-on-Transit for urban last-mile deliveries: A strategic planning approach"
"description" => "DELLE DONNE, D., ARCHETTI, C., ALFANDARI, L. et LJUBIC, I. (2023). Freight-on-Transit for urban last-mile deliveries: A strategic planning approach. <i>Transportation Research Part B: Methodological</i>, 169, pp. 53-81.
DELLE DONNE, D., ARCHETTI, C., ALFANDARI, L. et LJUBIC, I. (2023). Freight-on-Transit for urban last
"
"authors" => array:4 [
0 => array:3 [
"name" => "DELLE DONNE Diego"
"bid" => "B00788133"
"slug" => "delle-donne-diego"
]
1 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
3 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Freight-on-Transit"
1 => "Network flow"
2 => "Column generation"
3 => "Mixed integer linear programming"
]
"updatedAt" => "2023-02-09 01:00:51"
"publicationUrl" => "https://doi.org/10.1016/j.trb.2023.01.004"
"publicationInfo" => array:3 [
"pages" => "53-81"
"volume" => "169"
"number" => ""
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We study a delivery strategy for last-mile deliveries in urban areas which combines freight transportation with mass mobility systems with the goal of creating synergies contrasting negative externalities caused by transportation. The idea is to use the residual capacity on public transport means for moving freight within the city. In particular, the system is such that parcels are first transported from origins (central distribution centers) to drop-in stations, which are stop locations on public vehicle itineraries. Then, they are transported on public vehicles to drop-out stations, from where they are delivered to destination by green vehicles (such as bikes, drones, porters, etc.). The system is known as Freight-On-Transit (FOT). In this paper, we focus on the strategic decisions related to defining the public transportation network that will take part in the delivery system, i.e., which public vehicle lines and stop locations will be included (and thus equipped for the service). We propose different formulations for the problem and effective heuristic solution approaches based on column generation. We perform exhaustive tests aimed at providing managerial insights on the performance and the efficiency of the system.
We study a delivery strategy for last-mile deliveries in urban areas which combines freight transpor
"
"en" => "We study a delivery strategy for last-mile deliveries in urban areas which combines freight transportation with mass mobility systems with the goal of creating synergies contrasting negative externalities caused by transportation. The idea is to use the residual capacity on public transport means for moving freight within the city. In particular, the system is such that parcels are first transported from origins (central distribution centers) to drop-in stations, which are stop locations on public vehicle itineraries. Then, they are transported on public vehicles to drop-out stations, from where they are delivered to destination by green vehicles (such as bikes, drones, porters, etc.). The system is known as Freight-On-Transit (FOT). In this paper, we focus on the strategic decisions related to defining the public transportation network that will take part in the delivery system, i.e., which public vehicle lines and stop locations will be included (and thus equipped for the service). We propose different formulations for the problem and effective heuristic solution approaches based on column generation. We perform exhaustive tests aimed at providing managerial insights on the performance and the efficiency of the system.
We study a delivery strategy for last-mile deliveries in urban areas which combines freight transpor
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
121 => Essec\Faculty\Model\Contribution {#2483
#_index: "academ_contributions"
#_id: "13811"
#_source: array:18 [
"id" => "13811"
"slug" => "a-survey-on-bilevel-optimization-under-uncertainty"
"yearMonth" => "2023-12"
"year" => "2023"
"title" => "A survey on bilevel optimization under uncertainty"
"description" => "BECK, Y., LJUBIC, I. et SCHMIDT, M. (2023). A survey on bilevel optimization under uncertainty. <i>European Journal of Operational Research</i>, 311(2), pp. 401-426.
BECK, Y., LJUBIC, I. et SCHMIDT, M. (2023). A survey on bilevel optimization under uncertainty. <i>E
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "BECK Yasmine"
]
2 => array:1 [
"name" => "SCHMIDT Martin"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "(R) uncertainty modeling"
1 => "Bilevel optimization"
2 => "Optimization under uncertainty"
3 => "Bounded rationality"
4 => "Survey"
]
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2023.01.008"
"publicationInfo" => array:3 [
"pages" => "401-426"
"volume" => "311"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Bilevel optimization is a very active field of applied mathematics. The main reason is that bilevel optimization problems can serve as a powerful tool for modeling hierarchical decision making processes. This ability, however, also makes the resulting problems challenging to solve—both in theory and practice. Fortunately, there have been significant algorithmic advances in the field of bilevel optimization so that we can solve much larger and also more complicated problems today compared to what was possible to solve two decades ago. This results in more and more challenging bilevel problems that researchers try to solve today. This survey gives a detailed overview of one of these more challenging classes of bilevel problems: bilevel optimization under uncertainty. We review the classic ways of addressing uncertainties in bilevel optimization using stochastic or robust techniques. Moreover, we highlight that the sources of uncertainty in bilevel optimization are much richer than for usual, i.e., single-level, problems since not only the problem’s data can be uncertain but also the (observation of the) decisions of the two players can be subject to uncertainty. We thus also review the field of bilevel optimization under limited observability, the area of problems considering only near-optimal decisions, and discuss intermediate solution concepts between the optimistic and pessimistic cases. Finally, we also review the rich literature on applications studied using uncertain bilevel problems such as in energy, for interdiction games and security applications, in management sciences, and networks.
Bilevel optimization is a very active field of applied mathematics. The main reason is that bilevel
"
"en" => "Bilevel optimization is a very active field of applied mathematics. The main reason is that bilevel optimization problems can serve as a powerful tool for modeling hierarchical decision making processes. This ability, however, also makes the resulting problems challenging to solve—both in theory and practice. Fortunately, there have been significant algorithmic advances in the field of bilevel optimization so that we can solve much larger and also more complicated problems today compared to what was possible to solve two decades ago. This results in more and more challenging bilevel problems that researchers try to solve today. This survey gives a detailed overview of one of these more challenging classes of bilevel problems: bilevel optimization under uncertainty. We review the classic ways of addressing uncertainties in bilevel optimization using stochastic or robust techniques. Moreover, we highlight that the sources of uncertainty in bilevel optimization are much richer than for usual, i.e., single-level, problems since not only the problem’s data can be uncertain but also the (observation of the) decisions of the two players can be subject to uncertainty. We thus also review the field of bilevel optimization under limited observability, the area of problems considering only near-optimal decisions, and discuss intermediate solution concepts between the optimistic and pessimistic cases. Finally, we also review the rich literature on applications studied using uncertain bilevel problems such as in energy, for interdiction games and security applications, in management sciences, and networks.
Bilevel optimization is a very active field of applied mathematics. The main reason is that bilevel
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
122 => Essec\Faculty\Model\Contribution {#2484
#_index: "academ_contributions"
#_id: "13921"
#_source: array:18 [
"id" => "13921"
"slug" => "combinatorial-optimization"
"yearMonth" => "2022-11"
"year" => "2022"
"title" => "Combinatorial Optimization"
"description" => "LJUBIC, I., BARAHONA, F., DEY, S.S. et MAHJOUB, A.R. [Eds] (2022). <i>Combinatorial Optimization</i>. New York: Springer.
LJUBIC, I., BARAHONA, F., DEY, S.S. et MAHJOUB, A.R. [Eds] (2022). <i>Combinatorial Optimization</i>
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "BARAHONA Francisco"
]
2 => array:1 [
"name" => "DEY Santanu S."
]
3 => array:1 [
"name" => "MAHJOUB A. Ridha"
]
]
"ouvrage" => ""
"keywords" => array:17 [
0 => "approximation algorithms"
1 => "approximation theory"
2 => "artificial intelligence"
3 => "combinatorial mathematics"
4 => "combinatorial optimization"
5 => "combinatorial problems"
6 => "computer networks"
7 => "graph theory"
8 => "integer programming"
9 => "mathematics"
10 => "network optimization"
11 => "network protocols"
12 => "optimization"
13 => "polynomial approximation"
14 => "scheduling problems"
15 => "signal processing"
16 => "telecommunication systems -"
]
"updatedAt" => "2023-03-23 08:30:13"
"publicationUrl" => "https://link.springer.com/book/10.1007/978-3-031-18530-4"
"publicationInfo" => array:3 [
"pages" => ""
"volume" => "LNCS, 13526"
"number" => ""
]
"type" => array:2 [
"fr" => "Direction d'ouvrage"
"en" => "Book editor"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
This book constitutes thoroughly refereed and revised selected papers from the 7th International Symposium on Combinatorial Optimization, ISCO 2022, which was held online during May 18–20, 2022.\n
This book constitutes thoroughly refereed and revised selected papers from the 7th International Sym
The 24 full papers included in this book were carefully reviewed and selected from 50 submissions. They were organized in topical sections as follows: Polyhedra and algorithms; polyhedra and combinatorics; non-linear optimization; game theory; graphs and trees; cutting and packing; applications; and approximation algorithms.
The 24 full papers included in this book were carefully reviewed and selected from 50 submissions. T
"""
"en" => """
This book constitutes thoroughly refereed and revised selected papers from the 7th International Symposium on Combinatorial Optimization, ISCO 2022, which was held online during May 18–20, 2022.\n
This book constitutes thoroughly refereed and revised selected papers from the 7th International Sym
The 24 full papers included in this book were carefully reviewed and selected from 50 submissions. They were organized in topical sections as follows: Polyhedra and algorithms; polyhedra and combinatorics; non-linear optimization; game theory; graphs and trees; cutting and packing; applications; and approximation algorithms.
The 24 full papers included in this book were carefully reviewed and selected from 50 submissions. T
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
123 => Essec\Faculty\Model\Contribution {#2485
#_index: "academ_contributions"
#_id: "13925"
#_source: array:18 [
"id" => "13925"
"slug" => "preface"
"yearMonth" => "2022-11"
"year" => "2022"
"title" => "Preface"
"description" => "LJUBIC, I., BARAHONA, F., DEY, S.S. et MAHJOUB, A.R. (2022). Preface. Dans: <i>Combinatorial Optimization</i>. 1st ed. Springer, pp. vi.
LJUBIC, I., BARAHONA, F., DEY, S.S. et MAHJOUB, A.R. (2022). Preface. Dans: <i>Combinatorial Optimiz
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "BARAHONA Francisco"
]
2 => array:1 [
"name" => "DEY Santanu S."
]
3 => array:1 [
"name" => "MAHJOUB A. Ridha"
]
]
"ouvrage" => "Combinatorial Optimization"
"keywords" => []
"updatedAt" => "2023-03-23 08:44:37"
"publicationUrl" => "https://link.springer.com/content/pdf/bfm:978-3-031-18530-4/1?pdf=chapter%20toc"
"publicationInfo" => array:3 [
"pages" => "vi"
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Préfaces d'un ouvrage"
"en" => "Prefaces of a book"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Preface to the book with 24 revised selected papers from the 7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022.
Preface to the book with 24 revised selected papers from the 7th International Symposium, ISCO 2022,
"
"en" => "Preface to the book with 24 revised selected papers from the 7th International Symposium, ISCO 2022, Virtual Event, May 18–20, 2022.
Preface to the book with 24 revised selected papers from the 7th International Symposium, ISCO 2022,
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
124 => Essec\Faculty\Model\Contribution {#2486
#_index: "academ_contributions"
#_id: "13966"
#_source: array:18 [
"id" => "13966"
"slug" => "two-extended-formulations-for-the-virtual-network-function-placement-and-routing-problem"
"yearMonth" => "2023-07"
"year" => "2023"
"title" => "Two extended formulations for the virtual network function placement and routing problem"
"description" => "MOUACI, A., GOURDIN, , LJUBIC, I. et PERROT, N. (2023). Two extended formulations for the virtual network function placement and routing problem. <i>Networks</i>, 82(1), pp. 32-51.
MOUACI, A., GOURDIN, , LJUBIC, I. et PERROT, N. (2023). Two extended formulations for the virtual ne
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "MOUACI Ahlam"
]
2 => array:1 [
"name" => "GOURDIN Éric"
]
3 => array:1 [
"name" => "PERROT Nancy"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "branch-and-price"
1 => "column generation"
2 => "network function virtualization"
3 => " networks"
4 => "service functions chaining"
]
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://doi.org/10.1002/net.22144"
"publicationInfo" => array:3 [
"pages" => "32-51"
"volume" => "82"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Given a bi-directed graph modeling a telecommunication network, and a set of origin-destination pairs representing traffic requests (commodities) along with their associated Service Function Chains (SFCs), the Virtual Network Function Placement and Routing Problem (VNFPRP) aims to find, for each commodity, one latency-constrained routing path that visits the required Virtual Network Functions in a specific order. The function installation costs together with the node activation costs have to be minimized. In this paper, we present two extended Mixed Integer Programming (MIP) formulations to model the VNFPRP. For each formulation we define the master problem, the pricing problem, the associated Lagrangian bound and a specific branching scheme, in order to derive an efficient Branch-and-Price algorithm. We also provide several families of valid inequalities to strengthen the LP-relaxation bounds. Computational results are reported comparing the performance of the two Branch-and-Price algorithms with a compact MIP formulation and its Branch-and-Benders-cut implementation on a set of SNDlib instances representing telecommunication networks.
Given a bi-directed graph modeling a telecommunication network, and a set of origin-destination pair
"
"en" => "Given a bi-directed graph modeling a telecommunication network, and a set of origin-destination pairs representing traffic requests (commodities) along with their associated Service Function Chains (SFCs), the Virtual Network Function Placement and Routing Problem (VNFPRP) aims to find, for each commodity, one latency-constrained routing path that visits the required Virtual Network Functions in a specific order. The function installation costs together with the node activation costs have to be minimized. In this paper, we present two extended Mixed Integer Programming (MIP) formulations to model the VNFPRP. For each formulation we define the master problem, the pricing problem, the associated Lagrangian bound and a specific branching scheme, in order to derive an efficient Branch-and-Price algorithm. We also provide several families of valid inequalities to strengthen the LP-relaxation bounds. Computational results are reported comparing the performance of the two Branch-and-Price algorithms with a compact MIP formulation and its Branch-and-Benders-cut implementation on a set of SNDlib instances representing telecommunication networks.
Given a bi-directed graph modeling a telecommunication network, and a set of origin-destination pair
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
125 => Essec\Faculty\Model\Contribution {#2487
#_index: "academ_contributions"
#_id: "13981"
#_source: array:18 [
"id" => "13981"
"slug" => "mathematical-programming-formulations-for-the-collapsed-k-core-problem"
"yearMonth" => "2023-11"
"year" => "2023"
"title" => "Mathematical programming formulations for the collapsed k-core problem"
"description" => "CERULLI, M., SERRA, D., SORGENTE, C., ARCHETTI, C. et LJUBIC, I. (2023). Mathematical programming formulations for the collapsed k-core problem. <i>European Journal of Operational Research</i>, 311(1), pp. 56-72.
CERULLI, M., SERRA, D., SORGENTE, C., ARCHETTI, C. et LJUBIC, I. (2023). Mathematical programming fo
"
"authors" => array:5 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "CERULLI Martina"
]
2 => array:1 [
"name" => "SERRA Domenico"
]
3 => array:1 [
"name" => "SORGENTE Carmine"
]
4 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "(O) combinatorial optimization"
1 => "Bilevel optimization"
2 => "Social networks"
3 => "k-Core"
]
"updatedAt" => "2025-02-13 14:04:30"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2023.04.038"
"publicationInfo" => array:3 [
"pages" => "56-72"
"volume" => "311"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In social network analysis, the size of the k-core, i.e., the maximal induced subgraph of the network with minimum degree at least k, is frequently adopted as a typical metric to evaluate the cohesiveness of a community. We address the Collapsed k-Core Problem, which seeks to find a subset of k users, namely the most critical users of the network, the removal of which results in the smallest possible k-core. For the first time, both the problem of finding the k-core of a network and the Collapsed k-Core Problem are formulated using mathematical programming. On the one hand, we model the Collapsed k-Core Problem as a natural deletion-round-indexed Integer Linear formulation. On the other hand, we provide two bilevel programs for the problem, which differ in the way in which the k-core identification problem is formulated at the lower level. The first bilevel formulation is reformulated as a single-level sparse model, exploiting a Benders-like decomposition approach. To derive the second bilevel model, we provide a linear formulation for finding the k-core and use it to state the lower-level problem. We then dualize the lower level and obtain a compact Mixed-Integer Nonlinear single-level problem reformulation. We additionally derive a combinatorial lower bound on the value of the optimal solution and describe some pre-processing procedures, and valid inequalities for the three formulations. The performance of the proposed formulations is compared on a set of benchmarking instances with the existing state-of-the-art solver for mixed-integer bilevel problems proposed in (Fischetti, Ljubić, Monaci, and Sinnl, 2017).
In social network analysis, the size of the k-core, i.e., the maximal induced subgraph of the networ
"
"en" => "In social network analysis, the size of the k-core, i.e., the maximal induced subgraph of the network with minimum degree at least k, is frequently adopted as a typical metric to evaluate the cohesiveness of a community. We address the Collapsed k-Core Problem, which seeks to find a subset of k users, namely the most critical users of the network, the removal of which results in the smallest possible k-core. For the first time, both the problem of finding the k-core of a network and the Collapsed k-Core Problem are formulated using mathematical programming. On the one hand, we model the Collapsed k-Core Problem as a natural deletion-round-indexed Integer Linear formulation. On the other hand, we provide two bilevel programs for the problem, which differ in the way in which the k-core identification problem is formulated at the lower level. The first bilevel formulation is reformulated as a single-level sparse model, exploiting a Benders-like decomposition approach. To derive the second bilevel model, we provide a linear formulation for finding the k-core and use it to state the lower-level problem. We then dualize the lower level and obtain a compact Mixed-Integer Nonlinear single-level problem reformulation. We additionally derive a combinatorial lower bound on the value of the optimal solution and describe some pre-processing procedures, and valid inequalities for the three formulations. The performance of the proposed formulations is compared on a set of benchmarking instances with the existing state-of-the-art solver for mixed-integer bilevel problems proposed in (Fischetti, Ljubić, Monaci, and Sinnl, 2017).
In social network analysis, the size of the k-core, i.e., the maximal induced subgraph of the networ
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
126 => Essec\Faculty\Model\Contribution {#2488
#_index: "academ_contributions"
#_id: "14009"
#_source: array:18 [
"id" => "14009"
"slug" => "a-bilevel-pricing-and-routing-problem"
"yearMonth" => "2023-02"
"year" => "2023"
"title" => "A bilevel pricing and routing problem"
"description" => "ARCHETTI, C., CERULLI, M., FERNÁNDEZ, E. et LJUBIC, I. (2023). A bilevel pricing and routing problem. Dans: 24ème Congrès Annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2023). Rennes.
ARCHETTI, C., CERULLI, M., FERNÁNDEZ, E. et LJUBIC, I. (2023). A bilevel pricing and routing problem
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ARCHETTI Claudia"
]
2 => array:1 [
"name" => "CERULLI Martina"
]
3 => array:1 [
"name" => "FERNÁNDEZ Elena"
]
]
"ouvrage" => "24ème Congrès Annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2023)
24ème Congrès Annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (RO
"
"keywords" => []
"updatedAt" => "2023-11-29 15:33:03"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
127 => Essec\Faculty\Model\Contribution {#2489
#_index: "academ_contributions"
#_id: "14031"
#_source: array:18 [
"id" => "14031"
"slug" => "on-socp-based-disjunctive-cuts-for-solving-a-class-of-integer-bilevel-nonlinear-programs"
"yearMonth" => "2022-11"
"year" => "2022"
"title" => "On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs"
"description" => "GAAR, E., LEE, J., LJUBIC, I., SINNI, M. et TANINMIS, K. (2022). On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. Dans: 2023 Optimization at the Second Level. Dagstuhl.
GAAR, E., LEE, J., LJUBIC, I., SINNI, M. et TANINMIS, K. (2022). On SOCP-based disjunctive cuts for
"
"authors" => array:5 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GAAR Elisabeth"
]
2 => array:1 [
"name" => "LEE Jon"
]
3 => array:1 [
"name" => "SINNI Markus"
]
4 => array:1 [
"name" => "TANINMIS Kubra"
]
]
"ouvrage" => "2023 Optimization at the Second Level"
"keywords" => []
"updatedAt" => "2025-02-13 17:00:05"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
128 => Essec\Faculty\Model\Contribution {#2490
#_index: "academ_contributions"
#_id: "14069"
#_source: array:18 [
"id" => "14069"
"slug" => "virtual-network-functions-placement-and-routing-problem-path-formulation"
"yearMonth" => "2020-06"
"year" => "2020"
"title" => "Virtual Network Functions Placement and Routing Problem: Path formulation"
"description" => "MOUACI, A., LJUBIC, I., GOURDIN, E. et PERROT, N. (2020). Virtual Network Functions Placement and Routing Problem: Path formulation. Dans: <i>2020 IFIP Networking Conference (Networking)</i>. IEEE Xplore, pp. 55-63.
MOUACI, A., LJUBIC, I., GOURDIN, E. et PERROT, N. (2020). Virtual Network Functions Placement and Ro
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "MOUACI Ahlam"
]
2 => array:1 [
"name" => "GOURDIN Eric"
]
3 => array:1 [
"name" => "PERROT Nancy"
]
]
"ouvrage" => "2020 IFIP Networking Conference (Networking)"
"keywords" => []
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://ieeexplore.ieee.org/document/9142789"
"publicationInfo" => array:3 [
"pages" => "55-63"
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Network Functions Virtualization (NFV) and Software Defined Networking (SDN) are two promising techniques for the next generation telecommunication networks. Their introduction allows time, energy and cost minimization. Placing Virtual Network Functions (VNFs) on network nodes and routing data through these nodes is a very challenging combinatorial optimization problem. Obviously, the problem becomes even more difficult, if in addition, the data have to be routed using the concept of Service Functions Chaining (SFC) in which VNFs are chained according to a pre-defined order associated to each service.In this paper we study the Virtual Network Functions Placement and Routing problem in Software Defined Networks, in which a set of source-destination pairs representing clients demand and a set of VNFs are given. The problem consists in finding a routing path for each demand and the optimal associated placement of functions while minimizing functions installation and node activation costs. In this work, we propose a path-based MILP formulation to model the problem and we also demonstrate how to efficiently use it to derive high-quality heuristic solutions within a short computational time. We provide a case study derived from a set of scenarios in which we vary relevant problem parameters, including arc latency, input demand and node capacities. The study is conducted on a benchmark set of realistic telecommunication instances from the SNDlib library. To test the efficiency of our approach, we also compare the obtained results with a compact MILP formulation. Our computational study indicates that the path-based formulation outperforms the compact model both in terms of computing time and overall solution quality.
Network Functions Virtualization (NFV) and Software Defined Networking (SDN) are two promising techn
"
"en" => "Network Functions Virtualization (NFV) and Software Defined Networking (SDN) are two promising techniques for the next generation telecommunication networks. Their introduction allows time, energy and cost minimization. Placing Virtual Network Functions (VNFs) on network nodes and routing data through these nodes is a very challenging combinatorial optimization problem. Obviously, the problem becomes even more difficult, if in addition, the data have to be routed using the concept of Service Functions Chaining (SFC) in which VNFs are chained according to a pre-defined order associated to each service.In this paper we study the Virtual Network Functions Placement and Routing problem in Software Defined Networks, in which a set of source-destination pairs representing clients demand and a set of VNFs are given. The problem consists in finding a routing path for each demand and the optimal associated placement of functions while minimizing functions installation and node activation costs. In this work, we propose a path-based MILP formulation to model the problem and we also demonstrate how to efficiently use it to derive high-quality heuristic solutions within a short computational time. We provide a case study derived from a set of scenarios in which we vary relevant problem parameters, including arc latency, input demand and node capacities. The study is conducted on a benchmark set of realistic telecommunication instances from the SNDlib library. To test the efficiency of our approach, we also compare the obtained results with a compact MILP formulation. Our computational study indicates that the path-based formulation outperforms the compact model both in terms of computing time and overall solution quality.
Network Functions Virtualization (NFV) and Software Defined Networking (SDN) are two promising techn
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
129 => Essec\Faculty\Model\Contribution {#2491
#_index: "academ_contributions"
#_id: "14101"
#_source: array:18 [
"id" => "14101"
"slug" => "benders-adaptive-cuts-method-for-two-stage-stochastic-programs"
"yearMonth" => "2023-09"
"year" => "2023"
"title" => "Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs"
"description" => "RAMIREZ-PICO, C., LJUBIC, I. et MORENO, E. (2023). Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs. <i>Transportation Science</i>, 57(5), pp. 1252-1275.
RAMIREZ-PICO, C., LJUBIC, I. et MORENO, E. (2023). Benders Adaptive-Cuts Method for Two-Stage Stocha
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "RAMIREZ-PICO Cristian"
]
2 => array:1 [
"name" => "MORENO Eduardo"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "two-stage stochastic programming"
1 => "benders decomposition"
2 => "network flow"
3 => "conditional value-at-risk"
4 => "facility location"
]
"updatedAt" => "2024-03-18 11:05:54"
"publicationUrl" => "https://pubsonline.informs.org/doi/10.1287/trsc.2022.0073"
"publicationInfo" => array:3 [
"pages" => "1252-1275"
"volume" => "57"
"number" => "5"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Benders decomposition is one of the most applied methods to solve two-stage stochastic problems (TSSP) with a large number of scenarios. The main idea behind the Benders decomposition is to solve a large problem by replacing the values of the second-stage subproblems with individual variables and progressively forcing those variables to reach the optimal value of the subproblems, dynamically inserting additional valid constraints, known as Benders cuts. Most traditional implementations add a cut for each scenario (multicut) or a single cut that includes all scenarios. In this paper, we present a novel Benders adaptive-cuts method, where the Benders cuts are aggregated according to a partition of the scenarios, which is dynamically refined using the linear program-dual information of the subproblems. This scenario aggregation/disaggregation is based on the Generalized Adaptive Partitioning Method (GAPM), which has been successfully applied to TSSPs. We formalize this hybridization of Benders decomposition and the GAPM by providing sufficient conditions under which an optimal solution of the deterministic equivalent can be obtained in a finite number of iterations. Our new method can be interpreted as a compromise between the Benders single-cuts and multicuts methods, drawing on the advantages of both sides, by rendering the initial iterations faster (as for the single-cuts Benders) and ensuring the overall faster convergence (as for the multicuts Benders). Computational experiments on three TSSPs [the Stochastic Electricity Planning, Stochastic Multi-Commodity Flow, and conditional value-at-risk (CVaR) Facility Location] validate these statements, showing that the new method outperforms the other implementations of Benders methods, as well as other standard methods for solving TSSPs, in particular when the number of scenarios is very large. Moreover, our study demonstrates that the method is not only effective for the risk-neutral decision makers, but also that it can be used in combination with the risk-averse CVaR objective.
Benders decomposition is one of the most applied methods to solve two-stage stochastic problems (TSS
"
"en" => "Benders decomposition is one of the most applied methods to solve two-stage stochastic problems (TSSP) with a large number of scenarios. The main idea behind the Benders decomposition is to solve a large problem by replacing the values of the second-stage subproblems with individual variables and progressively forcing those variables to reach the optimal value of the subproblems, dynamically inserting additional valid constraints, known as Benders cuts. Most traditional implementations add a cut for each scenario (multicut) or a single cut that includes all scenarios. In this paper, we present a novel Benders adaptive-cuts method, where the Benders cuts are aggregated according to a partition of the scenarios, which is dynamically refined using the linear program-dual information of the subproblems. This scenario aggregation/disaggregation is based on the Generalized Adaptive Partitioning Method (GAPM), which has been successfully applied to TSSPs. We formalize this hybridization of Benders decomposition and the GAPM by providing sufficient conditions under which an optimal solution of the deterministic equivalent can be obtained in a finite number of iterations. Our new method can be interpreted as a compromise between the Benders single-cuts and multicuts methods, drawing on the advantages of both sides, by rendering the initial iterations faster (as for the single-cuts Benders) and ensuring the overall faster convergence (as for the multicuts Benders). Computational experiments on three TSSPs [the Stochastic Electricity Planning, Stochastic Multi-Commodity Flow, and conditional value-at-risk (CVaR) Facility Location] validate these statements, showing that the new method outperforms the other implementations of Benders methods, as well as other standard methods for solving TSSPs, in particular when the number of scenarios is very large. Moreover, our study demonstrates that the method is not only effective for the risk-neutral decision makers, but also that it can be used in combination with the risk-averse CVaR objective.
Benders decomposition is one of the most applied methods to solve two-stage stochastic problems (TSS
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
130 => Essec\Faculty\Model\Contribution {#2492
#_index: "academ_contributions"
#_id: "14102"
#_source: array:18 [
"id" => "14102"
"slug" => "on-socp-based-disjunctive-cuts-for-solving-a-class-of-integer-bilevel-nonlinear-programs"
"yearMonth" => "2024-07"
"year" => "2024"
"title" => "On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs"
"description" => "GAAR, E., LEE, J., LJUBIC, I., SINNL, M. et TANINMIS, K. (2024). On SOCP-based disjunctive cuts for solving a class of integer bilevel nonlinear programs. <i>Mathematical Programming</i>, 206, pp. 91-124.
GAAR, E., LEE, J., LJUBIC, I., SINNL, M. et TANINMIS, K. (2024). On SOCP-based disjunctive cuts for
"
"authors" => array:5 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GAAR Elisabeth"
]
2 => array:1 [
"name" => "LEE Jon"
]
3 => array:1 [
"name" => "SINNL Markus"
]
4 => array:1 [
"name" => "TANINMIS Kubra"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Bilevel optimization"
1 => "Disjunctive cuts"
2 => "Conic optimization"
3 => "Nonlinear optimization"
4 => "Branch-and-cut"
]
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://doi.org/10.1007/s10107-023-01965-1"
"publicationInfo" => array:3 [
"pages" => "91-124"
"volume" => "206"
"number" => null
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We study a class of integer bilevel programs with second-order cone constraints at the upper-level and a convex-quadratic objective function and linear constraints at the lower-level. We develop disjunctive cuts (DCs) to separate bilevel-infeasible solutions using a second-order-cone-based cut-generating procedure. We propose DC separation strategies and consider several approaches for removing redundant disjunctions and normalization. Using these DCs, we propose a branch-and-cut algorithm for the problem class we study, and a cutting-plane method for the problem variant with only binary variables. We present an extensive computational study on a diverse set of instances, including instances with binary and with integer variables, and instances with a single and with multiple linking constraints. Our computational study demonstrates that the proposed enhancements of our solution approaches are effective for improving the performance. Moreover, both of our approaches outperform a state-of-the-art generic solver for mixed-integer bilevel linear programs that is able to solve a linearized version of our binary instances.
We study a class of integer bilevel programs with second-order cone constraints at the upper-level a
"
"en" => "We study a class of integer bilevel programs with second-order cone constraints at the upper-level and a convex-quadratic objective function and linear constraints at the lower-level. We develop disjunctive cuts (DCs) to separate bilevel-infeasible solutions using a second-order-cone-based cut-generating procedure. We propose DC separation strategies and consider several approaches for removing redundant disjunctions and normalization. Using these DCs, we propose a branch-and-cut algorithm for the problem class we study, and a cutting-plane method for the problem variant with only binary variables. We present an extensive computational study on a diverse set of instances, including instances with binary and with integer variables, and instances with a single and with multiple linking constraints. Our computational study demonstrates that the proposed enhancements of our solution approaches are effective for improving the performance. Moreover, both of our approaches outperform a state-of-the-art generic solver for mixed-integer bilevel linear programs that is able to solve a linearized version of our binary instances.
We study a class of integer bilevel programs with second-order cone constraints at the upper-level a
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
131 => Essec\Faculty\Model\Contribution {#2493
#_index: "academ_contributions"
#_id: "14221"
#_source: array:18 [
"id" => "14221"
"slug" => "reinforcement-learning-approaches-for-the-orienteering-problem-with-stochastic-and-dynamic-release-dates
reinforcement-learning-approaches-for-the-orienteering-problem-with-stochastic-and-dynamic-release-d
"
"yearMonth" => "2022-08"
"year" => "2022"
"title" => "Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates
Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release D
"
"description" => "LI, Y., ARCHETTI, C. et LJUBIC, I. (2022). Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates. Dans: 2022 Italian Operations Research Society (AIRO) (2022 ODS). Florence.
LI, Y., ARCHETTI, C. et LJUBIC, I. (2022). Reinforcement Learning Approaches for the Orienteering Pr
"
"authors" => array:3 [
0 => array:3 [
"name" => "LI Yan"
"bid" => "B00132135"
"slug" => "li-yan"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => "2022 Italian Operations Research Society (AIRO) (2022 ODS)"
"keywords" => []
"updatedAt" => "2023-09-28 15:42:45"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
132 => Essec\Faculty\Model\Contribution {#2494
#_index: "academ_contributions"
#_id: "9945"
#_source: array:18 [
"id" => "9945"
"slug" => "a-memetic-algorithm-for-minimum-cost-vertex-biconnectivity-augmentation-of-graphs"
"yearMonth" => "2003-01"
"year" => "2003"
"title" => "A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs"
"description" => "LJUBIC, I. et RAIDL, G.R. (2003). A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs. <i>Journal of Heuristics</i>, 9(5), pp. 401-428.
LJUBIC, I. et RAIDL, G.R. (2003). A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augment
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "RAIDL Günther R."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:23"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "401-428"
"volume" => "9"
"number" => "5"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
133 => Essec\Faculty\Model\Contribution {#2495
#_index: "academ_contributions"
#_id: "10344"
#_source: array:18 [
"id" => "10344"
"slug" => "obtaining-optimal-k-cardinality-trees-fast"
"yearMonth" => "2009-01"
"year" => "2009"
"title" => "Obtaining optimal k-cardinality trees fast"
"description" => "LJUBIC, I., CHIMANI, M., KANDYBA, M. et MUTZEL, P. (2009). Obtaining optimal k-cardinality trees fast. <i>ACM Journal of Experimental Algorithmics (JEA)</i>, 14(5), pp. 5.1-5.23.
LJUBIC, I., CHIMANI, M., KANDYBA, M. et MUTZEL, P. (2009). Obtaining optimal k-cardinality trees fas
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "CHIMANI Markus"
]
2 => array:1 [
"name" => "KANDYBA Maria"
]
3 => array:1 [
"name" => "MUTZEL Petra"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:32"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "5.1-5.23"
"volume" => "14"
"number" => "5"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
134 => Essec\Faculty\Model\Contribution {#2496
#_index: "academ_contributions"
#_id: "10519"
#_source: array:18 [
"id" => "10519"
"slug" => "the-maximum-weight-connected-subgraph-problem"
"yearMonth" => "2013-01"
"year" => "2013"
"title" => "The Maximum Weight Connected Subgraph Problem"
"description" => "LJUBIC, I., ALVAREZ-MIRANDA, E. et MUTZEL, P. (2013). The Maximum Weight Connected Subgraph Problem. Dans: <i>Facets of Combinatorial Optimization</i>. 1st ed. Springer, pp. 245-270.
LJUBIC, I., ALVAREZ-MIRANDA, E. et MUTZEL, P. (2013). The Maximum Weight Connected Subgraph Problem.
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ALVAREZ-MIRANDA Eduardo"
]
2 => array:1 [
"name" => "MUTZEL Petra"
]
]
"ouvrage" => "Facets of Combinatorial Optimization"
"keywords" => []
"updatedAt" => "2023-01-27 15:07:41"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "245-270"
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
135 => Essec\Faculty\Model\Contribution {#2497
#_index: "academ_contributions"
#_id: "10643"
#_source: array:18 [
"id" => "10643"
"slug" => "operations-research-proceedings-2015"
"yearMonth" => "2016-07"
"year" => "2016"
"title" => "Operations Research Proceedings 2015"
"description" => "LJUBIC, I., DOERNER, K., TRAGLER, G. et PFLUG, G. [Eds] (2016). <i>Operations Research Proceedings 2015</i>. Springer.
LJUBIC, I., DOERNER, K., TRAGLER, G. et PFLUG, G. [Eds] (2016). <i>Operations Research Proceedings 2
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "DOERNER Karl"
]
2 => array:1 [
"name" => "TRAGLER Gernot"
]
3 => array:1 [
"name" => "PFLUG Georg"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2023-01-27 15:06:47"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Direction d'ouvrage"
"en" => "Book editor"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
136 => Essec\Faculty\Model\Contribution {#2498
#_index: "academ_contributions"
#_id: "10720"
#_source: array:18 [
"id" => "10720"
"slug" => "a-new-bilevel-approach-for-the-k-vertex-cut-problem"
"yearMonth" => "2019-10"
"year" => "2019"
"title" => "A New Bilevel Approach for the K-vertex Cut Problem"
"description" => "FURINI, F., LJUBIC, I., MALAGUTI, E. et PARONUZZI, P. (2019). A New Bilevel Approach for the K-vertex Cut Problem. Dans: 2019 INFORMS Annual Meeting.
FURINI, F., LJUBIC, I., MALAGUTI, E. et PARONUZZI, P. (2019). A New Bilevel Approach for the K-verte
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI Fabio"
]
2 => array:1 [
"name" => "MALAGUTI Enrico"
]
3 => array:1 [
"name" => "PARONUZZI Paolo"
]
]
"ouvrage" => "2019 INFORMS Annual Meeting"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
137 => Essec\Faculty\Model\Contribution {#2499
#_index: "academ_contributions"
#_id: "10846"
#_source: array:18 [
"id" => "10846"
"slug" => "une-methode-exacte-pour-le-probleme-dassortiment-optimal-avec-modele-de-choix-nested-logit"
"yearMonth" => "2020-02"
"year" => "2020"
"title" => "Une méthode exacte pour le problème d'assortiment optimal avec modèle de choix nested-logit"
"description" => "ALFANDARI, L., HASSANZADEH, A. et LJUBIC, I. (2020). Une méthode exacte pour le problème d'assortiment optimal avec modèle de choix nested-logit. Dans: 21st ROADEF 2020.
ALFANDARI, L., HASSANZADEH, A. et LJUBIC, I. (2020). Une méthode exacte pour le problème d'assortime
"
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "HASSANZADEH Alborz"
]
]
"ouvrage" => "21st ROADEF 2020"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Management des opérations"
"en" => "Operations Management"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
138 => Essec\Faculty\Model\Contribution {#2500
#_index: "academ_contributions"
#_id: "8538"
#_source: array:18 [
"id" => "8538"
"slug" => "european-journal-of-operational-research"
"yearMonth" => "2017-06"
"year" => "2017"
"title" => "European Journal of Operational Research"
"description" => "EHRGOTT, M., LJUBIC, I. et PARRAGH, S.N. (2017). European Journal of Operational Research. <i>European Journal of Operational Research</i>, 260(3).
EHRGOTT, M., LJUBIC, I. et PARRAGH, S.N. (2017). European Journal of Operational Research. <i>Europe
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "EHRGOTT M."
]
2 => array:1 [
"name" => "PARRAGH S. N."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => "260"
"number" => "3"
]
"type" => array:2 [
"fr" => "Editeur invité d'un numéro spécial"
"en" => "Guest editor of a journal special issue"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The development of exact methods for multi-objective optimisation is experiencing increasing interest in the OR community as witnessed by the growing body of research emerging from that domain. Recent advances in the development of nonlinear, linear and mixed integer optimisation solvers push the boundaries towards more challenging areas. Hence solving to optimality larger, more difficult (real-world) problems involving several conflicting objectives, has been put within reach. As guest editors we hope that this feature cluster increases the visibility of research concerning exact methods for multi-objective optimisation and to motivate a broader group of researchers to contribute to the field. It presents a collection of the latest research results on exact algorithms for multi-objective optimisation as well as heuristics derived from exact methods.
The development of exact methods for multi-objective optimisation is experiencing increasing interes
"
"en" => "The development of exact methods for multi-objective optimisation is experiencing increasing interest in the OR community as witnessed by the growing body of research emerging from that domain. Recent advances in the development of nonlinear, linear and mixed integer optimisation solvers push the boundaries towards more challenging areas. Hence solving to optimality larger, more difficult (real-world) problems involving several conflicting objectives, has been put within reach. As guest editors we hope that this feature cluster increases the visibility of research concerning exact methods for multi-objective optimisation and to motivate a broader group of researchers to contribute to the field. It presents a collection of the latest research results on exact algorithms for multi-objective optimisation as well as heuristics derived from exact methods.
The development of exact methods for multi-objective optimisation is experiencing increasing interes
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
139 => Essec\Faculty\Model\Contribution {#2501
#_index: "academ_contributions"
#_id: "9383"
#_source: array:18 [
"id" => "9383"
"slug" => "editorial-feature-cluster-recent-advances-in-exact-methods-for-multi-objective-optimization"
"yearMonth" => "2017-08"
"year" => "2017"
"title" => "EDITORIAL: Feature Cluster: Recent Advances in Exact Methods for Multi-Objective Optimization"
"description" => "EHRGOTT, M., LJUBIC, I. et PARRAGH, S.N. (2017). EDITORIAL: Feature Cluster: Recent Advances in Exact Methods for Multi-Objective Optimization. <i>European Journal of Operational Research</i>, 260(3), pp. 805-806.
EHRGOTT, M., LJUBIC, I. et PARRAGH, S.N. (2017). EDITORIAL: Feature Cluster: Recent Advances in Exac
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "EHRGOTT M."
]
2 => array:1 [
"name" => "PARRAGH S. N."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "805-806"
"volume" => "260"
"number" => "3"
]
"type" => array:2 [
"fr" => "Préfaces / Introductions de revue"
"en" => "Prefaces of a journal"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The development of exact methods for multi-objective optimisation is experiencing increasing interest in the OR community as witnessed by the growing body of research emerging from that domain. Recent advances in the development of nonlinear, linear and mixed integer optimisation solvers push the boundaries towards more challenging areas. Hence solving to optimality larger, more difficult (real-world) problems involving several conflicting objectives, has been put within reach. As guest editors we hope that this feature cluster increases the visibility of research concerning exact methods for multi-objective optimisation and to motivate a broader group of researchers to contribute to the field. It presents a collection of the latest research results on exact algorithms for multi-objective optimisation as well as heuristics derived from exact methods.
The development of exact methods for multi-objective optimisation is experiencing increasing interes
"
"en" => "The development of exact methods for multi-objective optimisation is experiencing increasing interest in the OR community as witnessed by the growing body of research emerging from that domain. Recent advances in the development of nonlinear, linear and mixed integer optimisation solvers push the boundaries towards more challenging areas. Hence solving to optimality larger, more difficult (real-world) problems involving several conflicting objectives, has been put within reach. As guest editors we hope that this feature cluster increases the visibility of research concerning exact methods for multi-objective optimisation and to motivate a broader group of researchers to contribute to the field. It presents a collection of the latest research results on exact algorithms for multi-objective optimisation as well as heuristics derived from exact methods.
The development of exact methods for multi-objective optimisation is experiencing increasing interes
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
140 => Essec\Faculty\Model\Contribution {#2502
#_index: "academ_contributions"
#_id: "9913"
#_source: array:18 [
"id" => "9913"
"slug" => "solving-the-simple-plant-location-problem-by-genetic-algorithms"
"yearMonth" => "2001-01"
"year" => "2001"
"title" => "Solving the simple plant location problem by genetic algorithms"
"description" => "LJUBIC, I., TOŠIC, D., FILIPOVIC, V. et KRATICA, J. (2001). Solving the simple plant location problem by genetic algorithms. <i>RAIRO - Operations Research</i>, 35(1), pp. 127-142.
LJUBIC, I., TOŠIC, D., FILIPOVIC, V. et KRATICA, J. (2001). Solving the simple plant location proble
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "TOŠIC Dušana"
]
2 => array:1 [
"name" => "FILIPOVIC Vladimira"
]
3 => array:1 [
"name" => "KRATICA Jozefa"
]
]
"ouvrage" => ""
"keywords" => array:3 [
0 => "Simple plant location problem"
1 => "genetic algorithms"
2 => "combinatorial optimization"
]
"updatedAt" => "2021-07-13 14:31:23"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "127-142"
"volume" => "35"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.
The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve
"
"en" => "The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.
The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
141 => Essec\Faculty\Model\Contribution {#2503
#_index: "academ_contributions"
#_id: "9927"
#_source: array:18 [
"id" => "9927"
"slug" => "evolutionary-local-search-for-the-edge-biconnectibity-augmentation-problem"
"yearMonth" => "2002-01"
"year" => "2002"
"title" => "Evolutionary Local Search for the Edge-Biconnectibity Augmentation Problem"
"description" => "RAIDL, G.R. et LJUBIC, I. (2002). Evolutionary Local Search for the Edge-Biconnectibity Augmentation Problem. <i>Information Processing Letters</i>, 82(1), pp. 39-45.
RAIDL, G.R. et LJUBIC, I. (2002). Evolutionary Local Search for the Edge-Biconnectibity Augmentation
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "RAIDL Günther R."
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Combinatorial problems"
1 => "Graph algorithms"
2 => "Evolutionary algorithms"
3 => "Interconnection networks"
4 => "Connectivity augmentation problems"
]
"updatedAt" => "2021-07-13 14:31:23"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "39-45"
"volume" => "82"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "This paper considers the problem of augmenting a given graph by a cheapest possible set of additional edges in order to make the graph edge-biconnected. An application is the extension of an existing communication network to become robust against single link-failures. An evolutionary algorithm (EA) is presented which includes an effective preprocessing of the problem data and a local improvement procedure that is applied during initialization, recombination, and mutation. In this way, the EA searches the space of feasible, locally optimal solutions only. The variation operators were designed with particular emphasis on low computational effort and strong locality. Empirical results indicate the superiority of the new approach over two previous heuristic methods.
This paper considers the problem of augmenting a given graph by a cheapest possible set of additiona
"
"en" => "This paper considers the problem of augmenting a given graph by a cheapest possible set of additional edges in order to make the graph edge-biconnected. An application is the extension of an existing communication network to become robust against single link-failures. An evolutionary algorithm (EA) is presented which includes an effective preprocessing of the problem data and a local improvement procedure that is applied during initialization, recombination, and mutation. In this way, the EA searches the space of feasible, locally optimal solutions only. The variation operators were designed with particular emphasis on low computational effort and strong locality. Empirical results indicate the superiority of the new approach over two previous heuristic methods.
This paper considers the problem of augmenting a given graph by a cheapest possible set of additiona
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
142 => Essec\Faculty\Model\Contribution {#2504
#_index: "academ_contributions"
#_id: "10102"
#_source: array:18 [
"id" => "10102"
"slug" => "an-algorithmic-framework-for-the-exact-solution-of-the-prize-collecting-steiner-tree-problem"
"yearMonth" => "2006-02"
"year" => "2006"
"title" => "An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem"
"description" => "LJUBIC, I., WEISKIRCHER, R., PFERSCHY, U., KLAU, G., MUTZEL, P. et FISCHETTI, M. (2006). An Algorithmic Framework for the Exact Solution of the Prize-Collecting Steiner Tree Problem. <i>Mathematical Programming</i>, 105(2), pp. 427-449.
LJUBIC, I., WEISKIRCHER, R., PFERSCHY, U., KLAU, G., MUTZEL, P. et FISCHETTI, M. (2006). An Algorith
"
"authors" => array:6 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "WEISKIRCHER René"
]
2 => array:1 [
"name" => "PFERSCHY Ulrich"
]
3 => array:1 [
"name" => "KLAU Gunnar"
]
4 => array:1 [
"name" => "MUTZEL Petra"
]
5 => array:1 [
"name" => "FISCHETTI M."
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-07-13 14:31:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "427-449"
"volume" => "105"
"number" => "2"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
143 => Essec\Faculty\Model\Contribution {#2505
#_index: "academ_contributions"
#_id: "11974"
#_source: array:18 [
"id" => "11974"
"slug" => "on-the-asymmetric-connected-facility-location-polytope"
"yearMonth" => "2014-01"
"year" => "2014"
"title" => "On the Asymmetric Connected Facility Location Polytope"
"description" => "LEITNER, M., LJUBIC, I., SALAZAR-GONZALEZ, J.J. et SINNL, M. (2014). On the Asymmetric Connected Facility Location Polytope. Dans: <i>ISCO 2014</i>. Springer, pp. 371-383.
LEITNER, M., LJUBIC, I., SALAZAR-GONZALEZ, J.J. et SINNL, M. (2014). On the Asymmetric Connected Fac
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER M."
]
2 => array:1 [
"name" => "SALAZAR-GONZALEZ J.-J."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => "ISCO 2014"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:57"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "371-383"
"volume" => "8596 of LNCS"
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
144 => Essec\Faculty\Model\Contribution {#2506
#_index: "academ_contributions"
#_id: "11975"
#_source: array:18 [
"id" => "11975"
"slug" => "the-rooted-maximum-node-weight-connected-subgraph-problem"
"yearMonth" => "2013-01"
"year" => "2013"
"title" => "The Rooted Maximum Node-Weight Connected ´ Subgraph Problem"
"description" => "ÁLVAREZ-MIRANDA, E., LJUBIC, I. et MUTZEL, P. (2013). The Rooted Maximum Node-Weight Connected ´ Subgraph Problem. Dans: <i>CPAIOR 2013</i>. Springer, pp. 300-315.
ÁLVAREZ-MIRANDA, E., LJUBIC, I. et MUTZEL, P. (2013). The Rooted Maximum Node-Weight Connected ´ Sub
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ÁLVAREZ-MIRANDA E."
]
2 => array:1 [
"name" => "MUTZEL P."
]
]
"ouvrage" => "CPAIOR 2013"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:57"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "300-315"
"volume" => "7874 of LNCS"
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
145 => Essec\Faculty\Model\Contribution {#2507
#_index: "academ_contributions"
#_id: "11976"
#_source: array:18 [
"id" => "11976"
"slug" => "stochastic-survivable-network-design-problems"
"yearMonth" => "2013-01"
"year" => "2013"
"title" => "Stochastic survivable network design problems"
"description" => "LJUBIC, I., MUTZEL, P. et ZEY, B. (2013). Stochastic survivable network design problems. Dans: <i>Proceedings of INOC 2013</i>. Electronic Notes in Discrete Mathematics (ENDM), pp. 245–252.
LJUBIC, I., MUTZEL, P. et ZEY, B. (2013). Stochastic survivable network design problems. Dans: <i>Pr
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "MUTZEL P."
]
2 => array:1 [
"name" => "ZEY B."
]
]
"ouvrage" => "Proceedings of INOC 2013"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:57"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "245–252"
"volume" => "41"
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
146 => Essec\Faculty\Model\Contribution {#2508
#_index: "academ_contributions"
#_id: "11982"
#_source: array:18 [
"id" => "11982"
"slug" => "mip-modeling-of-incremental-connected-facility-location"
"yearMonth" => "2011-01"
"year" => "2011"
"title" => "MIP modeling of incremental connected facility location"
"description" => "ARULSELVAN, A., LJUBIC, I., BLEY, A., GOLLOWITZER, S. et MAURER, O. (2011). MIP modeling of incremental connected facility location. Dans: <i>Proceedings of INOC 2011</i>. Springer, pp. 490-502.
ARULSELVAN, A., LJUBIC, I., BLEY, A., GOLLOWITZER, S. et MAURER, O. (2011). MIP modeling of incremen
"
"authors" => array:5 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ARULSELVAN A."
]
2 => array:1 [
"name" => "BLEY A."
]
3 => array:1 [
"name" => "GOLLOWITZER S."
]
4 => array:1 [
"name" => "MAURER O."
]
]
"ouvrage" => "Proceedings of INOC 2011"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:57"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "490-502"
"volume" => "6701 of LNCS"
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
147 => Essec\Faculty\Model\Contribution {#2509
#_index: "academ_contributions"
#_id: "11989"
#_source: array:18 [
"id" => "11989"
"slug" => "obtaining-optimal-k-cardinality-trees-fast"
"yearMonth" => "2008-01"
"year" => "2008"
"title" => "Obtaining optimal k-cardinality trees fast"
"description" => "CHIMANI, M., KANDYBA, M., LJUBIC, I. et MUTZEL, P. (2008). Obtaining optimal k-cardinality trees fast. Dans: <i>ALENEX</i>. SIAM, pp. 27-36.
CHIMANI, M., KANDYBA, M., LJUBIC, I. et MUTZEL, P. (2008). Obtaining optimal k-cardinality trees fas
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "CHIMANI Markus"
]
2 => array:1 [
"name" => "KANDYBA Maria"
]
3 => array:1 [
"name" => "MUTZEL Petra"
]
]
"ouvrage" => "ALENEX"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => "27-36"
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Actes d'une conférence"
"en" => "Conference Proceedings"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
148 => Essec\Faculty\Model\Contribution {#2510
#_index: "academ_contributions"
#_id: "12014"
#_source: array:18 [
"id" => "12014"
"slug" => "from-game-theory-to-graph-theory-a-bilevel-journey-euro-2019-tutorial"
"yearMonth" => "2019-06"
"year" => "2019"
"title" => "From Game Theory to Graph Theory: A Bilevel Journey (EURO 2019 Tutorial)"
"description" => "LJUBIC, I. (2019). From Game Theory to Graph Theory: A Bilevel Journey (EURO 2019 Tutorial). Dans: 30th European Conference on Operational Research. Dublin.
LJUBIC, I. (2019). From Game Theory to Graph Theory: A Bilevel Journey (EURO 2019 Tutorial). Dans: 3
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "30th European Conference on Operational Research"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
149 => Essec\Faculty\Model\Contribution {#2511
#_index: "academ_contributions"
#_id: "12017"
#_source: array:18 [
"id" => "12017"
"slug" => "recent-developments-on-exact-solvers-for-the-prize-collecting-steiner-tree-problem-invited-tutorial"
"yearMonth" => "2018-01"
"year" => "2018"
"title" => "Recent Developments on Exact Solvers for the (Prize-Collecting) Steiner Tree Problem (Invited Tutorial)
Recent Developments on Exact Solvers for the (Prize-Collecting) Steiner Tree Problem (Invited Tutori
"
"description" => "LJUBIC, I. (2018). Recent Developments on Exact Solvers for the (Prize-Collecting) Steiner Tree Problem (Invited Tutorial). Dans: Winter School on Network Optimization NetOpt2018.
LJUBIC, I. (2018). Recent Developments on Exact Solvers for the (Prize-Collecting) Steiner Tree Prob
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Winter School on Network Optimization NetOpt2018"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
150 => Essec\Faculty\Model\Contribution {#2512
#_index: "academ_contributions"
#_id: "12023"
#_source: array:18 [
"id" => "12023"
"slug" => "redesigning-benders-decomposition-for-large-scale-facility-location"
"yearMonth" => "2015-10"
"year" => "2015"
"title" => "Redesigning Benders Decomposition for Large Scale Facility Location"
"description" => "LJUBIC, I. (2015). Redesigning Benders Decomposition for Large Scale Facility Location. Dans: GOM Seminar, Université Libre de Bruxelles. Bruxelles.
LJUBIC, I. (2015). Redesigning Benders Decomposition for Large Scale Facility Location. Dans: GOM Se
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "GOM Seminar, Université Libre de Bruxelles"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
151 => Essec\Faculty\Model\Contribution {#2513
#_index: "academ_contributions"
#_id: "12024"
#_source: array:18 [
"id" => "12024"
"slug" => "on-optimal-design-of-charging-stations-for-electric-vehicles"
"yearMonth" => "2015-09"
"year" => "2015"
"title" => "On optimal design of charging stations for electric vehicles"
"description" => "LJUBIC, I. (2015). On optimal design of charging stations for electric vehicles. Dans: PGMO Seminar, École Polytechnique. Paris.
LJUBIC, I. (2015). On optimal design of charging stations for electric vehicles. Dans: PGMO Seminar,
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "PGMO Seminar, École Polytechnique"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
152 => Essec\Faculty\Model\Contribution {#2514
#_index: "academ_contributions"
#_id: "12025"
#_source: array:18 [
"id" => "12025"
"slug" => "exact-approaches-to-the-network-design-problem-with-relays"
"yearMonth" => "2015-05"
"year" => "2015"
"title" => "Exact Approaches to the Network Design Problem with Relays"
"description" => "LJUBIC, I. (2015). Exact Approaches to the Network Design Problem with Relays. Dans: Laboratoire d’informatique de Paris Nord. Paris.
LJUBIC, I. (2015). Exact Approaches to the Network Design Problem with Relays. Dans: Laboratoire d’i
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Laboratoire d’informatique de Paris Nord"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
153 => Essec\Faculty\Model\Contribution {#2515
#_index: "academ_contributions"
#_id: "12026"
#_source: array:18 [
"id" => "12026"
"slug" => "mip-approaches-to-the-lazy-bureaucrat-and-greedy-boss-problems"
"yearMonth" => "2015-05"
"year" => "2015"
"title" => "MIP Approaches to the Lazy Bureaucrat and Greedy Boss Problems"
"description" => "LJUBIC, I. (2015). MIP Approaches to the Lazy Bureaucrat and Greedy Boss Problems. Dans: Séminaire Pôle 2 Optimisation Combinatoire, University Paris Dauphine. Paris.
LJUBIC, I. (2015). MIP Approaches to the Lazy Bureaucrat and Greedy Boss Problems. Dans: Séminaire P
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Séminaire Pôle 2 Optimisation Combinatoire, University Paris Dauphine"
"keywords" => []
"updatedAt" => "2021-10-05 15:02:59"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
154 => Essec\Faculty\Model\Contribution {#2516
#_index: "academ_contributions"
#_id: "12027"
#_source: array:18 [
"id" => "12027"
"slug" => "the-diameter-constrained-minimum-spanning-tree-problem-polyhedral-study-2"
"yearMonth" => "2015-03"
"year" => "2015"
"title" => "The diameter constrained minimum spanning tree problem: Polyhedral study, 2"
"description" => "LJUBIC, I. (2015). The diameter constrained minimum spanning tree problem: Polyhedral study, 2. Dans: Encontro do Centro de Investigação Operacional, University of Lisbon. Lisbon.
LJUBIC, I. (2015). The diameter constrained minimum spanning tree problem: Polyhedral study, 2. Dans
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Encontro do Centro de Investigação Operacional, University of Lisbon"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
155 => Essec\Faculty\Model\Contribution {#2517
#_index: "academ_contributions"
#_id: "12028"
#_source: array:18 [
"id" => "12028"
"slug" => "a-new-modeling-concept-for-facility-location-under-uncertainty"
"yearMonth" => "2015-03"
"year" => "2015"
"title" => "A New Modeling Concept for Facility Location Under Uncertainty"
"description" => "LJUBIC, I. (2015). A New Modeling Concept for Facility Location Under Uncertainty. Dans: Seminar of the Operations Group, Universidad Adolfo Ibanez. Santiago.
LJUBIC, I. (2015). A New Modeling Concept for Facility Location Under Uncertainty. Dans: Seminar of
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Seminar of the Operations Group, Universidad Adolfo Ibanez"
"keywords" => []
"updatedAt" => "2021-10-05 15:03:52"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
156 => Essec\Faculty\Model\Contribution {#2518
#_index: "academ_contributions"
#_id: "12030"
#_source: array:18 [
"id" => "12030"
"slug" => "the-recoverable-robust-facility-location-problem"
"yearMonth" => "2014-05"
"year" => "2014"
"title" => "The Recoverable Robust Facility Location Problem"
"description" => "LJUBIC, I. (2014). The Recoverable Robust Facility Location Problem. Dans: Graz Discrete Mathematics and Optimization Seminar, TU Graz. Graz.
LJUBIC, I. (2014). The Recoverable Robust Facility Location Problem. Dans: Graz Discrete Mathematics
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Graz Discrete Mathematics and Optimization Seminar, TU Graz"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
157 => Essec\Faculty\Model\Contribution {#2519
#_index: "academ_contributions"
#_id: "12032"
#_source: array:18 [
"id" => "12032"
"slug" => "the-maximum-weight-connected-subgraph-problem"
"yearMonth" => "2012-11"
"year" => "2012"
"title" => "The Maximum Weight Connected Subgraph Problem"
"description" => "LJUBIC, I. (2012). The Maximum Weight Connected Subgraph Problem. Dans: COGA Seminar, TU Berlin. Berlin.
LJUBIC, I. (2012). The Maximum Weight Connected Subgraph Problem. Dans: COGA Seminar, TU Berlin. Ber
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "COGA Seminar, TU Berlin"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
158 => Essec\Faculty\Model\Contribution {#2520
#_index: "academ_contributions"
#_id: "12034"
#_source: array:18 [
"id" => "12034"
"slug" => "optimization-tools-for-last-mile-access-networks"
"yearMonth" => "2012-05"
"year" => "2012"
"title" => "Optimization Tools for Last Mile Access Networks"
"description" => "LJUBIC, I. (2012). Optimization Tools for Last Mile Access Networks. Dans: Colloquium of the Computer Science Department, Faculty of Mathematics and Natural Sciences. Cologne.
LJUBIC, I. (2012). Optimization Tools for Last Mile Access Networks. Dans: Colloquium of the Compute
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Colloquium of the Computer Science Department, Faculty of Mathematics and Natural Sciences"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
159 => Essec\Faculty\Model\Contribution {#2521
#_index: "academ_contributions"
#_id: "12037"
#_source: array:18 [
"id" => "12037"
"slug" => "the-generalized-regenerator-location-problem"
"yearMonth" => "2011-10"
"year" => "2011"
"title" => "The Generalized Regenerator Location Problem"
"description" => "LJUBIC, I. (2011). The Generalized Regenerator Location Problem. Dans: Decision, Operations and Information Technologies Seminar, University of Maryland. Maryland.
LJUBIC, I. (2011). The Generalized Regenerator Location Problem. Dans: Decision, Operations and Info
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Decision, Operations and Information Technologies Seminar, University of Maryland"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
160 => Essec\Faculty\Model\Contribution {#2522
#_index: "academ_contributions"
#_id: "12038"
#_source: array:18 [
"id" => "12038"
"slug" => "dissaggregated-flow-formulation-for-the-single-source-network-loading-problem"
"yearMonth" => "2010-08"
"year" => "2010"
"title" => "Dissaggregated Flow Formulation for the Single-Source Network-Loading Problem"
"description" => "LJUBIC, I. (2010). Dissaggregated Flow Formulation for the Single-Source Network-Loading Problem. Dans: COGA, TU Berlin.
LJUBIC, I. (2010). Dissaggregated Flow Formulation for the Single-Source Network-Loading Problem. Da
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "COGA, TU Berlin"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
161 => Essec\Faculty\Model\Contribution {#2523
#_index: "academ_contributions"
#_id: "12039"
#_source: array:18 [
"id" => "12039"
"slug" => "opttelnets-algorithmische-ansatze"
"yearMonth" => "2010-08"
"year" => "2010"
"title" => "OptTelNets: Algorithmische Ansätze"
"description" => "LJUBIC, I. (2010). OptTelNets: Algorithmische Ansätze. Dans: COGA, TU Berlin. Berlin."
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "COGA, TU Berlin"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
162 => Essec\Faculty\Model\Contribution {#2524
#_index: "academ_contributions"
#_id: "12040"
#_source: array:18 [
"id" => "12040"
"slug" => "two-stage-branch-cut-for-two-stage-stochastic-network-design-problems"
"yearMonth" => "2010-07"
"year" => "2010"
"title" => "Two-Stage Branch & Cut for Two-Stage Stochastic Network Design Problems"
"description" => "LJUBIC, I. (2010). Two-Stage Branch & Cut for Two-Stage Stochastic Network Design Problems. Dans: Algorithm Engineering Seminar, Schloss Dagstuhl.
LJUBIC, I. (2010). Two-Stage Branch & Cut for Two-Stage Stochastic Network Design Problems. Dans: Al
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Algorithm Engineering Seminar, Schloss Dagstuhl"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
163 => Essec\Faculty\Model\Contribution {#2525
#_index: "academ_contributions"
#_id: "12041"
#_source: array:18 [
"id" => "12041"
"slug" => "connected-facility-location-in-the-design-of-telecommunication-networks"
"yearMonth" => "2007-03"
"year" => "2007"
"title" => "Connected facility location in the design of telecommunication networks"
"description" => "LJUBIC, I. (2007). Connected facility location in the design of telecommunication networks. Dans: ISDS-Kolloquium, University of Vienna. Vienna.
LJUBIC, I. (2007). Connected facility location in the design of telecommunication networks. Dans: IS
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "ISDS-Kolloquium, University of Vienna"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:58"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
164 => Essec\Faculty\Model\Contribution {#2526
#_index: "academ_contributions"
#_id: "5290"
#_source: array:18 [
"id" => "5290"
"slug" => "a-dual-ascent-based-branch-and-bound-framework-for-the-prize-collecting-steiner-tree-and-related-problems
a-dual-ascent-based-branch-and-bound-framework-for-the-prize-collecting-steiner-tree-and-related-pro
"
"yearMonth" => "2017-06"
"year" => "2017"
"title" => "A Dual-Ascent-Based Branch-And-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems
A Dual-Ascent-Based Branch-And-Bound Framework for the Prize-Collecting Steiner Tree and Related Pro
"
"description" => "LEITNER, M., LJUBIC, I., LUIPERSBECK, M. et SINNL, M. (2017). A Dual-Ascent-Based Branch-And-Bound Framework for the Prize-Collecting Steiner Tree and Related Problems. Dans: Journées Polyèdres et Optimisation Combinatoire JPOC10.
LEITNER, M., LJUBIC, I., LUIPERSBECK, M. et SINNL, M. (2017). A Dual-Ascent-Based Branch-And-Bound F
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER M."
]
2 => array:1 [
"name" => "LUIPERSBECK M."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => "Journées Polyèdres et Optimisation Combinatoire JPOC10"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
165 => Essec\Faculty\Model\Contribution {#2527
#_index: "academ_contributions"
#_id: "12233"
#_source: array:18 [
"id" => "12233"
"slug" => "branch-and-cut-solvers-for-mixed-integer-bilevel-linear-programs"
"yearMonth" => "2020-10"
"year" => "2020"
"title" => "Branch-and-Cut Solvers for Mixed-Integer Bilevel Linear Programs"
"description" => "LJUBIC, I. (2020). Branch-and-Cut Solvers for Mixed-Integer Bilevel Linear Programs. Dans: Autumn School on Bilevel Optimization. Online.
LJUBIC, I. (2020). Branch-and-Cut Solvers for Mixed-Integer Bilevel Linear Programs. Dans: Autumn Sc
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Autumn School on Bilevel Optimization"
"keywords" => []
"updatedAt" => "2022-02-09 10:48:52"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
166 => Essec\Faculty\Model\Contribution {#2528
#_index: "academ_contributions"
#_id: "12234"
#_source: array:18 [
"id" => "12234"
"slug" => "new-integer-and-bilevel-formulations-for-the-k-vertex-cut-problem"
"yearMonth" => "2021-02"
"year" => "2021"
"title" => "New Integer and Bilevel Formulations for the k-Vertex Cut Problem,"
"description" => "LJUBIC, I. (2021). New Integer and Bilevel Formulations for the k-Vertex Cut Problem, Dans: 5th AIRO Young Workshop. Napoli (online).
LJUBIC, I. (2021). New Integer and Bilevel Formulations for the k-Vertex Cut Problem, Dans: 5th AIRO
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "5th AIRO Young Workshop"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
167 => Essec\Faculty\Model\Contribution {#2529
#_index: "academ_contributions"
#_id: "12235"
#_source: array:18 [
"id" => "12235"
"slug" => "panel-discussion-real-world-optimisation-models-successes-and-pitfalls-at-the-beale-lecture-2021"
"yearMonth" => "2021-02"
"year" => "2021"
"title" => "Panel Discussion "Real-World Optimisation Models: Successes and Pitfalls," at the Beale Lecture 2021
Panel Discussion "Real-World Optimisation Models: Successes and Pitfalls," at the Beale Lecture 202
"
"description" => "LJUBIC, I. (2021). Panel Discussion "Real-World Optimisation Models: Successes and Pitfalls," at the Beale Lecture 2021. Online:
LJUBIC, I. (2021). Panel Discussion "Real-World Optimisation Models: Successes and Pitfalls," at th
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Autre"
"en" => "Other"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
168 => Essec\Faculty\Model\Contribution {#2530
#_index: "academ_contributions"
#_id: "5318"
#_source: array:18 [
"id" => "5318"
"slug" => "a-new-exact-solver-for-mixed-integer-bilevel-linear-programs-based-on-intersection-cuts"
"yearMonth" => "2016-07"
"year" => "2016"
"title" => "A New Exact Solver for Mixed-Integer Bilevel Linear Programs Based on Intersection Cuts"
"description" => "FISCHETTI, M., LJUBIC, I., MONACI, M. et SINNL, M. (2016). A New Exact Solver for Mixed-Integer Bilevel Linear Programs Based on Intersection Cuts. Dans: International Colloquium on Graphs and Optimization 2016 (GO X 2016).
FISCHETTI, M., LJUBIC, I., MONACI, M. et SINNL, M. (2016). A New Exact Solver for Mixed-Integer Bile
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FISCHETTI M."
]
2 => array:1 [
"name" => "MONACI M."
]
3 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => "International Colloquium on Graphs and Optimization 2016 (GO X 2016)"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:06"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
169 => Essec\Faculty\Model\Contribution {#2531
#_index: "academ_contributions"
#_id: "5422"
#_source: array:18 [
"id" => "5422"
"slug" => "analyzing-the-resilience-of-the-networks-with-respect-to-vertex-interdiction-attacks"
"yearMonth" => "2018-11"
"year" => "2018"
"title" => "Analyzing the Resilience of the Networks with respect to Vertex-Interdiction Attacks"
"description" => "FURINI, F., LJUBIC, I., MARTIN, S. et SAN SEGUNDO, P. (2018). Analyzing the Resilience of the Networks with respect to Vertex-Interdiction Attacks. Dans: 2018 Institute for Operations Research and the Management Sciences (INFORMS) Annual Meeting.
FURINI, F., LJUBIC, I., MARTIN, S. et SAN SEGUNDO, P. (2018). Analyzing the Resilience of the Networ
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI F."
]
2 => array:1 [
"name" => "MARTIN S."
]
3 => array:1 [
"name" => "SAN SEGUNDO P."
]
]
"ouvrage" => "2018 Institute for Operations Research and the Management Sciences (INFORMS) Annual Meeting"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
170 => Essec\Faculty\Model\Contribution {#2532
#_index: "academ_contributions"
#_id: "12418"
#_source: array:18 [
"id" => "12418"
"slug" => "sustainable-city-logistics"
"yearMonth" => "2021-05"
"year" => "2021"
"title" => "Sustainable city logistics"
"description" => "ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2021). Sustainable city logistics. <i>ESSEC Knowledge</i>.
ALFANDARI, L., ARCHETTI, C. et LJUBIC, I. (2021). Sustainable city logistics. <i>ESSEC Knowledge</i>
"
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => "http://knowledge.essec.edu/en/innovation/sustainable-city-logistics.html"
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Articles ou vidéos de vulgarisation"
"en" => "Press article, video or other popular media"
]
"support_type" => array:2 [
"fr" => "Presse"
"en" => "Press"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
171 => Essec\Faculty\Model\Contribution {#2533
#_index: "academ_contributions"
#_id: "12569"
#_source: array:18 [
"id" => "12569"
"slug" => "the-edge-interdiction-clique-problem"
"yearMonth" => "2021-07"
"year" => "2021"
"title" => "The Edge Interdiction Clique Problem"
"description" => "FURINI, F., LJUBIC, I., SAN SEGUNDO, P. et ZHAO, Y. (2021). The Edge Interdiction Clique Problem. Dans: 31st European Conference on Operational Research 2021. Athens (virtual).
FURINI, F., LJUBIC, I., SAN SEGUNDO, P. et ZHAO, Y. (2021). The Edge Interdiction Clique Problem. Da
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:3 [
"name" => "ZHAO Yanlu"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
2 => array:1 [
"name" => "FURINI Fabio"
]
3 => array:1 [
"name" => "SAN SEGUNDO Pablo"
]
]
"ouvrage" => "31st European Conference on Operational Research 2021"
"keywords" => []
"updatedAt" => "2022-02-09 11:31:42"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
172 => Essec\Faculty\Model\Contribution {#2534
#_index: "academ_contributions"
#_id: "12576"
#_source: array:18 [
"id" => "12576"
"slug" => "aggregated-formulations-for-the-inventory-routing-problem"
"yearMonth" => "2021-09"
"year" => "2021"
"title" => "Aggregated Formulations for the Inventory Routing Problem"
"description" => "ARCHETTI, C. et LJUBIC, I. (2021). Aggregated Formulations for the Inventory Routing Problem. Dans: 2021 Optimization in Artificial Intelligence and Data Sciences (ODS). Rome.
ARCHETTI, C. et LJUBIC, I. (2021). Aggregated Formulations for the Inventory Routing Problem. Dans:
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => "2021 Optimization in Artificial Intelligence and Data Sciences (ODS)"
"keywords" => []
"updatedAt" => "2023-01-27 01:00:40"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
173 => Essec\Faculty\Model\Contribution {#2535
#_index: "academ_contributions"
#_id: "5929"
#_source: array:18 [
"id" => "5929"
"slug" => "exact-approaches-for-network-design-problems-with-relays"
"yearMonth" => "2016-05"
"year" => "2016"
"title" => "Exact Approaches for Network Design Problems with Relays"
"description" => "LEITNER, M., LJUBIC, I., RIEDLER, M. et RUTHMAIR, M. (2016). Exact Approaches for Network Design Problems with Relays. Dans: 4th International Symposium on Combinatorial Optimization (ISCO 2016).
LEITNER, M., LJUBIC, I., RIEDLER, M. et RUTHMAIR, M. (2016). Exact Approaches for Network Design Pro
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER Markus"
]
2 => array:1 [
"name" => "RIEDLER Martin"
]
3 => array:1 [
"name" => "RUTHMAIR M."
]
]
"ouvrage" => "4th International Symposium on Combinatorial Optimization (ISCO 2016)"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:08"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
174 => Essec\Faculty\Model\Contribution {#2536
#_index: "academ_contributions"
#_id: "6688"
#_source: array:18 [
"id" => "6688"
"slug" => "mip-modeling-of-incremental-connected-facility-location"
"yearMonth" => "2018-05"
"year" => "2018"
"title" => "MIP Modeling of Incremental Connected Facility Location"
"description" => "ARULSELVAN, A., BLEY, A. et LJUBIC, I. (2018). MIP Modeling of Incremental Connected Facility Location. Dans: 14th Institute for Operations Research and the Management Sciences (INFORMS) Telecommunications Conference.
ARULSELVAN, A., BLEY, A. et LJUBIC, I. (2018). MIP Modeling of Incremental Connected Facility Locati
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ARULSELVAN A."
]
2 => array:1 [
"name" => "BLEY A."
]
]
"ouvrage" => "14th Institute for Operations Research and the Management Sciences (INFORMS) Telecommunications Conference
14th Institute for Operations Research and the Management Sciences (INFORMS) Telecommunications Conf
"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
175 => Essec\Faculty\Model\Contribution {#2537
#_index: "academ_contributions"
#_id: "6744"
#_source: array:18 [
"id" => "6744"
"slug" => "new-mip-models-for-liner-shipping-route-design-with-empty-container-repositioning"
"yearMonth" => "2017-02"
"year" => "2017"
"title" => "New MIP models for Liner Shipping Route Design with Empty Container Repositioning"
"description" => "ALFANDARI, L., FURINI, F., LJUBIC, I. et MARTIN, S. (2017). New MIP models for Liner Shipping Route Design with Empty Container Repositioning. Dans: 18ème Conférence ROADEF de la Société Française de Recherche Opérationnelle et d'Aide à la Décision.
ALFANDARI, L., FURINI, F., LJUBIC, I. et MARTIN, S. (2017). New MIP models for Liner Shipping Route
"
"authors" => array:4 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "FURINI F."
]
3 => array:1 [
"name" => "MARTIN S."
]
]
"ouvrage" => "18ème Conférence ROADEF de la Société Française de Recherche Opérationnelle et d'Aide à la Décision"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
176 => Essec\Faculty\Model\Contribution {#2538
#_index: "academ_contributions"
#_id: "6745"
#_source: array:18 [
"id" => "6745"
"slug" => "new-mip-models-for-liner-shipping-route-design-with-empty-container-repositioning"
"yearMonth" => "2018-04"
"year" => "2018"
"title" => "New MIP models for liner shipping route design with empty container repositioning"
"description" => "ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. et MARTIN, S. (2018). New MIP models for liner shipping route design with empty container repositioning. Dans: 4th International Conference on Logistics Operations Management (GOL'2018).
ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. et MARTIN, S. (2018). New MIP models
"
"authors" => array:6 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "DAVIDOVIC T."
]
3 => array:1 [
"name" => "FURINI F."
]
4 => array:1 [
"name" => "MARAS V."
]
5 => array:1 [
"name" => "MARTIN S."
]
]
"ouvrage" => "4th International Conference on Logistics Operations Management (GOL'2018)"
"keywords" => []
"updatedAt" => "2023-09-28 16:23:06"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
177 => Essec\Faculty\Model\Contribution {#2539
#_index: "academ_contributions"
#_id: "6762"
#_source: array:18 [
"id" => "6762"
"slug" => "on-click-interdiction-problems-in-graphs"
"yearMonth" => "2017-02"
"year" => "2017"
"title" => "On Click Interdiction Problems in Graphs"
"description" => "LJUBIC, I., FURINI, F., MARTIN, S. et SAN SEGUNDO, P. (2017). On Click Interdiction Problems in Graphs. Dans: 18ème édition du congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, ROADEF2017.
LJUBIC, I., FURINI, F., MARTIN, S. et SAN SEGUNDO, P. (2017). On Click Interdiction Problems in Grap
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI F."
]
2 => array:1 [
"name" => "MARTIN S."
]
3 => array:1 [
"name" => "SAN SEGUNDO P."
]
]
"ouvrage" => "18ème édition du congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, ROADEF2017
18ème édition du congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la D
"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
178 => Essec\Faculty\Model\Contribution {#2540
#_index: "academ_contributions"
#_id: "6766"
#_source: array:18 [
"id" => "6766"
"slug" => "on-integer-and-bilevel-formulations-for-the-k-vertex-cut-problem"
"yearMonth" => "2019-06"
"year" => "2019"
"title" => "On Integer and Bilevel Formulations for the k-Vertex Cut Problem"
"description" => "FURINI, F., LJUBIC, I., MALAGUTI, E. et PARONUZZI, P. (2019). On Integer and Bilevel Formulations for the k-Vertex Cut Problem. Dans: 2019 International Network Optimization Conference (INOC 2019).
FURINI, F., LJUBIC, I., MALAGUTI, E. et PARONUZZI, P. (2019). On Integer and Bilevel Formulations fo
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI Fabio"
]
2 => array:1 [
"name" => "MALAGUTI Enrico"
]
3 => array:1 [
"name" => "PARONUZZI Paolo"
]
]
"ouvrage" => "2019 International Network Optimization Conference (INOC 2019)"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
179 => Essec\Faculty\Model\Contribution {#2541
#_index: "academ_contributions"
#_id: "6827"
#_source: array:18 [
"id" => "6827"
"slug" => "optimal-vehicle-routing-with-autonomous-devices-for-last-mile-delivery"
"yearMonth" => "2019-06"
"year" => "2019"
"title" => "Optimal Vehicle Routing with Autonomous Devices for Last-Mile Delivery"
"description" => "ALFANDARI, L., LJUBIC, I. et MELO, M. (2019). Optimal Vehicle Routing with Autonomous Devices for Last-Mile Delivery. Dans: 2019 Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization (VeRoLog 2019).
ALFANDARI, L., LJUBIC, I. et MELO, M. (2019). Optimal Vehicle Routing with Autonomous Devices for La
"
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "MELO M."
]
]
"ouvrage" => "2019 Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization (VeRoLog 2019)"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
180 => Essec\Faculty\Model\Contribution {#2542
#_index: "academ_contributions"
#_id: "7017"
#_source: array:18 [
"id" => "7017"
"slug" => "recent-developments-on-exact-solvers-for-the-prize-collecting-steiner-tree-problem"
"yearMonth" => "2017-04"
"year" => "2017"
"title" => "Recent Developments on Exact Solvers for the (Prize-Collecting) Steiner Tree Problem"
"description" => "LJUBIC, I. (2017). Recent Developments on Exact Solvers for the (Prize-Collecting) Steiner Tree Problem. Dans: 22nd edition of the COMEX Belgian Mathematical Optimization Workshop. La-Roche-en-Ardennes.
LJUBIC, I. (2017). Recent Developments on Exact Solvers for the (Prize-Collecting) Steiner Tree Prob
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "22nd edition of the COMEX Belgian Mathematical Optimization Workshop"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
181 => Essec\Faculty\Model\Contribution {#2543
#_index: "academ_contributions"
#_id: "7145"
#_source: array:18 [
"id" => "7145"
"slug" => "solving-congested-facility-location-by-branch-and-cut"
"yearMonth" => "2016-02"
"year" => "2016"
"title" => "Solving Congested Facility Location by Branch-and-Cut"
"description" => "FISCHETTI, M., LJUBIC, I. et SINNL, M. (2016). Solving Congested Facility Location by Branch-and-Cut. Dans: 17eme Congrés Annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2016).
FISCHETTI, M., LJUBIC, I. et SINNL, M. (2016). Solving Congested Facility Location by Branch-and-Cut
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FISCHETTI M."
]
2 => array:1 [
"name" => "SINNL M."
]
]
"ouvrage" => "17eme Congrés Annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (ROADEF 2016)
17eme Congrés Annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision (RO
"
"keywords" => []
"updatedAt" => "2021-07-13 14:31:11"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
182 => Essec\Faculty\Model\Contribution {#2544
#_index: "academ_contributions"
#_id: "7297"
#_source: array:18 [
"id" => "7297"
"slug" => "the-directed-network-design-problem-with-relays"
"yearMonth" => "2018-06"
"year" => "2018"
"title" => "The Directed Network Design Problem with Relays"
"description" => "LEITNER, M., LJUBIC, I., RUTHMAIR, M. et RIEDLER, M. (2018). The Directed Network Design Problem with Relays. Dans: 7th International Workshop on Freight Transportation and Logistics 2018.
LEITNER, M., LJUBIC, I., RUTHMAIR, M. et RIEDLER, M. (2018). The Directed Network Design Problem wit
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LEITNER Markus"
]
2 => array:1 [
"name" => "RUTHMAIR Mario"
]
3 => array:1 [
"name" => "RIEDLER Martin"
]
]
"ouvrage" => "7th International Workshop on Freight Transportation and Logistics 2018"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
183 => Essec\Faculty\Model\Contribution {#2545
#_index: "academ_contributions"
#_id: "7478"
#_source: array:18 [
"id" => "7478"
"slug" => "tighter-mip-formulations-for-the-barge-container-ship-routing-problem"
"yearMonth" => "2017-07"
"year" => "2017"
"title" => "Tighter MIP Formulations for the Barge Container Ship Routing Problem"
"description" => "ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. et MARTIN, S. (2017). Tighter MIP Formulations for the Barge Container Ship Routing Problem. Dans: 21st Conference of the International Federation of Operational Research Societies (IFORS).
ALFANDARI, L., DAVIDOVIC, T., FURINI, F., LJUBIC, I., MARAS, V. et MARTIN, S. (2017). Tighter MIP Fo
"
"authors" => array:6 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "DAVIDOVIC T."
]
3 => array:1 [
"name" => "FURINI F."
]
4 => array:1 [
"name" => "MARAS V."
]
5 => array:1 [
"name" => "MARTIN S."
]
]
"ouvrage" => "21st Conference of the International Federation of Operational Research Societies (IFORS)"
"keywords" => []
"updatedAt" => "2021-09-24 10:33:27"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => null
"en" => null
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
184 => Essec\Faculty\Model\Contribution {#2546
#_index: "academ_contributions"
#_id: "14011"
#_source: array:18 [
"id" => "14011"
"slug" => "bilevel-optimization-under-uncertainty"
"yearMonth" => "2023-01"
"year" => "2023"
"title" => "Bilevel Optimization Under Uncertainty"
"description" => "LJUBIC, I. et BECK, Y. (2023). Bilevel Optimization Under Uncertainty. Dans: 25th Combinatorial Optimization Workshop in Aussois. Aussois.
LJUBIC, I. et BECK, Y. (2023). Bilevel Optimization Under Uncertainty. Dans: 25th Combinatorial Opti
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "BECK Yasmine"
]
]
"ouvrage" => "25th Combinatorial Optimization Workshop in Aussois"
"keywords" => []
"updatedAt" => "2023-11-29 16:03:11"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
185 => Essec\Faculty\Model\Contribution {#2547
#_index: "academ_contributions"
#_id: "14256"
#_source: array:18 [
"id" => "14256"
"slug" => "plenary-speaker-bilevel-optimization-under-uncertainty"
"yearMonth" => "2022-11"
"year" => "2022"
"title" => "[Plenary Speaker] Bilevel Optimization Under Uncertainty"
"description" => "BECK, Y., LJUBIC, I. et SCHMIDT, M. (2022). [Plenary Speaker] Bilevel Optimization Under Uncertainty. Dans: PGMODays 2022. Palaiseau.
BECK, Y., LJUBIC, I. et SCHMIDT, M. (2022). [Plenary Speaker] Bilevel Optimization Under Uncertainty
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "BECK Yasmine"
]
2 => array:1 [
"name" => "SCHMIDT Martin"
]
]
"ouvrage" => "PGMODays 2022"
"keywords" => []
"updatedAt" => "2023-08-29 13:16:47"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
186 => Essec\Faculty\Model\Contribution {#2548
#_index: "academ_contributions"
#_id: "14258"
#_source: array:18 [
"id" => "14258"
"slug" => "lower-bounds-for-ramsey-numbers-on-circulant-graphs"
"yearMonth" => "2022-06"
"year" => "2022"
"title" => "Lower bounds for Ramsey numbers on circulant graphs"
"description" => "FURINI, F., LJUBIC, I. et SAN SEGUNDO, P. (2022). Lower bounds for Ramsey numbers on circulant graphs. Dans: Women in Optimization 2022. Berlin.
FURINI, F., LJUBIC, I. et SAN SEGUNDO, P. (2022). Lower bounds for Ramsey numbers on circulant graph
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "FURINI Fabio"
]
2 => array:1 [
"name" => "SAN SEGUNDO Pablo"
]
]
"ouvrage" => "Women in Optimization 2022"
"keywords" => []
"updatedAt" => "2023-08-29 13:27:18"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
187 => Essec\Faculty\Model\Contribution {#2549
#_index: "academ_contributions"
#_id: "14259"
#_source: array:18 [
"id" => "14259"
"slug" => "comparison-of-formulations-for-the-inventory-routing-problem"
"yearMonth" => "2022-06"
"year" => "2022"
"title" => "Comparison of Formulations for the Inventory Routing Problem"
"description" => "ARCHETTI, C. et LJUBIC, I. (2022). Comparison of Formulations for the Inventory Routing Problem. Dans: 3rd Workshop on Combinatorial Optimization. Online.
ARCHETTI, C. et LJUBIC, I. (2022). Comparison of Formulations for the Inventory Routing Problem. Dan
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => "3rd Workshop on Combinatorial Optimization"
"keywords" => []
"updatedAt" => "2023-08-29 13:30:14"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
188 => Essec\Faculty\Model\Contribution {#2550
#_index: "academ_contributions"
#_id: "14347"
#_source: array:18 [
"id" => "14347"
"slug" => "recent-advances-in-discrete-and-robust-bilevel-optimization"
"yearMonth" => "2023-09"
"year" => "2023"
"title" => "Recent Advances in Discrete and Robust Bilevel Optimization"
"description" => "LJUBIC, I. (2023). Recent Advances in Discrete and Robust Bilevel Optimization. Dans: 2023 Kaiserslautern Applied and Industrial Mathematics Days (KLAIM 2023). Kaiserslautern.
LJUBIC, I. (2023). Recent Advances in Discrete and Robust Bilevel Optimization. Dans: 2023 Kaisersla
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "2023 Kaiserslautern Applied and Industrial Mathematics Days (KLAIM 2023)"
"keywords" => []
"updatedAt" => "2023-09-27 01:00:43"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
189 => Essec\Faculty\Model\Contribution {#2551
#_index: "academ_contributions"
#_id: "14367"
#_source: array:18 [
"id" => "14367"
"slug" => "bilevel-optimization-under-uncertainty"
"yearMonth" => "2023-08"
"year" => "2023"
"title" => "Bilevel Optimization Under Uncertainty"
"description" => "LJUBIC, I. (2023). Bilevel Optimization Under Uncertainty. Dans: 2023 International Conference on Bilevel Optimization. Southampton.
LJUBIC, I. (2023). Bilevel Optimization Under Uncertainty. Dans: 2023 International Conference on Bi
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "2023 International Conference on Bilevel Optimization"
"keywords" => []
"updatedAt" => "2023-09-27 01:00:43"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
190 => Essec\Faculty\Model\Contribution {#2552
#_index: "academ_contributions"
#_id: "14247"
#_source: array:18 [
"id" => "14247"
"slug" => "exact-methods-for-discrete-%ce%b3-robust-interdiction-problems-with-an-application-to-the-bilevel-knapsack-problem
exact-methods-for-discrete-%ce%b3-robust-interdiction-problems-with-an-application-to-the-bilevel-kn
"
"yearMonth" => "2023-12"
"year" => "2023"
"title" => "Exact methods for discrete Γ-robust interdiction problems with an application to the bilevel knapsack problem
Exact methods for discrete Γ-robust interdiction problems with an application to the bilevel knapsac
"
"description" => "BECK, Y., LJUBIC, I. et SCHMIDT, M. (2023). Exact methods for discrete Γ-robust interdiction problems with an application to the bilevel knapsack problem. <i>Mathematical Programming Computation</i>, 15(4), pp. 733-782.
BECK, Y., LJUBIC, I. et SCHMIDT, M. (2023). Exact methods for discrete Γ-robust interdiction problem
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "BECK Yasmine"
]
2 => array:1 [
"name" => "SCHMIDT Martin"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Bilevel optimization – Robust optimization"
1 => "Knapsack interdiction"
2 => "Mixed-integer programming"
3 => "Branch-and-Cut"
]
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://doi.org/10.1007/s12532-023-00244-6"
"publicationInfo" => array:3 [
"pages" => "733-782"
"volume" => "15"
"number" => "4"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Developing solution methods for discrete bilevel problems is known to be a challenging task—even if all parameters of the problem are exactly known. Many real-world applications of bilevel optimization, however, involve data uncertainty. We study discrete min-max problems with a follower who faces uncertainties regarding the parameters of the lower-level problem. Adopting a Γ-robust approach, we present an extended formulation and a multi-follower formulation to model this type of problem. For both settings, we provide a generic branch-and-cut framework. Specifically, we investigate interdiction problems with a monotone Γ-robust follower and we derive problem-tailored cuts, which extend existing techniques that have been proposed for the deterministic case. For the Γ-robust knapsack interdiction problem, we computationally evaluate and compare the performance of the proposed algorithms for both modeling approaches.
Developing solution methods for discrete bilevel problems is known to be a challenging task—even if
"
"en" => "Developing solution methods for discrete bilevel problems is known to be a challenging task—even if all parameters of the problem are exactly known. Many real-world applications of bilevel optimization, however, involve data uncertainty. We study discrete min-max problems with a follower who faces uncertainties regarding the parameters of the lower-level problem. Adopting a Γ-robust approach, we present an extended formulation and a multi-follower formulation to model this type of problem. For both settings, we provide a generic branch-and-cut framework. Specifically, we investigate interdiction problems with a monotone Γ-robust follower and we derive problem-tailored cuts, which extend existing techniques that have been proposed for the deterministic case. For the Γ-robust knapsack interdiction problem, we computationally evaluate and compare the performance of the proposed algorithms for both modeling approaches.
Developing solution methods for discrete bilevel problems is known to be a challenging task—even if
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
191 => Essec\Faculty\Model\Contribution {#2553
#_index: "academ_contributions"
#_id: "14257"
#_source: array:18 [
"id" => "14257"
"slug" => "a-tailored-benders-decomposition-approach-for-last-mile-delivery-with-autonomous-robots"
"yearMonth" => "2022-02"
"year" => "2022"
"title" => "A Tailored Benders Decomposition Approach for Last-mile Delivery with Autonomous Robots"
"description" => "ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2022). A Tailored Benders Decomposition Approach for Last-mile Delivery with Autonomous Robots. Dans: International Conference on Operations Research and Enterprise Systems (ICORES). Online.
ALFANDARI, L., LJUBIC, I. et DE MELO DA SILVA, M. (2022). A Tailored Benders Decomposition Approach
"
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "DE MELO DA SILVA Marcos"
]
]
"ouvrage" => "International Conference on Operations Research and Enterprise Systems (ICORES)"
"keywords" => []
"updatedAt" => "2023-08-29 13:21:46"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
192 => Essec\Faculty\Model\Contribution {#2554
#_index: "academ_contributions"
#_id: "14265"
#_source: array:18 [
"id" => "14265"
"slug" => "socp-based-disjunctive-cuts-for-a-class-of-integer-nonlinear-bilevel-programs"
"yearMonth" => "2022-06"
"year" => "2022"
"title" => "SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs"
"description" => "GAAR, E., LEE, J., LJUBIC, I., SINNL, M. et TANINMIŞ, K. (2022). SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs. Dans: Karen Aardal, Laura Sanità eds. <i>Integer Programming and Combinatorial Optimization</i>. 1st ed. Cham: Springer, pp. 262-276.
GAAR, E., LEE, J., LJUBIC, I., SINNL, M. et TANINMIŞ, K. (2022). SOCP-Based Disjunctive Cuts for a C
"
"authors" => array:5 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "GAAR Elisabeth"
]
2 => array:1 [
"name" => "LEE Jon"
]
3 => array:1 [
"name" => "SINNL Markus"
]
4 => array:1 [
"name" => "TANINMIŞ Kübra"
]
]
"ouvrage" => "Integer Programming and Combinatorial Optimization"
"keywords" => array:5 [
0 => "Bilevel optimization"
1 => "Disjunctive cuts"
2 => "Conic optimization"
3 => "Nonlinear optimization"
4 => "Branch-and-cut"
]
"updatedAt" => "2024-02-23 10:27:12"
"publicationUrl" => "https://link.springer.com/chapter/10.1007/978-3-031-06901-7_20"
"publicationInfo" => array:3 [
"pages" => "262-276"
"volume" => "13265"
"number" => ""
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We study a class of bilevel integer programs with second-order cone constraints at the upper level and a convex quadratic objective and linear constraints at the lower level. We develop disjunctive cuts to separate bilevel infeasible points using a second-order-cone-based cut-generating procedure. To the best of our knowledge, this is the first time disjunctive cuts are studied in the context of discrete bilevel optimization. Using these disjunctive cuts, we establish a branch-and-cut algorithm for the problem class we study, and a cutting plane method for the problem variant with only binary variables. We present a preliminary computational study on instances with no second-order cone constraints at the upper level and a single linear constraint at the lower level. Our study demonstrates that both our approaches outperform a state-of-the-art generic solver for mixed-integer bilevel linear programs that is able to solve a linearized version of our test instances, where the non-linearities are linearized in a McCormick fashion.
We study a class of bilevel integer programs with second-order cone constraints at the upper level a
"
"en" => "We study a class of bilevel integer programs with second-order cone constraints at the upper level and a convex quadratic objective and linear constraints at the lower level. We develop disjunctive cuts to separate bilevel infeasible points using a second-order-cone-based cut-generating procedure. To the best of our knowledge, this is the first time disjunctive cuts are studied in the context of discrete bilevel optimization. Using these disjunctive cuts, we establish a branch-and-cut algorithm for the problem class we study, and a cutting plane method for the problem variant with only binary variables. We present a preliminary computational study on instances with no second-order cone constraints at the upper level and a single linear constraint at the lower level. Our study demonstrates that both our approaches outperform a state-of-the-art generic solver for mixed-integer bilevel linear programs that is able to solve a linearized version of our test instances, where the non-linearities are linearized in a McCormick fashion.
We study a class of bilevel integer programs with second-order cone constraints at the upper level a
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
193 => Essec\Faculty\Model\Contribution {#2555
#_index: "academ_contributions"
#_id: "14358"
#_source: array:18 [
"id" => "14358"
"slug" => "benders-adaptive-cuts-method-for-two-stage-stochastic-programs"
"yearMonth" => "2023-09"
"year" => "2023"
"title" => "Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs"
"description" => "RAMÍREZ-PICO, C., LJUBIC, I. et MORENO, E. (2023). Benders Adaptive-Cuts Method for Two-Stage Stochastic Programs. Dans: 2023 The International Conference on Optimization and Decision Science. Ischia.
RAMÍREZ-PICO, C., LJUBIC, I. et MORENO, E. (2023). Benders Adaptive-Cuts Method for Two-Stage Stocha
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "RAMÍREZ-PICO Cristian"
]
2 => array:1 [
"name" => "MORENO Eduardo"
]
]
"ouvrage" => "2023 The International Conference on Optimization and Decision Science"
"keywords" => []
"updatedAt" => "2024-03-18 11:04:35"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
194 => Essec\Faculty\Model\Contribution {#2556
#_index: "academ_contributions"
#_id: "14360"
#_source: array:18 [
"id" => "14360"
"slug" => "robust-facility-location-in-disaster-preparation-for-earthquakes-with-aftershocks"
"yearMonth" => "2023-09"
"year" => "2023"
"title" => "Robust Facility Location in Disaster Preparation for Earthquakes with Aftershocks"
"description" => "ALFANDARI, L., LJUBIC, I. et PUNAM-MANDAL, M. (2023). Robust Facility Location in Disaster Preparation for Earthquakes with Aftershocks. Dans: OR 2023: Decision Support & Choice-Based Analytics for a Disruptive World. Hamburg.
ALFANDARI, L., LJUBIC, I. et PUNAM-MANDAL, M. (2023). Robust Facility Location in Disaster Preparati
"
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "PUNAM-MANDAL M"
]
]
"ouvrage" => "OR 2023: Decision Support & Choice-Based Analytics for a Disruptive World"
"keywords" => []
"updatedAt" => "2023-09-27 01:00:43"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
195 => Essec\Faculty\Model\Contribution {#2557
#_index: "academ_contributions"
#_id: "14368"
#_source: array:18 [
"id" => "14368"
"slug" => "bilevel-optimization-under-uncertainty-challenges-and-opportunities"
"yearMonth" => "2023-06"
"year" => "2023"
"title" => "Bilevel Optimization Under Uncertainty: Challenges and Opportunities"
"description" => "LJUBIC, I. (2023). Bilevel Optimization Under Uncertainty: Challenges and Opportunities. Dans: 20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023). Nice.
LJUBIC, I. (2023). Bilevel Optimization Under Uncertainty: Challenges and Opportunities. Dans: 20th
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "20th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2023)
20th International Conference on the Integration of Constraint Programming, Artificial Intelligence,
"
"keywords" => []
"updatedAt" => "2023-09-27 01:00:43"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
196 => Essec\Faculty\Model\Contribution {#2558
#_index: "academ_contributions"
#_id: "14373"
#_source: array:18 [
"id" => "14373"
"slug" => "submodular-maximization-of-concave-utility-functions-composed-with-set-union-operator-with-applications-to-maximal-coverin-locati-problems
submodular-maximization-of-concave-utility-functions-composed-with-set-union-operator-with-applicati
"
"yearMonth" => "2023-06"
"year" => "2023"
"title" => "Submodular Maximization of Concave Utility Functions Composed with Set-Union Operator with Applications to Maximal Coverin Locati Problems
Submodular Maximization of Concave Utility Functions Composed with Set-Union Operator with Applicati
"
"description" => "LJUBIC, I., CONIGLIO, S. et FURINI, F. (2023). Submodular Maximization of Concave Utility Functions Composed with Set-Union Operator with Applications to Maximal Coverin Locati Problems. Dans: Treizième édition des Journées Polyèdres et Optimisation Combinatoire (JPOC13). Clermont-Ferrand.
LJUBIC, I., CONIGLIO, S. et FURINI, F. (2023). Submodular Maximization of Concave Utility Functions
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "CONIGLIO Stefano"
]
2 => array:1 [
"name" => "FURINI Fabio"
]
]
"ouvrage" => "Treizième édition des Journées Polyèdres et Optimisation Combinatoire (JPOC13)"
"keywords" => []
"updatedAt" => "2023-09-27 01:00:43"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
197 => Essec\Faculty\Model\Contribution {#2559
#_index: "academ_contributions"
#_id: "14483"
#_source: array:18 [
"id" => "14483"
"slug" => "when-public-transport-delivers"
"yearMonth" => "2023-09"
"year" => "2023"
"title" => "When public transport delivers"
"description" => "DELLE DONNE, D., ARCHETTI, C., LJUBIC, I. et ALFANDARI, L. (2023). When public transport delivers. <i>ESSEC Knowledge</i>.
DELLE DONNE, D., ARCHETTI, C., LJUBIC, I. et ALFANDARI, L. (2023). When public transport delivers. <
"
"authors" => array:4 [
0 => array:3 [
"name" => "DELLE DONNE Diego"
"bid" => "B00788133"
"slug" => "delle-donne-diego"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
3 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => ""
"keywords" => []
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://knowledge.essec.edu/en/sustainability/when-public-transport-delivers.html"
"publicationInfo" => array:3 [
"pages" => null
"volume" => null
"number" => null
]
"type" => array:2 [
"fr" => "Articles ou vidéos de vulgarisation"
"en" => "Press article, video or other popular media"
]
"support_type" => array:2 [
"fr" => "Presse"
"en" => "Press"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "E-commerce is now part of the consumer experience – why brave a busy mall when you could get your shopping delivered to your doorstep, and return it for free if you don’t like it? This trend has exploded: in the US, e-commerce consumer spending is projected to reach one trillion USD (1), and in China, over 40 billion packages were delivered in 2017 (2). While undeniably practical for the consumer, this presents challenges for the companies and for the environment, since consumers expect fast delivery and this can be a costly process. This results in an abundance of commercial vehicles traveling to make home deliveries: an unsustainable system both in terms of feasibility and environmental impact. These commercial vehicles add to pollution and traffic congestion. The authors explored the challenges of last-mile delivery (the last leg of the distribution process) and how emerging technologies, including AI, can play a role in reducing the pollution caused by urban freight transportation. In their latest paper published in Transportation Research Part B (3), they explore the possibility of using “freight-on-transit” delivery methods: using public transportation to transport packages in big cities.
E-commerce is now part of the consumer experience – why brave a busy mall when you could get your sh
"
"en" => "E-commerce is now part of the consumer experience – why brave a busy mall when you could get your shopping delivered to your doorstep, and return it for free if you don’t like it? This trend has exploded: in the US, e-commerce consumer spending is projected to reach one trillion USD (1), and in China, over 40 billion packages were delivered in 2017 (2). While undeniably practical for the consumer, this presents challenges for the companies and for the environment, since consumers expect fast delivery and this can be a costly process. This results in an abundance of commercial vehicles traveling to make home deliveries: an unsustainable system both in terms of feasibility and environmental impact. These commercial vehicles add to pollution and traffic congestion. The authors explored the challenges of last-mile delivery (the last leg of the distribution process) and how emerging technologies, including AI, can play a role in reducing the pollution caused by urban freight transportation. In their latest paper published in Transportation Research Part B (3), they explore the possibility of using “freight-on-transit” delivery methods: using public transportation to transport packages in big cities.
E-commerce is now part of the consumer experience – why brave a busy mall when you could get your sh
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
198 => Essec\Faculty\Model\Contribution {#2560
#_index: "academ_contributions"
#_id: "14558"
#_source: array:18 [
"id" => "14558"
"slug" => "new-formulations-for-two-location-problems-with-interconnected-facilities"
"yearMonth" => "2024-04"
"year" => "2024"
"title" => "New formulations for two location problems with interconnected facilities"
"description" => "KUZBAKOV, Y. et LJUBIC, I. (2024). New formulations for two location problems with interconnected facilities. <i>European Journal of Operational Research</i>, 31(1), pp. 51-65.
KUZBAKOV, Y. et LJUBIC, I. (2024). New formulations for two location problems with interconnected fa
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "KUZBAKOV Yerlan"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Combinatorial optimization"
1 => "Discrete location problems"
2 => "Network design"
3 => "Branch-and-cut"
4 => "Benders decomposition"
]
"updatedAt" => "2023-12-18 10:46:31"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2023.09.030"
"publicationInfo" => array:3 [
"pages" => "51-65"
"volume" => "31"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "This paper studies two location problems with interconnected facilities. In the first problem, all customers need to be served by open facilities, and in the second (covering) variant a penalty is imposed for customers that cannot receive the service. Compared to the standard facility location setting, an additional constraint is imposed asking that all open facilities are interconnected, i.e., all open facilities need to be within a given radius of each other. These problems combine classical facility location aspects with network design, and we exploit this link to derive new mixed integer programming models. The strength of these models is investigated both theoretically and empirically. An extensive computational study is conducted on a set of benchmark instances from the literature, in which branch-and-cut, Benders decomposition and compact models are assessed in terms of the runtime and the resulting gaps.
This paper studies two location problems with interconnected facilities. In the first problem, all c
"
"en" => "This paper studies two location problems with interconnected facilities. In the first problem, all customers need to be served by open facilities, and in the second (covering) variant a penalty is imposed for customers that cannot receive the service. Compared to the standard facility location setting, an additional constraint is imposed asking that all open facilities are interconnected, i.e., all open facilities need to be within a given radius of each other. These problems combine classical facility location aspects with network design, and we exploit this link to derive new mixed integer programming models. The strength of these models is investigated both theoretically and empirically. An extensive computational study is conducted on a set of benchmark instances from the literature, in which branch-and-cut, Benders decomposition and compact models are assessed in terms of the runtime and the resulting gaps.
This paper studies two location problems with interconnected facilities. In the first problem, all c
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
199 => Essec\Faculty\Model\Contribution {#2561
#_index: "academ_contributions"
#_id: "14661"
#_source: array:18 [
"id" => "14661"
"slug" => "mathematical-programming-formulations-for-the-collapsed-k-core-problem"
"yearMonth" => "2023-12"
"year" => "2023"
"title" => "Mathematical Programming Formulations for the Collapsed k-Core Problem"
"description" => "CERULLI, M., DOMENICO, S., SORGENTE, C., ARCHETTI, C. et LJUBIC, I. (2023). Mathematical Programming Formulations for the Collapsed k-Core Problem. Dans: 2023 Mathematics & Applications, Winter Meeting. Lisbon.
CERULLI, M., DOMENICO, S., SORGENTE, C., ARCHETTI, C. et LJUBIC, I. (2023). Mathematical Programming
"
"authors" => array:5 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "CERULLI Martina"
]
2 => array:1 [
"name" => "Domenico Serra"
]
3 => array:1 [
"name" => "Sorgente Carmine"
]
4 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => "2023 Mathematics & Applications, Winter Meeting"
"keywords" => []
"updatedAt" => "2025-02-13 14:05:56"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Invité dans une conférence académique (Keynote speaker)"
"en" => "Invited speaker at an academic conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
200 => Essec\Faculty\Model\Contribution {#2562
#_index: "academ_contributions"
#_id: "14637"
#_source: array:18 [
"id" => "14637"
"slug" => "operational-research-methods-and-applications"
"yearMonth" => "2024-03"
"year" => "2024"
"title" => "Operational Research: methods and applications"
"description" => "PETROPOULOS, F., LAPORTE, G., AKTAS, E., ALUMUR, S.A., ARCHETTI, C., AYHAN, H. ... ZHAO, X. (2024). Operational Research: methods and applications. <i>Journal of the Operational Research Society</i>, 75(3), pp. 423-617.
PETROPOULOS, F., LAPORTE, G., AKTAS, E., ALUMUR, S.A., ARCHETTI, C., AYHAN, H. ... ZHAO, X. (2024).
"
"authors" => array:82 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "Petropoulos Fotios"
]
2 => array:1 [
"name" => "Laporte Gilbert"
]
3 => array:1 [
"name" => "Aktas Emel"
]
4 => array:1 [
"name" => "Alumur Sibel A."
]
5 => array:1 [
"name" => "ARCHETTI Claudia"
]
6 => array:1 [
"name" => "Ayhan Hayriye"
]
7 => array:1 [
"name" => "Battarra Maria"
]
8 => array:1 [
"name" => "Bennell Julia A."
]
9 => array:1 [
"name" => "Bourjolly Jean-Marie"
]
10 => array:1 [
"name" => "Boylan John E."
]
11 => array:1 [
"name" => "Breton Michèle"
]
12 => array:1 [
"name" => "Canca David"
]
13 => array:1 [
"name" => "Charlin Laurent"
]
14 => array:1 [
"name" => "Chen Bo"
]
15 => array:1 [
"name" => "Cicek Cihan Tugrul"
]
16 => array:1 [
"name" => "Cox Louis Anthony"
]
17 => array:1 [
"name" => "Currie Christine S.M."
]
18 => array:1 [
"name" => "Demeulemeester Erik"
]
19 => array:1 [
"name" => "Ding Li"
]
20 => array:1 [
"name" => "Disney Stephen M."
]
21 => array:1 [
"name" => "Ehrgott Matthias"
]
22 => array:1 [
"name" => "Eppler Martin J."
]
23 => array:1 [
"name" => "Erdoğan Güneş"
]
24 => array:1 [
"name" => "Fortz Bernard"
]
25 => array:1 [
"name" => "Franco L. Alberto"
]
26 => array:1 [
"name" => "Frische Jens"
]
27 => array:1 [
"name" => "Greco Salvatore"
]
28 => array:1 [
"name" => "Gregory Amanda J."
]
29 => array:1 [
"name" => "Hämäläinen Raimo P."
]
30 => array:1 [
"name" => "Herroelen Willy"
]
31 => array:1 [
"name" => "Hewitt Mike"
]
32 => array:1 [
"name" => "Holmström Jan"
]
33 => array:1 [
"name" => "Hooker John N."
]
34 => array:1 [
"name" => "Işık Tuğçe"
]
35 => array:1 [
"name" => "Johnes Jill"
]
36 => array:1 [
"name" => "Kara Bahar Y."
]
37 => array:1 [
"name" => "Karsu Özlem"
]
38 => array:1 [
"name" => "Kent Katherine"
]
39 => array:1 [
"name" => "Köhler Charlotte"
]
40 => array:1 [
"name" => "Kunc Martin"
]
41 => array:1 [
"name" => "Kuo Yong-Hong"
]
42 => array:1 [
"name" => "Letchford Adam N."
]
43 => array:1 [
"name" => "Leung Janny"
]
44 => array:1 [
"name" => "Li Dong"
]
45 => array:1 [
"name" => "Li Haitao"
]
46 => array:1 [
"name" => "Lienert Judit"
]
47 => array:1 [
"name" => "Lodi Andrea"
]
48 => array:1 [
"name" => "Lozano Sebastián"
]
49 => array:1 [
"name" => "Lurkin Virginie"
]
50 => array:1 [
"name" => "Martello Silvano"
]
51 => array:1 [
"name" => "McHale Ian G."
]
52 => array:1 [
"name" => "Midgley Gerald"
]
53 => array:1 [
"name" => "Morecroft John D.W."
]
54 => array:1 [
"name" => "Mutha Akshay"
]
55 => array:1 [
"name" => "Oğuz Ceyda"
]
56 => array:1 [
"name" => "Petrovic Sanja"
]
57 => array:1 [
"name" => "Pferschy Ulrich"
]
58 => array:1 [
"name" => "Psaraftis Harilaos N."
]
59 => array:1 [
"name" => "Rose Sam"
]
60 => array:1 [
"name" => "Saarinen Lauri"
]
61 => array:1 [
"name" => "Salhi Said"
]
62 => array:1 [
"name" => "Song Jing-Sheng"
]
63 => array:1 [
"name" => "Sotiros Dimitrios"
]
64 => array:1 [
"name" => "Stecke Kathryn E."
]
65 => array:1 [
"name" => "Strauss Arne K."
]
66 => array:1 [
"name" => "Tarhan İstenç"
]
67 => array:1 [
"name" => "Thielen Clemens"
]
68 => array:1 [
"name" => "Toth Paolo"
]
69 => array:1 [
"name" => "Van Woensel Tom"
]
70 => array:1 [
"name" => "Berghe Greet Vanden"
]
71 => array:1 [
"name" => "Vasilakis Christos"
]
72 => array:1 [
"name" => "Vaze Vikrant"
]
73 => array:1 [
"name" => "Vigo Daniele"
]
74 => array:1 [
"name" => "Virtanen Kai"
]
75 => array:1 [
"name" => "Wang Xun"
]
76 => array:1 [
"name" => "Weron Rafał"
]
77 => array:1 [
"name" => "White Leroy"
]
78 => array:1 [
"name" => "Yearworth Mike"
]
79 => array:1 [
"name" => "Yıldırım E. Alper"
]
80 => array:1 [
"name" => "Zaccour Georges"
]
81 => array:1 [
"name" => "Zhao Xuying"
]
]
"ouvrage" => ""
"keywords" => array:11 [
0 => "Review"
1 => "encyclopedia"
2 => "theory"
3 => "practice"
4 => "principles"
5 => "optimisation"
6 => "programming"
7 => "systems"
8 => "simulation"
9 => "decision making"
10 => "models"
]
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://www.tandfonline.com/doi/full/10.1080/01605682.2023.2253852"
"publicationInfo" => array:3 [
"pages" => "423-617"
"volume" => "75"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "Throughout its history, Operational Research has evolved to include methods, models and algorithms that have been applied to a wide range of contexts. This encyclopedic article consists of two main sections: methods and applications. The first summarises the up-to-date knowledge and provides an overview of the state-of-the-art methods and key developments in the various subdomains of the field. The second offers a wide-ranging list of areas where Operational Research has been applied. The article is meant to be read in a nonlinear fashion and used as a point of reference by a diverse pool of readers: academics, researchers, students, and practitioners. The entries within the methods and applications sections are presented in alphabetical order. The authors dedicate this paper to the 2023 Turkey/Syria earthquake victims. We sincerely hope that advances in OR will play a role towards minimising the pain and suffering caused by this and future catastrophes.
Throughout its history, Operational Research has evolved to include methods, models and algorithms t
"
"en" => "Throughout its history, Operational Research has evolved to include methods, models and algorithms that have been applied to a wide range of contexts. This encyclopedic article consists of two main sections: methods and applications. The first summarises the up-to-date knowledge and provides an overview of the state-of-the-art methods and key developments in the various subdomains of the field. The second offers a wide-ranging list of areas where Operational Research has been applied. The article is meant to be read in a nonlinear fashion and used as a point of reference by a diverse pool of readers: academics, researchers, students, and practitioners. The entries within the methods and applications sections are presented in alphabetical order. The authors dedicate this paper to the 2023 Turkey/Syria earthquake victims. We sincerely hope that advances in OR will play a role towards minimising the pain and suffering caused by this and future catastrophes.
Throughout its history, Operational Research has evolved to include methods, models and algorithms t
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
201 => Essec\Faculty\Model\Contribution {#2563
#_index: "academ_contributions"
#_id: "14804"
#_source: array:18 [
"id" => "14804"
"slug" => "benders-decomposition-for-the-discrete-ordered-median-problem"
"yearMonth" => "2024-09"
"year" => "2024"
"title" => "Benders decomposition for the discrete ordered median problem"
"description" => "LJUBIC, I., POZO, M.A., PUERTO, J. et TORREJÓN, A. (2024). Benders decomposition for the discrete ordered median problem. <i>European Journal of Operational Research</i>, 317(3), pp. 858-874.
LJUBIC, I., POZO, M.A., PUERTO, J. et TORREJÓN, A. (2024). Benders decomposition for the discrete or
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "Pozo Miguel A."
]
2 => array:1 [
"name" => "Puerto Justo"
]
3 => array:1 [
"name" => "Torrejón Alberto"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "Discrete location"
1 => "Ordered median optimization"
2 => "Benders decomposition"
3 => "Branch-and-Benders-cut"
]
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2024.04.030"
"publicationInfo" => array:3 [
"pages" => "858-874"
"volume" => "317"
"number" => "3"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
Ordered median optimization has been proven to be a powerful tool to generalize many well-known problems from the literature. In Location Theory, the Discrete Ordered Median Problem (DOMP) is a facility location problem where clients are first ranked according to their allocation cost to the nearest open facility, and then these costs are multiplied by a suitable weight vector \n
Ordered median optimization has been proven to be a powerful tool to generalize many well-known prob
. That way, DOMP generalizes many well-known discrete location problems including \n
-median, \n
-center or centdian. In this article, we also allow negative entries of \n
, allowing us to derive models for better addressing equity and fairness in facility location, for modeling obnoxious facility location problems or for including other client preference models. We present new mixed integer programming models for DOMP along with algorithmic enhancements for solving the DOMP to optimality using mixed integer programming techniques. Specifically, starting from state-of-the-art formulations from the literature, we present several Benders decomposition reformulations applied to them. Using these approaches, new state-of-the-art results have been obtained for different ordered weighting vectors.
, allowing us to derive models for better addressing equity and fairness in facility location, for m
"""
"en" => """
Ordered median optimization has been proven to be a powerful tool to generalize many well-known problems from the literature. In Location Theory, the Discrete Ordered Median Problem (DOMP) is a facility location problem where clients are first ranked according to their allocation cost to the nearest open facility, and then these costs are multiplied by a suitable weight vector \n
Ordered median optimization has been proven to be a powerful tool to generalize many well-known prob
. That way, DOMP generalizes many well-known discrete location problems including \n
-median, \n
-center or centdian. In this article, we also allow negative entries of \n
, allowing us to derive models for better addressing equity and fairness in facility location, for modeling obnoxious facility location problems or for including other client preference models. We present new mixed integer programming models for DOMP along with algorithmic enhancements for solving the DOMP to optimality using mixed integer programming techniques. Specifically, starting from state-of-the-art formulations from the literature, we present several Benders decomposition reformulations applied to them. Using these approaches, new state-of-the-art results have been obtained for different ordered weighting vectors.
, allowing us to derive models for better addressing equity and fairness in facility location, for m
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
202 => Essec\Faculty\Model\Contribution {#2564
#_index: "academ_contributions"
#_id: "14819"
#_source: array:18 [
"id" => "14819"
"slug" => "exact-approaches-for-network-design-problems-with-relays"
"yearMonth" => "2019-02"
"year" => "2019"
"title" => "Exact Approaches for Network Design Problems with Relays"
"description" => "LEITNER, M., LJUBIC, I., RIEDLER, M. et RUTHMAIR, M. (2019). Exact Approaches for Network Design Problems with Relays. <i>INFORMS Journal on Computing</i>, 31(1), pp. 171-192.
LEITNER, M., LJUBIC, I., RIEDLER, M. et RUTHMAIR, M. (2019). Exact Approaches for Network Design Pro
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "Leitner Markus"
]
2 => array:1 [
"name" => "Riedler Martin"
]
3 => array:1 [
"name" => "Ruthmair Mario"
]
]
"ouvrage" => ""
"keywords" => array:3 [
0 => "network design with relays"
1 => "telecommunications"
2 => "integer programming branch-and-price"
]
"updatedAt" => "2024-10-31 13:51:19"
"publicationUrl" => "https://doi.org/10.1287/ijoc.2018.0820"
"publicationInfo" => array:3 [
"pages" => "171-192"
"volume" => "31"
"number" => "1"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In this article we consider the network design problem with relays (NDPR), which gives answers to some important strategic design questions in telecommunication network design. Given a family of origin-destination pairs and a set of existing links these questions are as follows: (1) What are the optimal locations for signal regeneration devices (relays) and how many of them are needed? (2) Could the available infrastructure be enhanced by installing additional links in order to reduce the travel distance and therefore reduce the number of necessary relays?
In this article we consider the network design problem with relays (NDPR), which gives answers to so
"
"en" => "In this article we consider the network design problem with relays (NDPR), which gives answers to some important strategic design questions in telecommunication network design. Given a family of origin-destination pairs and a set of existing links these questions are as follows: (1) What are the optimal locations for signal regeneration devices (relays) and how many of them are needed? (2) Could the available infrastructure be enhanced by installing additional links in order to reduce the travel distance and therefore reduce the number of necessary relays?
In this article we consider the network design problem with relays (NDPR), which gives answers to so
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
203 => Essec\Faculty\Model\Contribution {#2565
#_index: "academ_contributions"
#_id: "14887"
#_source: array:18 [
"id" => "14887"
"slug" => "robust-facility-location-for-earthquake-preparedness-with-aftershocks"
"yearMonth" => "2024-04"
"year" => "2024"
"title" => "Robust facility location for earthquake preparedness with aftershocks"
"description" => "ALFANDARI, L., LJUBIC, I. et PUNAM-MANDAL, M. (2024). Robust facility location for earthquake preparedness with aftershocks. Dans: 2024 Optimisation au deuxième niveau (Centre International de Rencontres Mathématiques). Marseille.
ALFANDARI, L., LJUBIC, I. et PUNAM-MANDAL, M. (2024). Robust facility location for earthquake prepar
"
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "PUNAM-MANDAL Minakshi"
]
]
"ouvrage" => "2024 Optimisation au deuxième niveau (Centre International de Rencontres Mathématiques)"
"keywords" => []
"updatedAt" => "2024-07-10 01:01:22"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
204 => Essec\Faculty\Model\Contribution {#2566
#_index: "academ_contributions"
#_id: "14919"
#_source: array:18 [
"id" => "14919"
"slug" => "fractional-programming-for-assortment-optimization"
"yearMonth" => "2024-05"
"year" => "2024"
"title" => "Fractional programming for Assortment optimization"
"description" => "ALFANDARI, L., HASSANZADEH, A. et LJUBIC, I. (2024). Fractional programming for Assortment optimization. Dans: 2024 International Symposium on Combinatorial Optimization (ISCO). Tenerife.
ALFANDARI, L., HASSANZADEH, A. et LJUBIC, I. (2024). Fractional programming for Assortment optimizat
"
"authors" => array:3 [
0 => array:3 [
"name" => "ALFANDARI Laurent"
"bid" => "B00000901"
"slug" => "alfandari-laurent"
]
1 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
2 => array:1 [
"name" => "HASSANZADEH Alborz"
]
]
"ouvrage" => "2024 International Symposium on Combinatorial Optimization (ISCO)"
"keywords" => []
"updatedAt" => "2024-07-10 01:01:23"
"publicationUrl" => null
"publicationInfo" => array:3 [
"pages" => ""
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Communications dans une conférence"
"en" => "Presentations at an Academic or Professional conference"
]
"support_type" => array:2 [
"fr" => null
"en" => null
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => ""
"en" => ""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
205 => Essec\Faculty\Model\Contribution {#2567
#_index: "academ_contributions"
#_id: "15000"
#_source: array:18 [
"id" => "15000"
"slug" => "three-network-design-problems-for-community-energy-storage"
"yearMonth" => "2024-12"
"year" => "2024"
"title" => "Three network design problems for community energy storage"
"description" => "GHADDAR, B., LJUBIC, I. et QIU, Y. (2024). Three network design problems for community energy storage. <i>Networks</i>, 84(4), pp. 420-445.
GHADDAR, B., LJUBIC, I. et QIU, Y. (2024). Three network design problems for community energy storag
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "Ghaddar Bissan"
]
2 => array:1 [
"name" => "Qiu Yuying"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "community energy storage"
1 => "decentralized energy resources"
2 => "energy management system"
3 => "mixed integer linear programming"
4 => "OR in energy"
]
"updatedAt" => "2024-12-12 11:25:41"
"publicationUrl" => "https://doi.org/10.1002/net.22242"
"publicationInfo" => array:3 [
"pages" => "420-445"
"volume" => "84"
"number" => "4"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In this article, we develop novel mathematical models to optimize utilization of community energy storage (CES) by clustering prosumers and consumers into energy sharing communities/microgrids in the context of a smart city. Three different microgrid configurations are modeled using a unifying mixed-integer linear programming formulation. These configurations represent three different business models, namely: the island model, the interconnected model, and the Energy Service Companies model. The proposed mathematical formulations determine the optimal households' aggregation as well as the location and sizing of CES. To overcome the computational challenges of treating operational decisions within a multi-period decision making framework, we also propose a decomposition approach to accelerate the computational time needed to solve larger instances. We conduct a case study based on real power consumption, power generation, and location network data from Cambridge, MA. Our mathematical models and the underlying algorithmic framework can be used in operational and strategic planning studies on smart grids to incentivize the communitarian distributed renewable energy generation and to improve the self-consumption and self-sufficiency of the energy sharing community. The models are also targeted to policymakers of smart cities, utility companies, and Energy Service Companies as the proposed models support decision making on renewable energy related projects investments.
In this article, we develop novel mathematical models to optimize utilization of community energy st
"
"en" => "In this article, we develop novel mathematical models to optimize utilization of community energy storage (CES) by clustering prosumers and consumers into energy sharing communities/microgrids in the context of a smart city. Three different microgrid configurations are modeled using a unifying mixed-integer linear programming formulation. These configurations represent three different business models, namely: the island model, the interconnected model, and the Energy Service Companies model. The proposed mathematical formulations determine the optimal households' aggregation as well as the location and sizing of CES. To overcome the computational challenges of treating operational decisions within a multi-period decision making framework, we also propose a decomposition approach to accelerate the computational time needed to solve larger instances. We conduct a case study based on real power consumption, power generation, and location network data from Cambridge, MA. Our mathematical models and the underlying algorithmic framework can be used in operational and strategic planning studies on smart grids to incentivize the communitarian distributed renewable energy generation and to improve the self-consumption and self-sufficiency of the energy sharing community. The models are also targeted to policymakers of smart cities, utility companies, and Energy Service Companies as the proposed models support decision making on renewable energy related projects investments.
In this article, we develop novel mathematical models to optimize utilization of community energy st
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
206 => Essec\Faculty\Model\Contribution {#2568
#_index: "academ_contributions"
#_id: "15264"
#_source: array:18 [
"id" => "15264"
"slug" => "reinforcement-learning-approaches-for-the-orienteering-problem-with-stochastic-and-dynamic-release-dates
reinforcement-learning-approaches-for-the-orienteering-problem-with-stochastic-and-dynamic-release-d
"
"yearMonth" => "2024-09"
"year" => "2024"
"title" => "Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates
Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release D
"
"description" => "LI, Y., ARCHETTI, C. et LJUBIC, I. (2024). Reinforcement Learning Approaches for the Orienteering Problem with Stochastic and Dynamic Release Dates. <i>Transportation Science</i>, 58(5), pp. 1143-1165.
LI, Y., ARCHETTI, C. et LJUBIC, I. (2024). Reinforcement Learning Approaches for the Orienteering Pr
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "LI Yuanyuan"
]
2 => array:1 [
"name" => "ARCHETTI Claudia"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "reinforcement learning"
1 => "two-stage stochastic ILP model"
2 => "branch-and-cut"
3 => "Markov decision process"
4 => "orienteering problem"
]
"updatedAt" => "2024-10-07 13:32:16"
"publicationUrl" => "https://doi.org/10.1287/trsc.2022.0366"
"publicationInfo" => array:3 [
"pages" => "1143-1165"
"volume" => "58"
"number" => "5"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In this paper, we study a sequential decision-making problem faced by e-commerce carriers related to when to send out a vehicle from the central depot to serve customer requests and in which order to provide the service, under the assumption that the time at which parcels arrive at the depot is stochastic and dynamic. The objective is to maximize the expected number of parcels that can be delivered during service hours. We propose two reinforcement learning (RL) approaches for solving this problem. These approaches rely on a look-ahead strategy in which future release dates are sampled in a Monte Carlo fashion, and a batch approach is used to approximate future routes. Both RL approaches are based on value function approximation: One combines it with a consensus function (VFA-CF) and the other one with a two-stage stochastic integer linear programming model (VFA-2S). VFA-CF and VFA-2S do not need extensive training as they are based on very few hyperparameters and make good use of integer linear programming (ILP) and branch-and-cut–based exact methods to improve the quality of decisions. We also establish sufficient conditions for partial characterization of optimal policy and integrate them into VFA-CF/VFA-2S. In an empirical study, we conduct a competitive analysis using upper bounds with perfect information. We also show that VFA-CF and VFA-2S greatly outperform alternative approaches that (1) do not rely on future information (2) are based on point estimation of future information, (3) use heuristics rather than exact methods, or (4) use exact evaluations of future rewards.
In this paper, we study a sequential decision-making problem faced by e-commerce carriers related to
"
"en" => "In this paper, we study a sequential decision-making problem faced by e-commerce carriers related to when to send out a vehicle from the central depot to serve customer requests and in which order to provide the service, under the assumption that the time at which parcels arrive at the depot is stochastic and dynamic. The objective is to maximize the expected number of parcels that can be delivered during service hours. We propose two reinforcement learning (RL) approaches for solving this problem. These approaches rely on a look-ahead strategy in which future release dates are sampled in a Monte Carlo fashion, and a batch approach is used to approximate future routes. Both RL approaches are based on value function approximation: One combines it with a consensus function (VFA-CF) and the other one with a two-stage stochastic integer linear programming model (VFA-2S). VFA-CF and VFA-2S do not need extensive training as they are based on very few hyperparameters and make good use of integer linear programming (ILP) and branch-and-cut–based exact methods to improve the quality of decisions. We also establish sufficient conditions for partial characterization of optimal policy and integrate them into VFA-CF/VFA-2S. In an empirical study, we conduct a competitive analysis using upper bounds with perfect information. We also show that VFA-CF and VFA-2S greatly outperform alternative approaches that (1) do not rely on future information (2) are based on point estimation of future information, (3) use heuristics rather than exact methods, or (4) use exact evaluations of future rewards.
In this paper, we study a sequential decision-making problem faced by e-commerce carriers related to
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d’Information, Sciences de la Décision et Statistiques"
"en" => "Information Systems, Decision Sciences and Statistics"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
207 => Essec\Faculty\Model\Contribution {#2569
#_index: "academ_contributions"
#_id: "15265"
#_source: array:18 [
"id" => "15265"
"slug" => "a-bilevel-approach-for-compensation-and-routing-decisions-in-last-mile-delivery"
"yearMonth" => "2024-09"
"year" => "2024"
"title" => "A Bilevel Approach for Compensation and Routing Decisions in Last-Mile Delivery"
"description" => "CERULLI, M., ARCHETTI, C., FERNÁNDEZ, E. et LJUBIC, I. (2024). A Bilevel Approach for Compensation and Routing Decisions in Last-Mile Delivery. <i>Transportation Science</i>, 58(5), pp. 1076-1100.
CERULLI, M., ARCHETTI, C., FERNÁNDEZ, E. et LJUBIC, I. (2024). A Bilevel Approach for Compensation a
"
"authors" => array:4 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "Cerulli Martina"
]
2 => array:1 [
"name" => "ARCHETTI Claudia"
]
3 => array:1 [
"name" => "Fernández Elena"
]
]
"ouvrage" => ""
"keywords" => array:4 [
0 => "bilevel programming"
1 => "profitable tour problem"
2 => "last-mile delivery"
3 => "peer-to-peer transportation platforms"
]
"updatedAt" => "2024-10-07 09:57:51"
"publicationUrl" => "https://doi.org/10.1287/trsc.2023.0129"
"publicationInfo" => array:3 [
"pages" => "1076-1100"
"volume" => "58"
"number" => "5"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "In last-mile delivery logistics, peer-to-peer logistic platforms play an important role in connecting senders, customers, and independent carriers to fulfill delivery requests. As the carriers are not under the platform’s control, the platform has to anticipate their reactions while deciding how to allocate the delivery operations. Indeed, carriers’ decisions largely affect the platform’s revenue. In this paper, we model this problem using bilevel programming. At the upper level, the platform decides how to assign the orders to the carriers; at the lower level, each carrier solves a profitable tour problem to determine which offered requests to accept, based on her own profit maximization. Possibly, the platform can influence carriers’ decisions by determining also the compensation paid for each accepted request. The two considered settings result in two different formulations: the bilevel profitable tour problem with fixed compensation margins and with margin decisions, respectively. For each of them, we propose single-level reformulations and alternative formulations where the lower-level routing variables are projected out. A branch-and-cut algorithm is proposed to solve the bilevel models, with a tailored warm-start heuristic used to speed up the solution process. Extensive computational tests are performed to compare the proposed formulations and analyze solution characteristics.
In last-mile delivery logistics, peer-to-peer logistic platforms play an important role in connectin
"
"en" => "In last-mile delivery logistics, peer-to-peer logistic platforms play an important role in connecting senders, customers, and independent carriers to fulfill delivery requests. As the carriers are not under the platform’s control, the platform has to anticipate their reactions while deciding how to allocate the delivery operations. Indeed, carriers’ decisions largely affect the platform’s revenue. In this paper, we model this problem using bilevel programming. At the upper level, the platform decides how to assign the orders to the carriers; at the lower level, each carrier solves a profitable tour problem to determine which offered requests to accept, based on her own profit maximization. Possibly, the platform can influence carriers’ decisions by determining also the compensation paid for each accepted request. The two considered settings result in two different formulations: the bilevel profitable tour problem with fixed compensation margins and with margin decisions, respectively. For each of them, we propose single-level reformulations and alternative formulations where the lower-level routing variables are projected out. A branch-and-cut algorithm is proposed to solve the bilevel models, with a tailored warm-start heuristic used to speed up the solution process. Extensive computational tests are performed to compare the proposed formulations and analyze solution characteristics.
In last-mile delivery logistics, peer-to-peer logistic platforms play an important role in connectin
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
208 => Essec\Faculty\Model\Contribution {#2570
#_index: "academ_contributions"
#_id: "15277"
#_source: array:18 [
"id" => "15277"
"slug" => "connected-facility-location-problems"
"yearMonth" => "2023-06"
"year" => "2023"
"title" => "Connected Facility Location Problems"
"description" => "LJUBIC, I. (2023). Connected Facility Location Problems. Dans: Pardalos P.M., Prokopyev O.A. eds. <i>Encyclopedia of Optimization</i>. 3rd ed. Cham: Springer, pp. 1-11.
LJUBIC, I. (2023). Connected Facility Location Problems. Dans: Pardalos P.M., Prokopyev O.A. eds. <i
"
"authors" => array:1 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
]
"ouvrage" => "Encyclopedia of Optimization"
"keywords" => array:5 [
0 => "Connected Facility Location Problem"
1 => "minimum-cost solution"
2 => "Steiner tree"
3 => "methods"
4 => "computational studies"
]
"updatedAt" => "2024-12-17 01:00:56"
"publicationUrl" => "https://doi.org/10.1007/978-3-030-54621-2_870-1"
"publicationInfo" => array:3 [
"pages" => "1-11"
"volume" => ""
"number" => ""
]
"type" => array:2 [
"fr" => "Chapitres"
"en" => "Book chapters"
]
"support_type" => array:2 [
"fr" => "Editeur"
"en" => "Publisher"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "The (uncapacitated, unrooted) Connected Facility Location Problem (ConFL) is the problem of determining a minimum-cost solution consisting of a set of open facilities used to serve a given set of clients, and to connect the open facilities using a Steiner tree. The cost of a ConFL solution consists of edge costs for building the Steiner tree, the cost for allocating the clients to open facilities, and the cost for opening the facilities. Hence, the ConFL is a generalization of two well-known combinatorial optimization problems: the uncapacitated facility location problem and the Steiner tree problem in graphs. In the past two decades there has been a considerable amount of research devoted to it. The aim of this article is to provide a comprehensive overview of the existing methods, theoretical results, and computational studies for the ConFL and its variants.
The (uncapacitated, unrooted) Connected Facility Location Problem (ConFL) is the problem of determin
"
"en" => "The (uncapacitated, unrooted) Connected Facility Location Problem (ConFL) is the problem of determining a minimum-cost solution consisting of a set of open facilities used to serve a given set of clients, and to connect the open facilities using a Steiner tree. The cost of a ConFL solution consists of edge costs for building the Steiner tree, the cost for allocating the clients to open facilities, and the cost for opening the facilities. Hence, the ConFL is a generalization of two well-known combinatorial optimization problems: the uncapacitated facility location problem and the Steiner tree problem in graphs. In the past two decades there has been a considerable amount of research devoted to it. The aim of this article is to provide a comprehensive overview of the existing methods, theoretical results, and computational studies for the ConFL and its variants.
The (uncapacitated, unrooted) Connected Facility Location Problem (ConFL) is the problem of determin
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
209 => Essec\Faculty\Model\Contribution {#2571
#_index: "academ_contributions"
#_id: "15323"
#_source: array:18 [
"id" => "15323"
"slug" => "the-impact-of-passive-social-media-viewers-in-influence-maximization"
"yearMonth" => "2024-12"
"year" => "2024"
"title" => "The Impact of Passive Social Media Viewers in Influence Maximization"
"description" => "KAHR, M., LEITNER, M. et LJUBIC, I. (2024). The Impact of Passive Social Media Viewers in Influence Maximization. <i>INFORMS Journal on Computing</i>, 36(6), pp. 1359-1756, C2.
KAHR, M., LEITNER, M. et LJUBIC, I. (2024). The Impact of Passive Social Media Viewers in Influence
"
"authors" => array:3 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "KAHR Michael"
]
2 => array:1 [
"name" => "LEITNER Markus"
]
]
"ouvrage" => ""
"keywords" => array:3 [
0 => "influence maximization"
1 => "social networks"
2 => "generalized Benders decomposition"
]
"updatedAt" => "2024-12-12 11:09:26"
"publicationUrl" => "https://doi.org/10.1287/ijoc.2023.0047"
"publicationInfo" => array:3 [
"pages" => "1359-1756, C2"
"volume" => "36"
"number" => "6"
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "A frequently studied problem in the context of digital marketing for online social networks is the influence maximization problem that seeks for an initial seed set of influencers to trigger an information propagation cascade (in terms of active message forwarders) of expected maximum impact. Previously studied problems typically neglect that the probability that individuals passively view content without forwarding it is much higher than the probability that they forward content. Considering passive viewing enables us to maximize more natural (social media) marketing metrics, including (a) the expected organic reach, (b) the expected number of total impressions, or (c) the expected patronage, all of which are investigated in this paper for the first time in the context of influence maximization. We propose mathematical models to maximize these objectives, whereby the model for variant (c) includes individual’s resistances and uses a multinomial logit model to model customer behavior. We also show that these models can be easily adapted to a competitive setting in which the seed set of a competitor is known. In a computational study based on network graphs from Twitter (now X) and from the literature, we show that one can increase the expected patronage, organic reach, and number of total impressions by 36% on average (and up to 13 times in particular cases) compared with seed sets obtained from the classical maximization of message-forwarding users.
A frequently studied problem in the context of digital marketing for online social networks is the i
"
"en" => "A frequently studied problem in the context of digital marketing for online social networks is the influence maximization problem that seeks for an initial seed set of influencers to trigger an information propagation cascade (in terms of active message forwarders) of expected maximum impact. Previously studied problems typically neglect that the probability that individuals passively view content without forwarding it is much higher than the probability that they forward content. Considering passive viewing enables us to maximize more natural (social media) marketing metrics, including (a) the expected organic reach, (b) the expected number of total impressions, or (c) the expected patronage, all of which are investigated in this paper for the first time in the context of influence maximization. We propose mathematical models to maximize these objectives, whereby the model for variant (c) includes individual’s resistances and uses a multinomial logit model to model customer behavior. We also show that these models can be easily adapted to a competitive setting in which the seed set of a competitor is known. In a computational study based on network graphs from Twitter (now X) and from the literature, we show that one can increase the expected patronage, organic reach, and number of total impressions by 36% on average (and up to 13 times in particular cases) compared with seed sets obtained from the classical maximization of message-forwarding users.
A frequently studied problem in the context of digital marketing for online social networks is the i
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
210 => Essec\Faculty\Model\Contribution {#2572
#_index: "academ_contributions"
#_id: "15381"
#_source: array:18 [
"id" => "15381"
"slug" => "exact-algorithms-for-continuous-pricing-with-advanced-discrete-choice-demand-models"
"yearMonth" => "2024-11"
"year" => "2024"
"title" => "Exact algorithms for continuous pricing with advanced discrete choice demand models"
"description" => "HAERING, T., LEGAULT, R., TORRES, F., LJUBIC, I. et BIERLAIRE, M. (2024). Exact algorithms for continuous pricing with advanced discrete choice demand models. <i>OR Spectrum</i>, In press.
HAERING, T., LEGAULT, R., TORRES, F., LJUBIC, I. et BIERLAIRE, M. (2024). Exact algorithms for conti
"
"authors" => array:5 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "Haering Tom"
]
2 => array:1 [
"name" => "Legault Robin"
]
3 => array:1 [
"name" => "Torres Fabian"
]
4 => array:1 [
"name" => "Bierlaire Michel"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Discrete choice models"
1 => "Optimal pricing"
2 => "Exact algorithms"
3 => "Spatial Branch and Bound"
4 => "Benders Decomposition"
]
"updatedAt" => "2024-12-10 01:00:50"
"publicationUrl" => "https://doi.org/10.1007/s00291-024-00799-3"
"publicationInfo" => array:3 [
"pages" => ""
"volume" => "In press"
"number" => ""
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => "We present a spatial Branch and Bound and spatial Branch and Benders Decomposition approach together with the Breakpoint Exact Algorithm (BEA) to tackle the uncapacitated choice-based pricing problem (CPP) where demand is captured by a discrete choice model (DCM) based on the random utility principle. We leverage problem characteristics to reformulate the state-of-the-art simulation-based formulation of the CPP as a mixed-integer linear program (MILP) into a non-convex quadratically constrained quadratic program (QCQP), and then into a non-convex QCQP with linear objective (QCQP-L). We solve this reformulation with an efficient spatial Branch and Bound procedure utilizing the McCormick envelope for relaxations, which are then solved using Benders decomposition. We further exploit utility breakpoints to develop the BEA, which scales polynomially in the number of customers and draws, providing a fast option for low numbers of prices. Our methods are evaluated against solving the MILP, QCQP, or QCQP-L with GUROBI on a mixed logit (ML) parking space operator case study. We outspeed the MILP by several orders of magnitude when optimizing one or two prices and reduce computational time drastically for larger numbers of prices. When comparing to algorithms tailored for the CPP with ML demand specifically, our approaches significantly outperform the state of the art. Our methodology suits all choice-based optimization problems with linear-in-price utilities, given any DCM.
We present a spatial Branch and Bound and spatial Branch and Benders Decomposition approach together
"
"en" => "We present a spatial Branch and Bound and spatial Branch and Benders Decomposition approach together with the Breakpoint Exact Algorithm (BEA) to tackle the uncapacitated choice-based pricing problem (CPP) where demand is captured by a discrete choice model (DCM) based on the random utility principle. We leverage problem characteristics to reformulate the state-of-the-art simulation-based formulation of the CPP as a mixed-integer linear program (MILP) into a non-convex quadratically constrained quadratic program (QCQP), and then into a non-convex QCQP with linear objective (QCQP-L). We solve this reformulation with an efficient spatial Branch and Bound procedure utilizing the McCormick envelope for relaxations, which are then solved using Benders decomposition. We further exploit utility breakpoints to develop the BEA, which scales polynomially in the number of customers and draws, providing a fast option for low numbers of prices. Our methods are evaluated against solving the MILP, QCQP, or QCQP-L with GUROBI on a mixed logit (ML) parking space operator case study. We outspeed the MILP by several orders of magnitude when optimizing one or two prices and reduce computational time drastically for larger numbers of prices. When comparing to algorithms tailored for the CPP with ML demand specifically, our approaches significantly outperform the state of the art. Our methodology suits all choice-based optimization problems with linear-in-price utilities, given any DCM.
We present a spatial Branch and Bound and spatial Branch and Benders Decomposition approach together
"
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
211 => Essec\Faculty\Model\Contribution {#2573
#_index: "academ_contributions"
#_id: "15382"
#_source: array:18 [
"id" => "15382"
"slug" => "last-fifty-years-of-integer-linear-programming-a-focus-on-recent-practical-advances"
"yearMonth" => "2024-11"
"year" => "2024"
"title" => "Last fifty years of integer linear programming: A focus on recent practical advances"
"description" => "CLAUTIAUX, F. et LJUBIC, I. (2024). Last fifty years of integer linear programming: A focus on recent practical advances. <i>European Journal of Operational Research</i>, In press.
CLAUTIAUX, F. et LJUBIC, I. (2024). Last fifty years of integer linear programming: A focus on recen
"
"authors" => array:2 [
0 => array:3 [
"name" => "LJUBIC Ivana"
"bid" => "B00683004"
"slug" => "ljubic-ivana"
]
1 => array:1 [
"name" => "Clautiaux François"
]
]
"ouvrage" => ""
"keywords" => array:5 [
0 => "Combinatorial optimization"
1 => "Mixed-integer linear programming"
2 => "Branch-and-cut"
3 => "Dantzig–Wolfe decomposition"
4 => "Benders decomposition"
]
"updatedAt" => "2024-12-10 01:00:51"
"publicationUrl" => "https://doi.org/10.1016/j.ejor.2024.11.018"
"publicationInfo" => array:3 [
"pages" => ""
"volume" => "In press"
"number" => ""
]
"type" => array:2 [
"fr" => "Articles"
"en" => "Journal articles"
]
"support_type" => array:2 [
"fr" => "Revue scientifique"
"en" => "Scientific journal"
]
"countries" => array:2 [
"fr" => null
"en" => null
]
"abstract" => array:2 [
"fr" => """
Mixed-integer linear programming (MILP) has become a cornerstone of operations research. This is driven by the enhanced efficiency of modern solvers, which can today find globally optimal solutions within seconds for problems that were out of reach a decade ago. The versatility of these solvers allowed successful applications in many areas, such as transportation, logistics, supply chain management, revenue management, finance, telecommunications, and manufacturing. Despite the impressive success already obtained, many challenges remain, and MILP is still a very active field.\n
Mixed-integer linear programming (MILP) has become a cornerstone of operations research. This is dri
This article provides an overview of the most significant results achieved in advancing the MILP solution methods. Given the immense literature on this topic, we made deliberate choices to focus on computational aspects and recent practical performance improvements, emphasizing research that reports computational experiments. We organize our survey into three main parts, dedicated to branch-and-cut methods, Dantzig–Wolfe decomposition, and Benders decomposition. The paper concludes by highlighting ongoing challenges and future opportunities in MILP research.
This article provides an overview of the most significant results achieved in advancing the MILP sol
"""
"en" => """
Mixed-integer linear programming (MILP) has become a cornerstone of operations research. This is driven by the enhanced efficiency of modern solvers, which can today find globally optimal solutions within seconds for problems that were out of reach a decade ago. The versatility of these solvers allowed successful applications in many areas, such as transportation, logistics, supply chain management, revenue management, finance, telecommunications, and manufacturing. Despite the impressive success already obtained, many challenges remain, and MILP is still a very active field.\n
Mixed-integer linear programming (MILP) has become a cornerstone of operations research. This is dri
This article provides an overview of the most significant results achieved in advancing the MILP solution methods. Given the immense literature on this topic, we made deliberate choices to focus on computational aspects and recent practical performance improvements, emphasizing research that reports computational experiments. We organize our survey into three main parts, dedicated to branch-and-cut methods, Dantzig–Wolfe decomposition, and Benders decomposition. The paper concludes by highlighting ongoing challenges and future opportunities in MILP research.
This article provides an overview of the most significant results achieved in advancing the MILP sol
"""
]
"authors_fields" => array:2 [
"fr" => "Systèmes d'Information, Data Analytics et Opérations"
"en" => "Information Systems, Data Analytics and Operations"
]
"indexedAt" => "2025-02-23T07:21:40.000Z"
]
+lang: "fr"
+"_type": "_doc"
+"_score": 4.0269985
+"parent": null
}
]
"avatar" => "https://faculty.essec.edu/wp-content/uploads/avatars/B00683004.jpg"
"contributionCounts" => 212
"personalLinks" => array:2 [
0 => "<a href="https://orcid.org/0000-0002-4834-6284" target="_blank">ORCID</a>"
1 => "<a href="https://scholar.google.com/citations?user=o1Ym0_AAAAAJ" target="_blank">Google scholar</a>"
]
"docTitle" => "Ivana LJUBIC"
"docSubtitle" => "Professeur"
"docDescription" => "Département: Systèmes d'Information, Data Analytics et Opérations<br>Campus de Cergy"
"docType" => "cv"
"docPreview" => "<img src="https://faculty.essec.edu/wp-content/uploads/avatars/B00683004.jpg"><span><span>Ivana LJUBIC</span><span>B00683004</span></span>
<img src="https://faculty.essec.edu/wp-content/uploads/avatars/B00683004.jpg"><span><span>Ivana LJUB
"
"academ_cv_info" => ""
]
#_index: "academ_cv"
+lang: "fr"
+"_type": "_doc"
+"_score": 5.185522
+"parent": null
}