An Efficient Algorithm for a Task Allocation Problem. - Alain Billionnet; Marie-Christine Costa; Alain Sutter (J. ACM, 1992)

Solving the Uncapacited Plant Location Problem on Trees. - Alain Billionnet; Marie-Christine Costa (Discret. Appl. Math., 1994)

Persistency in maximum cardinality bipartite matchings. - Marie-Christine Costa (Oper. Res. Lett., 1994)

Solving the dynamic facility location problem. - Pierre Chardaire; Alain Sutter; Marie-Christine Costa (Networks, 1996)

Bounds and Heuristics for the Shortest Capacitated Paths Problem. - Marie-Christine Costa; Alain Hertz; Michel Mittaz (J. Heuristics, 2002)

Variable neighborhood decomposition search for the optimization of power plant cable layout. - Marie-Christine Costa; F.-R. Monclar; Maria Zrikem (J. Intell. Manuf., 2002)

A greedy algorithm for multicut and integral multiflow in rooted trees. - Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Oper. Res. Lett., 2003)

Multiway cut and integer flow problems in trees. - Marie-Christine Costa; Alain Billionnet (Electron. Notes Discret. Math., 2004)

Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections. - Marie-Christine Costa; Fethi Jarray; Christophe Picouleau (ICTCS, 2005)

A solvable case of image reconstruction in discrete tomography. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; David Schindl (Discret. Appl. Math., 2005)

Reconstruction of binary matrices under adjacency constraints. - Marie-Christine Costa; Fethi Jarray; Christophe Picouleau (Electron. Notes Discret. Math., 2005)

Bicolored matchings in some classes of graphs. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Electron. Notes Discret. Math., 2005)

Minimal multicut and maximal integer multiflow: A survey. - Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Eur. J. Oper. Res., 2005)

An acyclic days-off scheduling problem. - Marie-Christine Costa; Fethi Jarray; Christophe Picouleau (4OR, 2006)

Using graphs for some discrete tomography problems. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau (Discret. Appl. Math., 2006)

Erratum to "A greedy algorithm for multicut and integral multiflow in rooted tress" [Oper. Res. Lett 31(1) (2003) 21-27]. - Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Oper. Res. Lett., 2006)

Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69]. - Cédric Bentz; Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Eur. J. Oper. Res., 2007)

The shortest multipaths problem in a capacitated dense channel. - Cédric Bentz; Marie-Christine Costa; Christophe Picouleau; Maria Zrikem (Eur. J. Oper. Res., 2007)

Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs. - Cédric Bentz; Marie-Christine Costa; Frédéric Roupin (J. Discrete Algorithms, 2007)

Approximating hv-Convex Binary Matrices and Images from Discrete Projections. - Fethi Jarray; Marie-Christine Costa; Christophe Picouleau (DGCI, 2008)

On the use of graphs in discrete tomography. - Dominique de Werra; Marie-Christine Costa; Christophe Picouleau; Bernard Ries (4OR, 2008)

Addendum to "Bicolored Matchings in Some Classes of Graphs". - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Graphs Comb., 2008)

Complexity results for the horizontal bar packing problem. - Fethi Jarray; Marie-Christine Costa; Christophe Picouleau (Inf. Process. Lett., 2008)

On a graph coloring problem arising from discrete tomography. - Cédric Bentz; Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Networks, 2008)

Graph coloring with cardinality constraints on the neighborhoods. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Discret. Optim., 2009)

Blockers and transversals. - Rico Zenklusen; Bernard Ries; Christophe Picouleau; Dominique de Werra; Marie-Christine Costa; Cédric Bentz (Discret. Math., 2009)

Multicuts and integral multiflows in rings. - Cédric Bentz; Marie-Christine Costa; Lucas Létocart; Frédéric Roupin (Eur. J. Oper. Res., 2009)

Cardinality constrained and multicriteria (multi)cut problems. - Cédric Bentz; Marie-Christine Costa; Nicolas Derhy; Frédéric Roupin (J. Discrete Algorithms, 2009)

Degree-constrained edge partitioning in graphs arising from discrete tomography. - Cédric Bentz; Marie-Christine Costa; Christophe Picouleau; Bernard Ries; Dominique de Werra (J. Graph Algorithms Appl., 2009)

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. - Bernard Ries; Cédric Bentz; Christophe Picouleau; Dominique de Werra; Marie-Christine Costa; Rico Zenklusen (Discret. Math., 2010)

Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. - Cédric Bentz; Marie-Christine Costa; Dominique de Werra; Christophe Picouleau; Bernard Ries (Electron. Notes Discret. Math., 2011)

Minimum d-blockers and d-transversals in graphs. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau (J. Comb. Optim., 2011)

Optimizing splitter and fiber location in a multilevel optical FTTH network. - Matthieu Chardy; Marie-Christine Costa; Alain Faye; M. Trampont (Eur. J. Oper. Res., 2012)

d-Transversals of stable sets and vertex covers in weighted bipartite graphs. - Cédric Bentz; Marie-Christine Costa; Christophe Picouleau; Bernard Ries; Dominique de Werra (J. Discrete Algorithms, 2012)

Solving the Two-Stage Robust FTTH network design Problem under Demand Uncertainty. - Cédric Hervet; Alain Faye; Marie-Christine Costa; Matthieu Chardy; Stanislas Francfort (Electron. Notes Discret. Math., 2013)

A Robust Approach to Solve Mixed Integer Linear Optimization Problems with Uncertain Data. - Marie-Christine Costa (ICORES, 2014)

2-stage robust MILP with continuous recourse variables. - Alain Billionnet; Marie-Christine Costa; Pierre-Louis Poirion (Discret. Appl. Math., 2014)

Robust optimal sizing of a hybrid energy stand-alone system. - Alain Billionnet; Marie-Christine Costa; Pierre-Louis Poirion (Eur. J. Oper. Res., 2016)

Robust capacitated trees and networks with uniform demands. - Cédric Bentz; Marie-Christine Costa; Pierre-Louis Poirion; Thomas Ridremont (CoRR, 2018)

Minimal graphs for matching extensions. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau (Discret. Appl. Math., 2018)

Formulations for designing robust networks. An application to wind power collection. - Cédric Bentz; Marie-Christine Costa; Pierre-Louis Poirion; Thomas Ridremont (Electron. Notes Discret. Math., 2018)

Minimal graphs for 2-factor extension. - Marie-Christine Costa; Dominique de Werra; Christophe Picouleau (Discret. Appl. Math., 2020)

On the edge capacitated Steiner tree problem. - Cédric Bentz; Marie-Christine Costa; Alain Hertz (Discret. Optim., 2020)

Robust capacitated Steiner trees and networks with uniform demands. - Cédric Bentz; Marie-Christine Costa; Pierre-Louis Poirion; Thomas Ridremont (Networks, 2023)