Costa

Marie-Christine Costa

Professeur émérite
Bureau : 31-1-78

Professeure émérite au CNAM en collaboration avec l'ENSTA. Mes domaines de recherche : Optimisation discrète en Recherche Opérationnelle : optimisation dans les graphes; optimisation de fonctions linéaires ou quadratiques sous contraintes linéaires et applications aux domaines des énergies renouvelables et des télécommunications. Optimisation robuste : optimisation du "pire des cas" pour des problèmes linéaires en variables mixtes.

Publications

2020

Articles de revue

  1. Costa, M.-C.; de Werra, D. and Picouleau, C. Minimal graphs for 2-factor extension. In Discrete Applied Mathematics, 2020. doi  www 
  1. Bentz, C.; Costa, M-C. and Hertz, A. On the edge capacitated Steiner tree problem. In Discrete Optimization, 38: 100607, 2020. doi  www 

Articles de conférence

  1. Bentz, C.; Costa, M-C.; Poirion, P-L.; Ridremont, T. and Zakhour, C. Optimisation robuste du câblage d'un parc éolien sous contraintes de load flow. In ROADEF 2019, Montpellier, France, 2020. www 
  1. Bentz, C.; Costa, M-C.; Poirion, P-L.; Ridremont, T. and Zakour, C. Wind farm cable layout optimization with constraints of load flow and robustness. In ICREEE 2020: International Conference on Renewable Energy and Environment, Tokyo (on line), Japan, 2020. www 

2018

Articles de revue

  1. Costa, M-C.; de Werra, D. and Picouleau, C. Minimal graphs for matching extension. In Discrete Applied Mathematics, 234: 47-55, 2018. doi  www 
  1. Bentz, C.; Costa, M-C.; Poirion, P-L. and Ridremont, T. Formulations for designing robust networks. An application to wind power collection. In Electronic Notes in Discrete Mathematics, 64: 365-374, 2018. doi  www 

Articles de conférence

  1. Costa, M-C.; De Werra, D and Picouleau, C. Extenseurs hamiltoniens minimaux. In ROADEF, Lorient, France, 2018. www 
  1. Bentz, C.; Costa, M-C. and Hertz, A. Minimum length disjoint paths and Capacitated (rooted) Steiner Tree. In Euro-Alio International Conference on Applied Combinatorial Optimization Aims and Objectives, Bologna, Italy, 2018. www 

Non publié

  1. Bentz, C.; Costa, M-C.; Poirion, P-L. and Ridremont, T. Robust capacitated trees and networks with uniform demands *. , working paper or preprint. www 

2017

Articles de conférence

  1. Gladkikh, E.; Lambert, A.; Faye, A.; Watel, D. and Costa, M-C. Optimisation du maillage électrique du parc éoliennes off-shore -- projet Stationis. In ROADEF 17, Metz, France, 2017. www 
  1. Cotté, G.; Costa, M-C. and Picouleau, C. d-extensibles de stables dans les graphes bipartis. In ROADEF2017. 18ème congrès annuel de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision, Metz, France, 2017. www 

Divers

  1. Costa, M-C. Entretien avec... , Entretien personnel invité sur la recherche opérationnelle. www 

Non publié

  1. Bentz, C.; Costa, M-C. and Hertz, A. On the edge capacitated Steiner tree problem. , working paper or preprint. www 

2016

Articles de revue

  1. Billionnet, A.; Costa, M-C. and Poirion, P-L. Robust optimal sizing of a hybrid energy stand-alone system. In European Journal of Operational Research, 254: 565-575, 2016. doi  www 

Articles de conférence

  1. Bentz, C.; Costa, M-C.; Porumbel, D. and Ridremont, T. Conception de câblages robustes dans les parcs éoliens : recherche d'une Arborescence de Steiner ''robuste''. In 17ème congrès ROADEF, Compiègne, France, 2016. www 

2015

Rapports

  1. Bentz, C.; Costa, M-C.; Poirion, P-L. and Hertz, A. On the capacitated Steiner tree problem. Technical Report CEDRIC-15-3289, CEDRIC Lab/CNAM, 2015.

2014

Articles de revue

  1. Billionnet, A.; Costa, M-C. and Poirion, P-L. 2-Stage Robust MILP with continuous recourse variables. In Discrete Applied Mathematics, 170: 21-32, 2014. doi  www 

Articles de conférence

  1. Picouleau, C.; de Werra, D. and Costa, M-C. Minimum size extensible graphs for (near) perfect matchings. In International Conference on Graph Theory, pages juin 2014, Grenoble, France, 2014. www 
  1. Costa, M-C. A Robust Approach to Solve Mixed Integer Linear Optimization Problems with Uncertain Data.Tutorial. In 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)., pages 21, Angers, France, 2014. www 
  1. Costa, M-C.; Cotté, G. and Picouleau, C. d-extensible sets of stable sets in bipartite graphs. In GO IX, Ninth international colloquium on Graphs and Optimization, pages 14, X, France, 2014. www 
  1. Bentz, C.; Costa, M-C.; Hertz, A. and Poirion, P-L. Cabling optimization of a windfarm and capacitated K-Steiner tree. In PGMO-COPI'14 Gaspard Monge Program for Optimization - Conference on Optimization Practices in Industry, pages 4 pages, Palaiseau (91), France, 2014. www 
  1. Bentz, C.; Costa, M-C. and Hertz, A. A Steiner tree problem with capacity constraints. In GO IX, Ninth international colloquium on Graphs and Optimization, pages 12, Sirmione, Italy, 2014. www 

2013

Articles de conférence

  1. Hervet, C.; Faye, A.; Costa, M-C.; Chardy, M. and FRANCFORT, S. Solving the Two-Stage Robust FTTH network design Problem under Demand Uncertainty. In International Network Optimization Conference, INOC, May 20-22, 2013; Electronic Notes in Discrete Mathematics, pages 335-342, Tenerife, Spain, 2013. www 
  1. Billionnet, A.; Costa, M-C. and Poirion, P-L. Optimisation robuste d?un parc autonome de production d?électricité. In ROADEF, 14? Conf?rence de la Soci?t? Fran?aise de Recherche Op?rationnelle et Aide ? la D?cision, pages 71, Troyes, France, 2013. www 
  1. Billionnet, A.; Costa, M-C. and Poirion, P-L. Programmation linéaire mixte robuste avec variables de recours continues. In ROADEF, 14?me Conf?rence de la Soci?t? Fran?aise de Recherche Op?rationnelle et Aide ? la D?cision, pages 123, Troyes, France, 2013. www 

Rapports

  1. Billionnet, A.; Costa, M-C. and Poirion, P-L. Robust optimal sizing of an hybrid energy stand-alone system. Technical Report CEDRIC-13-2899, CEDRIC Lab/CNAM, 2013.

2012

Articles de revue

  1. Chardy, M.; Costa, M-C.; Faye, A.; FRANCFORT, S.; Hervet, C. and Trampont, M. La RO au coeur du déploiement du Fiber To The Home `a France-Télécom Orange: La RO récompensée par le prix Orange de l'Innovation 2012 (catégorie Réseau). In Bulletin de la ROADEF, 29: 8-11, 2012. www 
  1. Bentz, C.; Costa, M-C.; Picouleau, C.; Ries, B. and De Werra, D. d-Transversals of Stable Sets and Vertex Covers in Weighted Bipartite Graphs. In Journal of Discrete Algorithms, 17: 95-102, 2012. doi  www 
  1. Chardy, M.; Costa, M-C.; Faye, A. and Trampont, M. Optimizing the deployment of a multilevel optical FTTH network. In European Journal of Operational Research, 222 (3): 430-440, 2012. doi  www 
  1. Chardy, M.; Costa, M-C.; Faye, A. and Trampont, M. Optimizing splitter and fiber location in a multilevel optical FTTH network. In European Journal of Operational Research, 222: 430-440, 2012. www 

Articles de conférence

  1. Hervet, C.; Chardy, M.; Costa, M-C.; Faye, A. and FRANCFORT, S. Robust optimization of optical fiber access networks deployments. In International Symposium on Mathematical Programming (ISMP 2012) (and EURO 2012, Vilnius, Lithuania), pages 1, Berlin, Germany, 2012. www 
  1. Billionnet, A.; Costa, M-C. and Poirion, P-L. Robust optimal sizing of an hybrid energy stand-alone system. In 21st International Symposium on Mathematical Programming (ISMP 2012) and ROADEF 2012, pages 191, Berlin, Germany, 2012. www 

2011

Articles de revue

  1. Costa, M-C.; De Werra, D. and Picouleau, C. Minimum d-blockers and d-transversals in graphs. In Journal of Combinatorial Optimization, 22 (4): 857-872, 2011. doi  www 

Chapitres d'ouvrage

  1. Costa, M-C.; de Werra, D.; Picouleau, C.; Ries, B. and Bentz, C. Weighted Transversals and Blockers for Some Optimization Problems in Graphs. In Progress in Combinatorial Optimization, pages 203-222, 2011. www 

Articles de conférence

  1. Billionnet, A.; Costa, M-C. and Poirion, P-L. Recherche opérationnelle et énergie renouvelable: une présentation de quelques problèmes. In ROADEF 2011, 12?me congr?s annuel de la Soci?t? fran?aise de Recherche Op?rationnelle et d?Aide ? la D?cision, pages 145-146, Saint-Etienne, France, 2011. www 
  1. Billionnet, A.; Costa, M-C. and Poirion, P-L. Optimizing an hybrid energy system. In Conference on Optimization and Practices in Industry (COPI'11), pages 20-22, Paris, France, 2011. www 
  1. Costa, M-C.; de Werra, D.; Picouleau, C.; Ries, B. and Bentz, C. Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. In European conference on combinatorics, graph theory and applications EuroComb'11, Electronics Notes in Discrete Mathematics, pages 129-134, Bupapest, Hungary, 2011. www 

2010

Articles de revue

  1. Ries, B.; Bentz, C.; De Werra, D.; Costa, M-C.; Zenklusen, R. and Picouleau, C. Blockers and Transversals in some subclasses of bipartite graphs: when caterpillars are dancing on a grid. In Discrete Mathematics, 310: 132-146, 2010. doi  www 
  1. De Werra, D.; Costa, M-C.; Picouleau, C. and Ries, B. On the use of graphs in discrete tomography. In Annals of Operations Research, 175: 287-307, 2010. doi  www 

Articles de conférence

  1. Costa, M-C.; de Werra, D. and Picouleau, C. On matchings and stable sets in bipartite graphs. In Graphs and Optimization VII, Ovronnaz, Suisse, pages 8-10, X, France, 2010. www 
  1. Costa, M-C.; de Werra, D. and Picouleau, C. Minimum d-blockers and d-transversals for the maximum stable set problem. In European conference on operational research EURO 2010, July 11-14 Lisbonne, Portugal (and ROADEF 2010 24-26 f?vrier Toulouse), pages 70-70, Libonne, Portugal, 2010. www 

Rapports

  1. Costa, M-C.; Picouleau, C. and Topart, H. On hypochordal graphs. Technical Report CEDRIC-10-1886, CEDRIC Lab/CNAM, 2010.

2009

Articles de revue

  1. Bentz, C.; Costa, M-C.; Derhy, N. and Roupin, F. Cardinality constrained and multicriteria (multi)cut problems. In Journal of Discrete Algorithms, 7 (1): 102-111, 2009. www 
  1. Zenklusen, R.; Ries, B.; Picouleau, C.; De Werra, D.; Costa, M-C. and Bentz, C. Blockers and Transversals. In Discrete Mathematics, 13: 4306-4314, 2009. doi  www 
  1. Costa, M-C.; De Werra, D.; Picouleau, C. and Ries, B. Graph coloring with cardinality constraints on the neighborhoods. In Discrete Optimization, 6 (4): 362-369, 2009. doi  www 
  1. Bentz, C.; Costa, M-C.; Létocart, L. and Roupin, F. Multicut and integral multiflow in rings. In European Journal of Operational Research, 196 (3): 1251-1254, 2009. www 
  1. Bentz, C.; Costa, M-C.; Picouleau, C.; Ries, B. and De Werra, D. Degree-constrained edge partitioning in graphs arising from discrete tomography. In Journal of Graph Algorithms and Applications, 13 (2): 99-118, 2009. doi  www 

Articles de conférence

  1. Costa, M-C.; Picouleau, C. and Topart, H. Une nouvelle classe de graphes : les hypotriangulés. In Conf?rence ROADEF 2009, Nancy, pages 2, X, France, 2009. www 
  1. Bentz, C.; Costa, M-C.; de Werra, D.; Picouleau, C.; Ries, B. and Zenklusen, R. d-bloqueurs et d-transversaux. In Recherche op?rationnelle et aide ? la d?cision. ROADEF'09 Nancy, pages 316-317, X, France, 2009. www 

2008

Articles de revue

  1. Costa, M-C.; Jarray, F. and Picouleau, C. Complexity results for the horizontal bar packing problem. In Information Processing Letters, 108 (6): 356-359, 2008. doi  www 
  1. Bentz, C.; Costa, M-C.; De Werra, D.; Picouleau, C. and Ries, B. On a graph coloring problem arising from discrete tomography. In Networks, 51 (4): 256-267, 2008. doi  www 
  1. Costa, M-C.; de Werra, D.; Picouleau, C. and Ries, B. Addendum to ``Bicolored Matchings in Some Classes of Graphs''. In Graphs and Combinatorics, 24 (2): 127-128, 2008. doi  www 

Articles de conférence

  1. Costa, M-C.; Jarray, F. and Picouleau, C. Approximating hv-convex binary matrices and images from discrete projections. In IAPR'08 14th Int. Conf. on Discrete Geometry for Computer Imagery, pages 413-422, X, France, LNCS 4992 , 2008. www 
  1. Costa, M-C. Logistique et Recherche Opérationnelle (http://colloque.maths.free.fr/spip.php). In Avenir de lénseignement des math?matiques, pages 1-138, Paris, France, 2008. www 

2007

Articles de revue

  1. Costa, M-C.; de Werra, D.; Picouleau, C. and Ries, B. Bicolored matchings in some classes of graphs. In AKCE International Journal of Graphs and Combinatorics, 23: 47-60, 2007. www 
  1. Bentz, C.; Costa, M-C. and Roupin, F. Maximum integer multiflow and minimum multicut problems in uniform grid graphs. In Journal of Discrete Algorithms, 5 (1): 36-54, 2007. doi  www 
  1. Bentz, C.; Costa, M-C.; Picouleau, C. and Zrikem, M. The shortest multipaths problem in a capacitated dense channel. In European Journal of Operational Research, 178: 926-931, 2007. www 

Chapitres d'ouvrage

  1. Brunetti, S.; Costa, M-C.; Frosini, A.; Jarray, F. and Picouleau, C. Reconstruction of binary matrices under adjacency constraints. In Advances in Discrete Tomography and Its Applications, pages 125-150, 2007. www 

Articles de conférence

  1. Costa, M-C.; Faye, A.; Hardy, T. and Gressier-Soudan, E. Localisation optimale de capteurs dans un réseau point `a point. In ROADEF'07, Grenoble, février, pages 75-76, X, France, 2007. www 
  1. Costa, M-C.; Jarray, F. and Picouleau, C. Packing de barres horizontales. In FRANCORO/ROADEF'07, Grenoble, février, pages 153-154, X, France, 2007. www 
  1. Costa, M-C.; Derhy, N. and Roupin, F. 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 graphe. In ROADEF'07, Grenoble, février, pages 169-170, X, France, 2007. www 
  1. Costa, M-C.; de Werra, D.; Picouleau, C. and Ries, B. Reconstruction de la coloration d’un graphe `a partir des projections des voisinages. In FRANCORO/ROADEF'07, Grenoble, février, pages 155-156, X, France, 2007. www 
  1. Bentz, C.; Costa, M-C.; de Werra, D.; Picouleau, C. and Ries, B. Reconstruction d'une coloration des arêtes d’un graphe `a partir des séquences de degrés. In FRANCORO/ROADEF'07, Grenoble, f?vrier, pages 87-88, X, France, 2007. www 

2006

Articles de revue

  1. Costa, M-C.; de Werra, D. and Picouleau, C. Using graphs for some discrete tomography problems. In Discrete Applied Mathematics, 154: 35-46, 2006. www 
  1. Costa, M-C.; Jarray, F. and Picouleau, C. An acyclic days-off scheduling problem. In 4OR: A Quarterly Journal of Operations Research, 4: 73-85, 2006. www 

Articles de conférence

  1. Costa, M-C.; Roupin, F.; Bentz, C. and Derhy, N. Etude du problème de la multicoupe minimale `a cardinalité contrainte. In ROADEF'06 7ème congrès, février, pages 54, Lille, France, 2006. www 
  1. Bentz, C.; Costa, M-C.; Picouleau, C.; Ries, B. and de Werra, D. Reconstruction de la coloration d’un graphe `a partir de projections de cha^ines. In ROADEF'06 7ème congrès ROADEF - Février, pages 51, Lille, France, 2006. www 
  1. Costa, M-C.; de Werra, D.; Picouleau, C. and Ries, B. Graph colouring with vertex neighbourhoods constraints. In Sixth Czech-Slovak Int. Symposium on Combinatorics, Graph Theory, Algorithms and Application, X, France, 2006. www 
  1. Bentz, C.; Costa, M-C.; de Werra, D.; Picouleau, C. and Ries, B. Discrete tomography and graph coloring. In EURO XXI, Reykjavik, Iceland, X, France, 2006. www 

2005

Articles de revue

  1. Costa, M-C.; Létocart, L. and Roupin, F. Minimal multicut and maximal integer multiflow: a survey. In EJOR, 162: 55-69, 2005. www 
  1. Costa, M-C.; de Werra, D.; Picouleau, C. and Schindl, D. A solvable case of image reconstruction in discrete tomography. In Discrete Applied Mathematics, 148: 240-245, 2005. www 
  1. Costa, M-C.; Létocart, L. and Roupin, F. Multicut and integral multiflow : a survey. In European Journal of Operational Research, 162-1: 55-69, 2005. www 

Articles de conférence

  1. Costa, M-C.; Jarray, F. and Picouleau, C. Reconstruction of binary matrices under adjacency constraints. In ENDM pp 281-297 Workshop on Discrete Tomography and Its Applications - New-York, USA, X, France, 2005. www 
  1. Costa, M-C.; Jarray, F. and Picouleau, C. Reconstructing an alternate periodical binary matrix from its orthogonal projections. In ICTCS 2005, Sienne, LNCS, pages 173-181, X, France, LNCS 3701 , 2005. www 
  1. Bentz, C.; Costa, M-C.; Picouleau, C. and Zrikem, M. The shortest multipaths problem in a capacitated dense channel. In ALIO/EURO'05 5th Conf. on Combinatorial Optimization, ENST, Paris, France, pages 31, X, France, 2005. www 
  1. Bentz, C.; Costa, M-C. and Roupin, F. Maximum edge disjoint paths and minimum unweighted multicuts in grid graphs. In CIRO'05, Marrakech, pages 85, X, France, 2005. www 
  1. Costa, M-C.; Roupin, F. and Bentz, C. Résoudre en temps linéaire le problème de la multicoupe minimum dans des grilles rectangulaires. In ROADEF'05 6ème congrès, février, pages 105-106, Tours, France, 2005. www 
  1. Costa, M-C.; de Werra, D.; Picouleau, C. and Ries, B. Bicolored matchings in some classes of graphs. In Int. Conf. in Graph Theory, Hyères, France, X, France, 2005. www 

2004

Articles de conférence

  1. Costa, M-C.; de Werra, D. and Picouleau, C. On a problem of coloured matching in regular bipartite graphs. In Contributed talk, Proceedings of Graph Theory Paris, pages 63, X, France, 2004. www 
  1. Costa, M-C.; Roupin, F. and Bentz, C. Maximum edge disjoint paths and minimum unweighted multicut problems in grid graphs. In Contibuted talk, Proceedings Graph Theory (GT'04), Paris, pages 23, X, France, 2004. www 

Divers

  1. Létocart, L.; Bentz, C.; Costa, M-C. and Roupin, F. A bibliography on multicut and integer multiflow problems. , Rapport scientifique CEDRIC (ref. CEDRIC 654). www 

2003

Articles de revue

  1. Costa, M-C.; Létocart, L. and Roupin, F. A greedy algorithm for multicut and integral multiflow in rooted trees. In Operations Research Letters, 31: 21-27, 2003. www 

Articles de conférence

  1. Costa, M-C.; Jarray, F. and Picouleau, C. Quelques problèmes de tomographie discrète. In Ecole d'automne de recherche opérationnelle Tours, X, France, 2003. www 
  1. Létocart, L.; Costa, M-C. and Roupin, F. Minimal multicut and maximal integer multiflow in rings. In 18th International Conference on Mathematical Programming, Copenhague, Denmark, 2003. www 
  1. Létocart, L.; Costa, M-C. and Roupin, F. Multicoupe minimale et multiflot entier maximal dans un anneau. In Les Journées Graphes, Réseaux et Modélisation, Paris, France, 2003. www 
  1. Létocart, L.; Costa, M-C. and Roupin, F. Multicoupes minimales et multiflots maximaux en nombres entiers dans les anneaux. In 5ème congrès de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision, Avignon, France, 2003. www 

2002

Articles de conférence

  1. Costa, M-C.; de Werra, D. and Picouleau, C. On some special cases of an image reconstruction problem. In ECCO, Lugano, X, France, 2002. www 
  1. Costa, M-C.; Picouleau, C. and Zrikem, M. Solving the shortest multipaths problem on grids. In CIRO Marrakech, Maroc, X, France, 2002. www 
  1. Costa, M-C. Polynomial algorithms to solve the multiway cut and integer flow problems in trees. In CO'02 Combinatorial Optimization Paris, 8-10 avril and ECCO, Lugano, X, France, 2002. www 
  1. Costa, M-C.; Létocart, L. and Roupin, F. Multiflots entiers et multicoupes: analyse de leur difficulté. In ROADEF, Paris, X, France, 2002. www 
  1. Létocart, L.; Costa, M-C. and Roupin, F. Multiflots entiers et multicoupes: analyse de leur difficulté. In 4ème congrès de la Société Franc caise de Recherche Opérationnelle et d'Aide `a la Décision, Paris, France, 2002. www 

2001

Articles de conférence

  1. Létocart, L.; Costa, M-C. and Roupin, F. A greedy algorithm for multicut and integral multiflow in rooted trees. In Optimization Days, Québec, Canada, 2001. www 
  1. Létocart, L.; Costa, M-C. and Roupin, F. Multicut and integral multiflow : a survey. In The European Conference on Combinatorial Optimization - ECCO XIV, Bonn, Germany, 2001. www 

2000

Articles de conférence

  1. Costa, M-C.; Cr?mieu, J.L. and Roupin, F. A variable neighborhood search using an interior point descent method for the module allocation problem. In ECCO XIII, European chapter on combinatorial optimization, Capri, X, France, 2000. www 

1998

Articles de revue

  1. Billionnet, A.; Costa, M-C. and Thang, W-Y. Le placement de tâches dans la conception et l'utilisation d'une architecture distribuée. Une application `a EDF. In Technique et Science Informatiques, 17: 999-1015, 1998. www 

Articles de conférence

  1. Costa, M-C. Résolution des problèmes de placement, localisation et partitionnement de graphes. In ROADEF'98, X, France, 1998. www 

1997

Articles de conférence

  1. Costa, M-C. and P?letan, N. Solving the shortest edge disjoint or capacited undirected paths problems. In Int. Symp. on Mathematical Programming (ISPM 97), Lausanne, X, France, 1997. www 

1996

Articles de revue

  1. Chardaire, P.; Costa, M-C. and Sutter, A. Solving the dynamic facility location problem. Application to telecommunication networks. In Computer Networks Journal, 28: 117-124, 1996. www 

1995

Articles de conférence

  1. Costa, M-C. and Sutter, A. Solving real problems of dynamic location in telecommunication networks. In XXXIII TIMS-ORSA (INFORMS) Conference, Singapour, X, France, 1995. www 
  1. Costa, M-C. and Decocq, B. Etude comparative de logiciels généralistes pour la résolution de problèmes de localisation et de placement. In FRANCORO 95, Mons, Belgique, X, France, 1995. www 

1994

Articles de revue

  1. Costa, M-C. Persistency in Maximum cardinality bipartite matching. In Operations Research Letters, 15: 143-149, 1994. www 
  1. Billionnet, A. and Costa, M-C. Solving the uncapacited plant location problem on trees. In Discrete Applied Mathematics, 49: 51-59, 1994. www 

1992

Articles de revue

  1. Billionnet, A.; Costa, M-C. and Sutter, A. An efficient algorithm for a task allocation problem. In Journal of the ACM (JACM), 39: 502-518, 1992. www 
Haut