![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Marie-Christine Costa
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j42]Cédric Bentz, Marie-Christine Costa
, Pierre-Louis Poirion, Thomas Ridremont:
Robust capacitated Steiner trees and networks with uniform demands. Networks 82(1): 3-31 (2023) - 2020
- [j41]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau:
Minimal graphs for 2-factor extension. Discret. Appl. Math. 282: 65-79 (2020) - [j40]Cédric Bentz, Marie-Christine Costa, Alain Hertz
:
On the edge capacitated Steiner tree problem. Discret. Optim. 38: 100607 (2020)
2010 – 2019
- 2018
- [j39]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau
:
Minimal graphs for matching extensions. Discret. Appl. Math. 234: 47-55 (2018) - [j38]Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Formulations for designing robust networks. An application to wind power collection. Electron. Notes Discret. Math. 64: 365-374 (2018) - [i3]Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Robust capacitated trees and networks with uniform demands. CoRR abs/1801.04696 (2018) - [i2]Cédric Bentz, Marie-Christine Costa, Pierre-Louis Poirion, Thomas Ridremont:
Formulations for designing robust networks. An application to wind power collection. CoRR abs/1806.06704 (2018) - 2016
- [j37]Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion:
Robust optimal sizing of a hybrid energy stand-alone system. Eur. J. Oper. Res. 254(2): 565-575 (2016) - [i1]Cédric Bentz, Marie-Christine Costa, Alain Hertz:
On the edge capacitated Steiner tree problem. CoRR abs/1607.07082 (2016) - 2014
- [j36]Alain Billionnet, Marie-Christine Costa, Pierre-Louis Poirion:
2-stage robust MILP with continuous recourse variables. Discret. Appl. Math. 170: 21-32 (2014) - [c4]Marie-Christine Costa:
A Robust Approach to Solve Mixed Integer Linear Optimization Problems with Uncertain Data. ICORES 2014: IS-7 - 2013
- [j35]Cédric Hervet, Alain Faye, Marie-Christine Costa, Matthieu Chardy, Stanislas Francfort:
Solving the Two-Stage Robust FTTH network design Problem under Demand Uncertainty. Electron. Notes Discret. Math. 41: 335-342 (2013) - 2012
- [j34]Matthieu Chardy, Marie-Christine Costa, Alain Faye, M. Trampont:
Optimizing splitter and fiber location in a multilevel optical FTTH network. Eur. J. Oper. Res. 222(3): 430-440 (2012) - [j33]Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries
, Dominique de Werra:
d-Transversals of stable sets and vertex covers in weighted bipartite graphs. J. Discrete Algorithms 17: 95-102 (2012) - 2011
- [j32]Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
:
Minimum d-Transversals of Maximum-Weight Stable Sets in Trees. Electron. Notes Discret. Math. 38: 129-134 (2011) - [j31]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau:
Minimum d-blockers and d-transversals in graphs. J. Comb. Optim. 22(4): 857-872 (2011) - 2010
- [j30]Dominique de Werra, Marie-Christine Costa, Christophe Picouleau, Bernard Ries
:
On the use of graphs in discrete tomography. Ann. Oper. Res. 175(1): 287-307 (2010) - [j29]Bernard Ries
, Cédric Bentz, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Rico Zenklusen:
Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid. Discret. Math. 310(1): 132-146 (2010)
2000 – 2009
- 2009
- [j28]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
:
Graph coloring with cardinality constraints on the neighborhoods. Discret. Optim. 6(4): 362-369 (2009) - [j27]Rico Zenklusen, Bernard Ries
, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Cédric Bentz:
Blockers and transversals. Discret. Math. 309(13): 4306-4314 (2009) - [j26]Cédric Bentz, Marie-Christine Costa, Lucas Létocart, Frédéric Roupin:
Multicuts and integral multiflows in rings. Eur. J. Oper. Res. 196(3): 1251-1254 (2009) - [j25]Cédric Bentz, Marie-Christine Costa, Nicolas Derhy, Frédéric Roupin:
Cardinality constrained and multicriteria (multi)cut problems. J. Discrete Algorithms 7(1): 102-111 (2009) - [j24]Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Bernard Ries, Dominique de Werra:
Degree-constrained edge partitioning in graphs arising from discrete tomography. J. Graph Algorithms Appl. 13(2): 99-118 (2009) - 2008
- [j23]Dominique de Werra, Marie-Christine Costa, Christophe Picouleau, Bernard Ries
:
On the use of graphs in discrete tomography. 4OR 6(2): 101-123 (2008) - [j22]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
:
Addendum to "Bicolored Matchings in Some Classes of Graphs". Graphs Comb. 24(2): 127-128 (2008) - [j21]Fethi Jarray, Marie-Christine Costa, Christophe Picouleau:
Complexity results for the horizontal bar packing problem. Inf. Process. Lett. 108(6): 356-359 (2008) - [j20]Cédric Bentz, Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
:
On a graph coloring problem arising from discrete tomography. Networks 51(4): 256-267 (2008) - [c3]Fethi Jarray, Marie-Christine Costa, Christophe Picouleau:
Approximating hv-Convex Binary Matrices and Images from Discrete Projections. DGCI 2008: 413-422 - 2007
- [j19]Cédric Bentz, Marie-Christine Costa, Lucas Létocart, Frédéric Roupin:
Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69]. Eur. J. Oper. Res. 177(2): 1312 (2007) - [j18]Cédric Bentz, Marie-Christine Costa, Christophe Picouleau, Maria Zrikem:
The shortest multipaths problem in a capacitated dense channel. Eur. J. Oper. Res. 178(3): 926-931 (2007) - [j17]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
:
Bicolored Matchings in Some Classes of Graphs. Graphs Comb. 23(1): 47-60 (2007) - [j16]Cédric Bentz, Marie-Christine Costa, Frédéric Roupin:
Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs. J. Discrete Algorithms 5(1): 36-54 (2007) - 2006
- [j15]Marie-Christine Costa, Fethi Jarray, Christophe Picouleau:
An acyclic days-off scheduling problem. 4OR 4(1): 73-85 (2006) - [j14]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau:
Using graphs for some discrete tomography problems. Discret. Appl. Math. 154(1): 35-46 (2006) - [j13]Marie-Christine Costa, Lucas Létocart, Frédéric Roupin:
Erratum to "A greedy algorithm for multicut and integral multiflow in rooted tress" [Oper. Res. Lett 31(1) (2003) 21-27]. Oper. Res. Lett. 34(4): 477 (2006) - 2005
- [j12]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, David Schindl
:
A solvable case of image reconstruction in discrete tomography. Discret. Appl. Math. 148(3): 240-245 (2005) - [j11]Marie-Christine Costa, Fethi Jarray, Christophe Picouleau:
Reconstruction of binary matrices under adjacency constraints. Electron. Notes Discret. Math. 20: 281-297 (2005) - [j10]Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries
:
Bicolored matchings in some classes of graphs. Electron. Notes Discret. Math. 22: 207-211 (2005) - [j9]Marie-Christine Costa, Lucas Létocart, Frédéric Roupin:
Minimal multicut and maximal integer multiflow: A survey. Eur. J. Oper. Res. 162(1): 55-69 (2005) - [c2]Marie-Christine Costa, Fethi Jarray, Christophe Picouleau:
Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections. ICTCS 2005: 173-181 - 2004
- [j8]Marie-Christine Costa, Alain Billionnet:
Multiway cut and integer flow problems in trees. Electron. Notes Discret. Math. 17: 105-109 (2004) - [c1]Marie-Christine Costa, Alain Billionnet:
Multiway Cut and Integer Flow Problems in Trees. CTW 2004: 96-99 - 2003
- [j7]Marie-Christine Costa, Lucas Létocart, Frédéric Roupin:
A greedy algorithm for multicut and integral multiflow in rooted trees. Oper. Res. Lett. 31(1): 21-27 (2003) - 2002
- [j6]Marie-Christine Costa, Alain Hertz, Michel Mittaz:
Bounds and Heuristics for the Shortest Capacitated Paths Problem. J. Heuristics 8(4): 449-465 (2002) - [j5]Marie-Christine Costa, F.-R. Monclar, Maria Zrikem:
Variable neighborhood decomposition search for the optimization of power plant cable layout. J. Intell. Manuf. 13(5): 353-365 (2002)
1990 – 1999
- 1996
- [j4]Pierre Chardaire, Alain Sutter, Marie-Christine Costa:
Solving the dynamic facility location problem. Networks 28(2): 117-124 (1996) - 1994
- [j3]Alain Billionnet, Marie-Christine Costa:
Solving the Uncapacited Plant Location Problem on Trees. Discret. Appl. Math. 49(1-3): 51-59 (1994) - [j2]Marie-Christine Costa:
Persistency in maximum cardinality bipartite matchings. Oper. Res. Lett. 15(3): 143-149 (1994) - 1992
- [j1]Alain Billionnet, Marie-Christine Costa, Alain Sutter:
An Efficient Algorithm for a Task Allocation Problem. J. ACM 39(3): 502-518 (1992)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-10 20:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint