Marie-Christine Costa
103
Documents
Presentation
Professeure émérite au CNAM (Conservatoire National des Arts et métiers) https://www.cnam.fr/ .
Laboratoire CEDRIC https://cedric.cnam.fr/ .
en collaboration avec l'UMA - ENSTA-Paris https://uma.ensta-paris.fr/ .
Domaines de recherche: Recherche Opérationnelle - Operations Research
• Optimisation discrète déterministe en Recherche Opérationnelle: programmation mathématique.
• Optimisation linéaire mixte robuste.
• Optimisation dans les graphes.
• Applications à la localisation, aux réseaux de télécommunications et de distribution d'énergie.
Sites de références:
\*\*Master Parisien de Recherche Opérationnelle (MPRO)
https://uma.ensta-paris.fr/mpro/
\*\*ROADEF https://www.roadef.org/
\*\*PGMO https://www.fondation-hadamard.fr/PGMO
Publications
- 5
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 43
- 32
- 17
- 16
- 11
- 11
- 10
- 10
- 9
- 8
- 7
- 6
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 6
- 6
- 3
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 4
- 5
- 4
- 2
- 1
- 6
- 4
- 6
- 5
- 5
- 7
- 5
- 8
- 6
- 9
- 3
- 5
- 5
- 2
- 1
- 2
- 1
- 1
- 2
- 2
- 1
|
Optimisation robuste du câblage d'un parc éolien sous contraintes de load flowROADEF 2019, Feb 2020, Montpellier, France
Conference papers
hal-02475426v1
|
|
Wind farm cable layout optimization with constraints of load flow and robustnessICREEE 2020: International Conference on Renewable Energy and Environment Engineering, Dec 2020, Tokyo (on line), Japan
Conference papers
hal-02967066v1
|
Minimum length disjoint paths and Capacitated (rooted) Steiner TreeEuro-Alio International Conference on Applied Combinatorial Optimization Aims and Objectives, Jun 2018, Bologna, Italy
Conference papers
hal-02478921v1
|
|
Extenseurs hamiltoniens minimaux.ROADEF, Feb 2018, Lorient, France
Conference papers
hal-02462896v1
|
|
Optimisation du maillage électrique du parc éoliennes off-shore – projet StationisROADEF 17, Feb 2017, Metz, France
Conference papers
hal-02455568v1
|
|
|
d-extensibles de stables dans les graphes bipartisROADEF2017. 18ème congrès annuel de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, Université de Lorraine, Feb 2017, Metz, France
Conference papers
hal-02462664v1
|
|
Conception de câblages robustes dans les parcs éoliens : recherche d'une Arborescence de Steiner "robuste"17ème congrès ROADEF, Université de Technologie de Compiègne, Feb 2016, Compiègne, France
Conference papers
hal-02462704v1
|
A Steiner tree problem with capacity constraintsGO IX, Ninth international colloquium on Graphs and Optimization, Jul 2014, Sirmione, Italy. pp.12
Conference papers
hal-01126587v1
|
|
d-extensible sets of stable sets in bipartite graphs.GO IX, Ninth international colloquium on Graphs and Optimization, Jul 2014, X, France. pp.14
Conference papers
hal-01126588v1
|
|
Cabling optimization of a windfarm and capacitated K-Steiner treePGMO-COPI'14 Gaspard Monge Program for Optimization - Conference on Optimization Practices in Industry, Oct 2014, Palaiseau (91), France. 4 p
Conference papers
hal-01126586v1
|
|
A Robust Approach to Solve Mixed Integer Linear Optimization Problems with Uncertain Data. Tutorial.ICORES International Conference on Operations Research and Enterprise Systems (From joint works with A. Billionnet, P. Poirion, A. Faye, C. Hervet, M. Chardy and S. Francfort)., Mar 2014, Angers, France. pp.21
Conference papers
hal-01126384v1
|
|
Minimum size extensible graphs for (near) perfect matchingsInternational Conference on Graph Theory, Apr 2014, Grenoble, France. pp.juin 2014
Conference papers
hal-01126404v1
|
|
Optimisation robuste d?un parc autonome de production d?électricitéROADEF, 14? Conf?rence de la Soci?t? Fran?aise de Recherche Op?rationnelle et Aide ? la D?cision, Feb 2013, Troyes, France. pp.71
Conference papers
hal-01126287v1
|
|
Solving the Two-Stage Robust FTTH network design Problem under Demand UncertaintyInternational Network Optimization Conference, INOC, May 20-22, 2013; Electronic Notes in Discrete Mathematics, May 2013, Tenerife, Spain. pp.335-342
Conference papers
hal-01126286v1
|
|
Programmation linéaire mixte robuste avec variables de recours continuesROADEF, 14?me Conf?rence de la Soci?t? Fran?aise de Recherche Op?rationnelle et Aide ? la D?cision, Feb 2013, Troyes, France. pp.123
Conference papers
hal-01126531v1
|
|
Robust optimization of optical fiber access networks deploymentsInternational Symposium on Mathematical Programming (ISMP 2012) (and EURO 2012, Vilnius, Lithuania), Aug 2012, Berlin, Germany. pp.1
Conference papers
hal-01126208v1
|
|
Robust optimal sizing of an hybrid energy stand-alone system21st International Symposium on Mathematical Programming (ISMP 2012) and ROADEF 2012, Aug 2012, Berlin, Germany. pp.191
Conference papers
hal-01126110v1
|
|
|
Minimum d-Transversals of Maximum-Weight Stable Sets in TreesEuropean conference on combinatorics, graph theory and applications. EuroComb'11, Aug 2011, Budapest, Hungary. pp.129-134, ⟨10.1016/j.endm.2011.09.022⟩
Conference papers
hal-01125892v1
|
Optimizing an hybrid energy systemConference on Optimization and Practices in Industry (COPI'11), Nov 2011, Paris, France. pp.20-22
Conference papers
hal-01125967v1
|
|
Recherche opérationnelle et énergie renouvelable: une présentation de quelques problèmesROADEF 2011, 12?me congr?s annuel de la Soci?t? fran?aise de Recherche Op?rationnelle et d?Aide ? la D?cision, Mar 2011, Saint-Etienne, France. pp.145-146
Conference papers
hal-01125966v1
|
|
On matchings and stable sets in bipartite graphsGraphs and Optimization VII, Ovronnaz, Suisse, Jan 2010, X, France. pp.8-10
Conference papers
hal-01125754v1
|
|
Minimum d-blockers and d-transversals for the maximum stable set problemEuropean conference on operational research EURO 2010, July 11-14 Lisbonne, Portugal (and ROADEF 2010 24-26 f?vrier Toulouse), Jan 2010, Libonne, Portugal. pp.70-70
Conference papers
hal-01125728v1
|
|
Une nouvelle classe de graphes : les hypotriangulés.Conf?rence ROADEF 2009, Nancy, Feb 2009, X, France. pp.2
Conference papers
hal-01125645v1
|
|
d-bloqueurs et d-transversauxRecherche op?rationnelle et aide ? la d?cision. ROADEF'09 Nancy, Feb 2009, X, France. pp.316-317
Conference papers
hal-01125587v1
|
|
Approximating hv-convex binary matrices and images from discrete projectionsIAPR'08 14th Int. Conf. on Discrete Geometry for Computer Imagery, Jan 2008, X, France. pp.413-422
Conference papers
hal-01125398v1
|
|
Logistique et Recherche Opérationnelle (http://colloque.maths.free.fr/spip.php)Avenir de l'enseignement des math?matiques , Nov 2008, Paris, France. pp.1-138
Conference papers
hal-01126170v1
|
|
Packing de barres horizontalesFRANCORO/ROADEF'07, Grenoble, février, Feb 2007, X, France. pp.153-154
Conference papers
hal-01125262v1
|
|
Localisation optimale de capteurs dans un réseau point à pointROADEF'07, Grenoble, février, Feb 2007, X, France. pp.75-76
Conference papers
hal-01125313v1
|
|
Un Branch and Bound utilisant la programmation semidéfinie pour un problème de placement de tâches et un problème de partition des sommets d'un grapheROADEF'07, Grenoble, février, Feb 2007, X, France. pp.169-170
Conference papers
hal-01125256v1
|
|
|
Reconstruction de la coloration d'un graphe à partir des projections des voisinagesFRANCORO/ROADEF'07, Feb 2007, Grenoble, France. pp.87-88
Conference papers
hal-01125264v1
|
Discrete tomography and graph coloringEURO XXI, Reykjavik, Iceland, Jan 2006, X, France
Conference papers
hal-01125314v1
|
|
Etude du problème de la multicoupe minimale à cardinalité contrainteROADEF'06 7ème congrès, février, Feb 2006, Lille, France. pp.54
Conference papers
hal-01125157v1
|
|
Reconstruction de la coloration dun graphe à partir de projections de chaînesROADEF'06 7ème congrès ROADEF - Février, Jan 2006, Lille, France. pp.51
Conference papers
hal-01125163v1
|
|
Graph colouring with vertex neighbourhoods constraintsSixth Czech-Slovak Int. Symposium on Combinatorics, Graph Theory, Algorithms and Application, Jan 2006, X, France
Conference papers
hal-01125196v1
|
|
Bicolored matchings in some classes of graphsInt. Conf. in Graph Theory, Hyères, France, Jan 2005, X, France
Conference papers
hal-01125043v1
|
|
Reconstruction of binary matrices under adjacency constraintsENDM pp 281-297 Workshop on Discrete Tomography and Its Applications - New-York, USA, Jan 2005, X, France
Conference papers
hal-01124999v1
|
|
Maximum edge disjoint paths and minimum unweighted multicuts in grid graphsCIRO'05, Marrakech, Jan 2005, X, France. pp.85
Conference papers
hal-01125655v1
|
|
Reconstructing an alternate periodical binary matrix from its orthogonal projectionsICTCS 2005, Sienne, LNCS, Jan 2005, X, France. pp.173-181
Conference papers
hal-01125109v1
|
|
Résoudre en temps linéaire le problème de la multicoupe minimum dans des grilles rectangulairesROADEF'05 6ème congrès, février, Feb 2005, Tours, France. pp.105-106
Conference papers
hal-01124960v1
|
|
The shortest multipaths problem in a capacitated dense channelALIO/EURO'05 5th Conf. on Combinatorial Optimization, ENST, Paris, France, Jan 2005, X, France. pp.31
Conference papers
hal-01125125v1
|
|
Maximum edge disjoint paths and minimum unweighted multicut problems in grid graphsContibuted talk, Proceedings Graph Theory (GT'04), Paris, Jan 2004, X, France. pp.23
Conference papers
hal-01125059v1
|
|
On a problem of coloured matching in regular bipartite graphsContributed talk, Proceedings of Graph Theory Paris, Jan 2004, X, France. pp.63
Conference papers
hal-01124924v1
|
|
Quelques problèmes de tomographie discrèteEcole d'automne de recherche opérationnelle Tours, Jan 2003, X, France
Conference papers
hal-01124903v1
|
|
Multicoupe minimale et multiflot entier maximal dans un anneauLes Journées Graphes, Réseaux et Modélisation, 2003, Paris, France
Conference papers
hal-00085041v1
|
|
Multicoupes minimales et multiflots maximaux en nombres entiers dans les anneaux5ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, 2003, Avignon, France
Conference papers
hal-00085115v1
|
|
Minimal multicut and maximal integer multiflow in rings18th International Conference on Mathematical Programming, 2003, Copenhague, Denmark
Conference papers
hal-00085037v1
|
|
Multiflots entiers et multicoupes: analyse de leur difficulté.ROADEF, Paris, Jan 2002, X, France
Conference papers
hal-01124671v1
|
|
Solving the shortest multipaths problem on gridsCIRO Marrakech, Maroc, Jan 2002, X, France
Conference papers
hal-01124722v1
|
|
Multiflots entiers et multicoupes: analyse de leur difficulté4ème congrès de la Société Française de Recherche Opérationnelle et d'Aide à la Décision, 2002, Paris, France
Conference papers
hal-00085118v1
|
|
On some special cases of an image reconstruction problemECCO, Lugano, Jan 2002, X, France
Conference papers
hal-01124965v1
|
|
Polynomial algorithms to solve the multiway cut and integer flow problems in treesCO'02 Combinatorial Optimization Paris, 8-10 avril and ECCO, Lugano, Jan 2002, X, France
Conference papers
hal-01124667v1
|
|
A greedy algorithm for multicut and integral multiflow in rooted treesOptimization Days, 2001, Québec, Canada
Conference papers
hal-00085120v1
|
|
Multicut and integral multiflow : a surveyThe European Conference on Combinatorial Optimization - ECCO XIV, 2001, Bonn, Germany
Conference papers
hal-00085119v1
|
|
A variable neighborhood search using an interior point descent method for the module allocation problemECCO XIII, European chapter on combinatorial optimization, Capri, Jan 2000, X, France
Conference papers
hal-01124531v1
|
|
Résolution des problèmes de placement, localisation et partitionnement de graphesROADEF'98, Jan 1998, X, France
Conference papers
hal-01124528v1
|
|
Solving the shortest edge disjoint or capacited undirected paths problemsInt. Symp. on Mathematical Programming (ISPM 97), Lausanne, Jan 1997, X, France
Conference papers
hal-01124527v1
|
|
Etude comparative de logiciels généralistes pour la résolution de problèmes de localisation et de placementFRANCORO 95, Mons, Belgique, Jan 1995, X, France
Conference papers
hal-01124526v1
|
|
Solving real problems of dynamic location in telecommunication networksXXXIII TIMS-ORSA (INFORMS) Conference, Singapour, Jan 1995, X, France
Conference papers
hal-01124525v1
|
Weighted Transversals and Blockers for Some Optimization Problems in GraphsWiley. Progress in Combinatorial Optimization, pp.203-222, 2011, 978-1-84821-206-0
Book sections
hal-01125938v1
|
|
Reconstruction of binary matrices under adjacency constraintsBirkhauser/Gabor and Attila. Advances in Discrete Tomography and Its Applications, pp.125-150, 2007, 978-0-8176-3614-2
Book sections
hal-01125187v1
|
|
Entretien avec...2017
Other publications
hal-02462608v1
|
A bibliography on multicut and integer multiflow problems2004
Other publications
hal-00085921v1
|
|
Robust capacitated trees and networks with uniform demands *2018
Preprints, Working Papers, ...
hal-01681373v1
|
|
On the edge capacitated Steiner tree problem2017
Preprints, Working Papers, ...
hal-01465403v1
|
On the capacitated Steiner tree problem[Research Report] CEDRIC-15-3289, CEDRIC Lab/CNAM. 2015
Reports
hal-01126602v1
|
|
Robust optimal sizing of an hybrid energy stand-alone system[Research Report] CEDRIC-13-2899, CEDRIC Lab/CNAM. 2013
Reports
hal-01126344v1
|
|
On hypochordal graphs[Research Report] CEDRIC-10-1886, CEDRIC Lab/CNAM. 2010
Reports
hal-01125743v1
|