Odile Marcotte

According to our database1, Odile Marcotte authored at least 31 papers between 1985 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality.
Proceedings of the 13th edition of the conference on Random Generation of Combinatorial Structures. Polyominoes and Tilings, 2024

2017
Design of a wind farm collection network when several cable types are available.
J. Oper. Res. Soc., 2017

2016
The Latent Structure of Dictionaries.
Top. Cogn. Sci., 2016

2014
Valid Inequalities and Separation Algorithms for the Set Partitioning Problem.
INFOR Inf. Syst. Oper. Res., 2014

2013
Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem.
EURO J. Comput. Optim., 2013

Hidden Structure and Function in the Lexicon.
CoRR, 2013

2012
Optimizing the Design of a Wind Farm Collection Network.
INFOR Inf. Syst. Oper. Res., 2012

2009
Average distance and maximum induced forest.
J. Graph Theory, 2009

On the feedback vertex set polytope of a series-parallel graph.
Discret. Optim., 2009

Hierarchies in Dictionary Definition Space
CoRR, 2009

2008
How Is Meaning Grounded in Dictionary Definitions?
CoRR, 2008

A column generation and branch-and-cut algorithm for the channel assignment problem.
Comput. Oper. Res., 2008

2006
Dispatching Buses in a Depot Using Block Patterns.
Transp. Sci., 2006

A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem.
Oper. Res., 2006

Adaptation Scenarios for New Media Artworks.
Proceedings of the 2006 IEEE International Conference on Multimedia and Expo, 2006

2005
Un modèle d'adaptation pour les oeuvres médiatiques.
Proceedings of the Extraction des connaissances : Etat et perspectives (Ateliers de la conférence EGC'2005), 2005

2002
Erratum to "Comparison of column generation models for channel assignment in cellular networks".
Discret. Appl. Math., 2002

2001
Comparison of column generation models for channel assignment in cellular networks.
Discret. Appl. Math., 2001

Optimal Edge-Colourings for a Class of Planar Multigraphs.
Comb., 2001

2000
Topological Design of Two-Level Telecommunication Networks with Modular Switches.
Oper. Res., 2000

1997
Heuristics for Ring Network Design When Several Types of Switches are Available.
Proceedings of the 1997 IEEE International Conference on Communications: Towards the Knowledge Millennium, 1997

1991
Fast Matching Algorithms for Points on a Polygon.
SIAM J. Comput., 1991

1990
On a Network Design Problem That Is Intractable on Trees.
Math. Oper. Res., 1990

Extending an edge-coloring.
J. Graph Theory, 1990

On the Chromatic Index of Multigraphs and a Conjecture of Seymour, (II).
Proceedings of the Polyhedral Combinatorics, 1990

Exact Edge-Colorings of Graphs without Prescribed Minors.
Proceedings of the Polyhedral Combinatorics, 1990

1989
Fast Matching Algorithms for Points on a Polygon (Extended Abstract)
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989

On Geometric Matching.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1987
Packing and covering with integral feasible flows in integral supply-demand networks.
Math. Program., 1987

1986
On the chromatic index of multigraphs and a conjecture of Seymour (I).
J. Comb. Theory B, 1986

1985
The cutting stock problem and integer rounding.
Math. Program., 1985


  Loading...