default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSandra Ulrich Ngueveu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Alexandre Heintzmann
, Christian Artigues, Pascale Bendotti, Sandra Ulrich Ngueveu, Cécile Rottner:
A comparison of alternative models for solving a non-linear single plant Hydro Unit Commitment problem. Comput. Oper. Res. 165: 106591 (2024)- 2023
- [c7]Alexandre Heintzmann, Christian Artigues, Pascale Bendotti, Sandra Ulrich Ngueveu, Cécile Rottner:
Efficient exact A* algorithm for the single unit hydro unit commitment problem. FedCSIS 2023: 533-543 - 2022
- [j18]Estèle Glize, Nicolas Jozefowiez, Sandra Ulrich Ngueveu:
An ε-constraint column generation-and-enumeration algorithm for Bi-Objective Vehicle Routing Problems. Comput. Oper. Res. 138: 105570 (2022) - [j17]Sandra Ulrich Ngueveu, Christian Artigues, Nabil Absi, Safia Kedad-Sidhoum:
Lower and upper bounds for scheduling energy-consuming tasks with storage resources and piecewise linear costs. J. Heuristics 28(1): 93-120 (2022) - [j16]Aloïs Duguet, Christian Artigues, Laurent Houssin, Sandra Ulrich Ngueveu:
Properties, Extensions and Application of Piecewise Linearization for Euclidean Norm Optimization in $\mathbb {R}^2$. J. Optim. Theory Appl. 195(2): 418-448 (2022) - [c6]Aloïs Duguet, Sandra Ulrich Ngueveu:
Piecewise Linearization of Bivariate Nonlinear Functions: Minimizing the Number of Pieces Under a Bounded Approximation Error. ISCO 2022: 117-129 - 2021
- [c5]Louis Rivière, Christian Artigues, Azeddine Cheref, Nicolas Jozefowiez, Marie-José Huguet, Sandra Ulrich Ngueveu, Vincent Charvillat:
Multi-product, Multi-supplier Order Assignment and Routing for an e-Commerce Application in the Retail Sector. ICORES 2021: 438-445 - 2020
- [j15]Alessandro Agnetis, Cyril Briand, Sandra Ulrich Ngueveu, Premysl Sucha:
Price of anarchy and price of stability in multi-agent project scheduling. Ann. Oper. Res. 285(1): 97-119 (2020) - [j14]Estèle Glize, Roberto Roberti, Nicolas Jozefowiez, Sandra Ulrich Ngueveu:
Exact methods for mono-objective and Bi-Objective Multi-Vehicle Covering Tour Problems. Eur. J. Oper. Res. 283(3): 812-824 (2020) - [j13]Yun He, Christian Artigues, Cyril Briand, Nicolas Jozefowiez, Sandra Ulrich Ngueveu:
A Matheuristic with Fixed-Sequence Reoptimization for a Real-Life Inventory Routing Problem. Transp. Sci. 54(2): 355-374 (2020)
2010 – 2019
- 2019
- [j12]Sandra Ulrich Ngueveu:
Piecewise linear bounding of univariate nonlinear functions and resulting mixed integer linear programming-based solution methods. Eur. J. Oper. Res. 275(3): 1058-1071 (2019) - [j11]R. Bourbon, Sandra Ulrich Ngueveu, Xavier Roboam, Bruno Sareni, Christophe Turpin, David Hernandez-Torres:
Energy management optimization of a smart wind power plant comparing heuristic and linear programming methods. Math. Comput. Simul. 158: 418-431 (2019) - 2018
- [j10]Cyril Briand, Y. He, Sandra Ulrich Ngueveu:
Energy-efficient planning for supplying assembly lines with vehicles. EURO J. Transp. Logist. 7(4): 387-414 (2018) - [c4]Estèle Glize, Nicolas Jozefowiez, Sandra Ulrich Ngueveu:
An Exact Column Generation-Based Algorithm for Bi-objective Vehicle Routing Problems. ISCO 2018: 208-218 - 2017
- [j9]Sandra Ulrich Ngueveu, Stéphane Caux, Frédéric Messine, Mouloud Guemri:
Heuristics and lower bounds for minimizing fuel consumption in hybrid-electrical vehicles. 4OR 15(4): 407-430 (2017) - [j8]David A. Flores-Garza, M. Angélica Salazar-Aguilar, Sandra Ulrich Ngueveu, Gilbert Laporte:
The multi-vehicle cumulative covering tour problem. Ann. Oper. Res. 258(2): 761-780 (2017) - [j7]Leticia Vargas, Nicolas Jozefowiez, Sandra Ulrich Ngueveu:
A dynamic programming operator for tour location problems applied to the covering tour problem. J. Heuristics 23(1): 53-80 (2017) - [j6]Cyril Briand, Sandra Ulrich Ngueveu, Premysl Sucha:
Finding an optimal Nash equilibrium to the multi-agent project scheduling problem. J. Sched. 20(5): 475-491 (2017) - [j5]Roberto Baldacci, Sandra Ulrich Ngueveu, Roberto Wolfler Calvo:
The Vehicle Routing Problem with Transhipment Facilities. Transp. Sci. 51(2): 592-606 (2017) - 2016
- [j4]Sandra Ulrich Ngueveu, Christian Artigues, Pierre Lopez:
Scheduling under a non-reversible energy source: An application of piecewise linear bounding of non-linear demand/cost functions. Discret. Appl. Math. 208: 98-113 (2016) - [c3]Azeddine Cheref, Christian Artigues, Jean-Charles Billaut, Sandra Ulrich Ngueveu:
Integrated Production Scheduling and Delivery Routing: Complexity Results and Column Generation. ISCO 2016: 439-450 - 2015
- [c2]Leticia Vargas, Nicolas Jozefowiez, Sandra Ulrich Ngueveu:
A Selector Operator-Based Adaptive Large Neighborhood Search for the Covering Tour Problem. LION 2015: 170-185 - [i1]Maria Muguerza, Cyril Briand, Nicolas Jozefowiez, Sandra Ulrich Ngueveu, Victoria Rodríguez, Matías Urenda Moris:
A mass-flow MILP formulation for energy-efficient supplying in assembly lines. CoRR abs/1511.06236 (2015) - 2013
- [j3]Sandra Ulrich Ngueveu, Christian Prins, Roberto Wolfler Calvo:
New Lower Bounds and Exact Method for the m-PVRP. Transp. Sci. 47(1): 38-52 (2013) - 2010
- [j2]Sandra Ulrich Ngueveu, Christian Prins, Roberto Wolfler Calvo:
Lower and upper bounds for the m-peripatetic vehicle routing problem. 4OR 8(4): 387-406 (2010) - [j1]Sandra Ulrich Ngueveu, Christian Prins, Roberto Wolfler Calvo:
An effective memetic algorithm for the cumulative capacitated vehicle routing problem. Comput. Oper. Res. 37(11): 1877-1885 (2010) - [p1]Sandra Ulrich Ngueveu, Christian Prins, Roberto Wolfler Calvo:
A Hybrid Tabu Search for the m-Peripatetic Vehicle Routing Problem. Matheuristics 2010: 253-266
2000 – 2009
- 2009
- [c1]Sandra Ulrich Ngueveu, Christian Prins, Roberto Wolfler Calvo:
An Effective Evolutionary Algorithm for the Cumulative Capacitated Vehicle Routing Problem. EvoWorkshops 2009: 778-787
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-07 20:31 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:
