default search action
Sophie Demassey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c10]Sophie Demassey
, Valentina Sessa
Alternating Direction Method and Deep Learning for Discrete Control with Storage. ISCO 2024: 85-96 - 2021
- [j6]Wim van Ackooij
A bundle method for nonsmooth DC programming with application to chance-constrained problems. Comput. Optim. Appl. 78(2): 451-490 (2021)
2010 – 2019
- 2019
- [c9]Gratien Bonvin, Sophie Demassey:
Extended linear formulation of the pump scheduling problem in water distribution networks. INOC 2019: 13-18 - [c8]Arnold N'Goran, Bruno Daugrois, Marc Lotteau, Sophie Demassey:
Optimal engagement and operation of a grid-connected PV/battery system. ISGT Europe 2019: 1-5 - [c7]Gratien Bonvin, Sophie Demassey, Welington de Oliveira:
Robust Design of Pumping Stations in Water Distribution Networks. WCGO 2019: 957-967 - 2017
- [b2]Sophie Demassey:
Compositions et hybridations pour l'optimisation combinatoire appliquée. (Compositions and hybridizations for applied combinatorial optimization). University of Côte d'Azur, France, 2017 - [c6]Fabien Hermenier, Giovanni Giuliani, Andre Milani, Sophie Demassey
Scaling Energy Adaptive Applications for Sustainable Profitability. Euro-Par 2017: 23-35 - 2012
- [c5]Gilles Chabert, Sophie Demassey
The Conjunction of Interval Among Constraints. CPAIOR 2012: 113-128 - 2011
- [j5]Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey
New filtering for the cumulative constraint in the context of non-overlapping rectangles. Ann. Oper. Res. 184(1): 27-50 (2011) - [c4]Fabien Hermenier, Sophie Demassey
Bin Repacking Scheduling in Virtualized Datacenters. CP 2011: 27-41
2000 – 2009
- 2009
- [c3]Julien Menana, Sophie Demassey
Sequencing and Counting with the multicost-regular Constraint. CPAIOR 2009: 178-192 - 2007
- [j4]Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey
Global Constraint Catalogue: Past, Present and Future. Constraints An Int. J. 12(1): 21-62 (2007) - 2006
- [j3]Sophie Demassey
A Cost-Regular Based Hybrid Column Generation Approach. Constraints An Int. J. 11(4): 315-333 (2006) - [c2]Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey
Graph Properties Based Filtering. CP 2006: 59-74 - 2005
- [j2]Sophie Demassey
Constraint-Propagation-Based Cutting Planes: An Application to the Resource-Constrained Project Scheduling Problem. INFORMS J. Comput. 17(1): 52-65 (2005) - [c1]Sophie Demassey
Constraint Programming Based Column Generation for Employee Timetabling. CPAIOR 2005: 140-154 - 2004
- [j1]Philippe Baptiste, Sophie Demassey
Tight LP bounds for resource constrained project scheduling. OR Spectr. 26(2): 251-262 (2004) - 2003
- [b1]Sophie Demassey:
Méthodes hybrides de programmation par contraintes et programmation linéaire pour le problème d'ordonnancement de projet à contraintes de ressources. (Hybrid Constraint Programming-Integer Linear Programming approaches for the Resource-Constrained Project Scheduling Problem). University of Avignon, France, 2003
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-06-19 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: