Marie-Christine Costa

Thomas Ridremont

Networks, July, 2023

2020

On the edge capacitated Steiner tree problem.

[BibT_eX]

[DOI]

Alain Hertz

Discret. Optim., 2020

Minimal graphs for 2-factor extension.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2018

Formulations for designing robust networks. An application to wind power collection.

[BibT_eX]

[DOI]

Thomas Ridremont

Electron. Notes Discret. Math., 2018

Minimal graphs for matching extensions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2018

Robust capacitated trees and networks with uniform demands.

[BibT_eX]

[DOI]

Thomas Ridremont

CoRR, 2018

2016

Robust optimal sizing of a hybrid energy stand-alone system.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2016

2014

2-stage robust MILP with continuous recourse variables.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

A Robust Approach to Solve Mixed Integer Linear Optimization Problems with Uncertain Data.

[BibT_eX]

Proceedings of the ICORES 2014, 2014

2013

Solving the Two-Stage Robust FTTH network design Problem under Demand Uncertainty.

[BibT_eX]

[DOI]

Cédric Hervet

Alain Faye

Matthieu Chardy

Stanislas Francfort

Electron. Notes Discret. Math., 2013

2012

d-Transversals of stable sets and vertex covers in weighted bipartite graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2012

Optimizing splitter and fiber location in a multilevel optical FTTH network.

[BibT_eX]

[DOI]

Matthieu Chardy

Alain Faye

M. Trampont

Eur. J. Oper. Res., 2012

2011

Minimum d-blockers and d-transversals in graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

Minimum d-Transversals of Maximum-Weight Stable Sets in Trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

2010

Blockers and transversals in some subclasses of bipartite graphs: When caterpillars are dancing on a grid.

[BibT_eX]

[DOI]

Rico Zenklusen

Discret. Math., 2010

2009

Degree-constrained edge partitioning in graphs arising from discrete tomography.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2009

Cardinality constrained and multicriteria (multi)cut problems.

[BibT_eX]

[DOI]

Nicolas Derhy

J. Discrete Algorithms, 2009

Multicuts and integral multiflows in rings.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2009

Blockers and transversals.

[BibT_eX]

[DOI]

Discret. Math., 2009

Graph coloring with cardinality constraints on the neighborhoods.

[BibT_eX]

[DOI]

Discret. Optim., 2009

2008

On a graph coloring problem arising from discrete tomography.

[BibT_eX]

[DOI]

Networks, 2008

Complexity results for the horizontal bar packing problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2008

Addendum to "Bicolored Matchings in Some Classes of Graphs".

[BibT_eX]

[DOI]

Graphs Comb., 2008

On the use of graphs in discrete tomography.

[BibT_eX]

[DOI]

4OR, 2008

Approximating hv-Convex Binary Matrices and Images from Discrete Projections.

[BibT_eX]

[DOI]

Proceedings of the Discrete Geometry for Computer Imagery, 2008

2007

Maximum integer multiflow and minimum multicut problems in two-sided uniform grid graphs.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2007

The shortest multipaths problem in a capacitated dense channel.

[BibT_eX]

[DOI]

Maria Zrikem

Eur. J. Oper. Res., 2007

Erratum to "Minimal multicut and maximal integer multiflow: A survey" [European Journal of Operational Research 162 (1) (2005) 55-69].

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2007

2006

Erratum to "A greedy algorithm for multicut and integral multiflow in rooted tress" [Oper. Res. Lett 31(1) (2003) 21-27].

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

Using graphs for some discrete tomography problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2006

An acyclic days-off scheduling problem.

[BibT_eX]

[DOI]

4OR, 2006

2005

Minimal multicut and maximal integer multiflow: A survey.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2005

Bicolored matchings in some classes of graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Reconstruction of binary matrices under adjacency constraints.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

A solvable case of image reconstruction in discrete tomography.

[BibT_eX]

[DOI]

David Schindl

Discret. Appl. Math., 2005

Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 9th Italian Conference, 2005

2004

Multiway cut and integer flow problems in trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2004

2003

A greedy algorithm for multicut and integral multiflow in rooted trees.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2003

2002

Variable neighborhood decomposition search for the optimization of power plant cable layout.

[BibT_eX]

[DOI]

F.-R. Monclar

Maria Zrikem

J. Intell. Manuf., 2002

Bounds and Heuristics for the Shortest Capacitated Paths Problem.

[BibT_eX]

[DOI]

Alain Hertz

Michel Mittaz

J. Heuristics, 2002

1996

Solving the dynamic facility location problem.

[BibT_eX]

[DOI]

Pierre Chardaire

Alain Sutter

Networks, 1996

1994

Persistency in maximum cardinality bipartite matchings.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1994

Solving the Uncapacited Plant Location Problem on Trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1992

An Efficient Algorithm for a Task Allocation Problem.

[BibT_eX]

[DOI]