default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuce Brotcorne
Person information
- affiliation: INRIA Lille, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Pablo Escalona
, Luce Brotcorne, Bernard Fortz, Mario Ramirez:
Fare inspection patrolling under in-station selective inspection policy. Ann. Oper. Res. 332(1): 191-212 (2024)- [j26]Pablo Escalona, Alejandro Angulo, Luce Brotcorne, Bernard Fortz, Paulina Tapia:
Fill-rate service level constrained distribution network design. Int. Trans. Oper. Res. 31(1): 5-28 (2024) - [j25]Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne:
Robust bilevel optimization for near-optimal lower-level solutions. J. Glob. Optim. 90(4): 813-842 (2024) - 2023
- [j24]Luce Brotcorne, Mario Guajardo, Celso C. Ribeiro, Maria Grazia Speranza:
Tutorials and Reviews in Operations Research. Int. Trans. Oper. Res. 30(6): 2707-2708 (2023) - [j23]Luce Brotcorne, Joaquín Ezpeleta, Carmen Galé:
A biobjective model for resource provisioning in multi-cloud environments with capacity constraints. Oper. Res. 23(2): 31 (2023) - [c2]Haider Ali, Bruno Francois, Luce Brotcorne:
Optimal Day-Ahead Transport and Charge Scheduling of Autonomous Electric Vehicle Fleet using Local Renewable Energy Generation. ISGT EUROPE 2023: 1-5 - [c1]Tayenne Dias de Lima, Haider Ali, João P. Soares, John F. Franco, Bruno Francois, Luce Brotcorne:
Optimal Planning of Autonomous Electric Vehicles Charging Stations with Photovoltaic Generations and Energy Storage Systems in Electric Distribution Systems. ISGT EUROPE 2023: 1-5 - 2022
- [j22]Stefano Nasini, Martine Labbé, Luce Brotcorne:
Multi-market portfolio optimization with conditional value at risk. Eur. J. Oper. Res. 300(1): 350-365 (2022) - [j21]Jérôme De Boeck, Luce Brotcorne, Bernard Fortz:
Strategic bidding in price coupled regions. Math. Methods Oper. Res. 95(3): 365-407 (2022) - [i3]Luce Brotcorne, Christoph Buchheim, Dick den Hertog, Dorothee Henke:
Optimization at the Second Level (Dagstuhl Seminar 22441). Dagstuhl Reports 12(10): 207-224 (2022) - 2021
- [j20]Sezin Afsar, Luce Brotcorne, Patrice Marcotte, Gilles Savard:
Revenue optimization in energy networks involving self-scheduled demand and a smart grid. Comput. Oper. Res. 134: 105366 (2021) - [j19]Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne:
Complexity of near-optimal robust versions of multilevel optimization problems. Optim. Lett. 15(8): 2597-2610 (2021) - 2020
- [j18]Luce Brotcorne, Bernard Fortz, Martine Labbé:
Special issue on bilevel optimization. EURO J. Comput. Optim. 8(1): 1-2 (2020) - [j17]Didier Aussel, Luce Brotcorne, Sébastien Lepaul, Léonard von Niederhäusern:
A trilevel model for best response in energy demand-side management. Eur. J. Oper. Res. 281(2): 299-315 (2020) - [j16]Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne, Juan A. Gómez-Herrera:
A Bilevel Approach for Optimal Price-Setting of Time-and-Level-of-Use Tariffs. IEEE Trans. Smart Grid 11(6): 5462-5465 (2020) - [i2]Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne:
Complexity of near-optimal robust versions of multilevel optimization problems. CoRR abs/2011.00824 (2020)
2010 – 2019
- 2019
- [i1]Mathieu Besançon, Miguel F. Anjos, Luce Brotcorne:
Near-optimal Robust Bilevel Optimization. CoRR abs/1908.04040 (2019) - 2016
- [j15]Yezekael Hayel, Dominique Quadri, Tania Jiménez, Luce Brotcorne:
Decentralized optimization of last-mile delivery services with non-cooperative bounded rational customers. Ann. Oper. Res. 239(2): 451-469 (2016) - [j14]B. Tounsi, Yezekael Hayel, Dominique Quadri, Luce Brotcorne:
Mathematical Programming with Stochastic Equilibrium Constraints applied to Optimal Last-mile Delivery Services. Electron. Notes Discret. Math. 52: 5-12 (2016) - 2015
- [j13]Ioana C. Bilegan, Luce Brotcorne, Dominique Feillet, Yezekael Hayel:
Revenue management for rail container transportation. EURO J. Transp. Logist. 4(2): 261-283 (2015) - 2013
- [j12]Luce Brotcorne, Saïd Hanafi, Raïd Mansi:
One-level reformulation of the bilevel Knapsack problem using dynamic programming. Discret. Optim. 10(1): 1-10 (2013) - 2012
- [j11]Luce Brotcorne, F. Cirinei, Patrice Marcotte, Gilles Savard:
A Tabu search algorithm for the network pricing problem. Comput. Oper. Res. 39(11): 2603-2611 (2012) - 2011
- [j10]Luce Brotcorne, F. Cirinei, Patrice Marcotte, Gilles Savard:
An exact algorithm for the network pricing problem. Discret. Optim. 8(2): 246-258 (2011) - [j9]Bernard Fortz, Luce Brotcorne:
Editorial: Preface to the Special Issue. Networks 58(2): 81-82 (2011)
2000 – 2009
- 2009
- [j8]Luce Brotcorne, Saïd Hanafi, Raïd Mansi:
A dynamic programming algorithm for the bilevel knapsack problem. Oper. Res. Lett. 37(3): 215-218 (2009) - [j7]Luce Brotcorne, Clarisse Dhaenens, Saïd Hanafi, El-Ghazali Talbi:
Articles ROADEF 2006. RAIRO Oper. Res. 43(3): 253 (2009) - 2008
- [j6]Luce Brotcorne, Patrice Marcotte, Gilles Savard:
Bilevel Programming: The Montreal School. INFOR Inf. Syst. Oper. Res. 46(4): 231-246 (2008) - [j5]Luce Brotcorne, Martine Labbé, Patrice Marcotte, Gilles Savard:
Joint Design and Pricing on a Network. Oper. Res. 56(5): 1104-1115 (2008) - 2003
- [j4]Luce Brotcorne, Gilbert Laporte, Frédéric Semet:
Ambulance location and relocation models. Eur. J. Oper. Res. 147(3): 451-463 (2003) - 2002
- [j3]Luce Brotcorne, Gilbert Laporte, Frédéric Semet:
Fast heuristics for large scale covering-location problems. Comput. Oper. Res. 29(6): 651-665 (2002) - 2001
- [j2]Luce Brotcorne, Martine Labbé, Patrice Marcotte, Gilles Savard:
A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network. Transp. Sci. 35(4): 345-358 (2001) - 2000
- [j1]Luce Brotcorne, Martine Labbé, Patrice Marcotte, Gilles Savard:
A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem. Transp. Sci. 34(3): 289-302 (2000)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-13 23:49 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
