default search action
Odile Marcotte
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c8]Moussa Abdenbi, Alexandre Blondin Massé, Alain Goupil, Odile Marcotte:
On the Confluence of Directed Graph Reductions Preserving Feedback Vertex Set Minimality. GASCom 2024: 6-11
2010 – 2019
- 2017
- [j20]Alain Hertz, Odile Marcotte, Asma Mdimagh, Michel Carreau, François Welt:
Design of a wind farm collection network when several cable types are available. J. Oper. Res. Soc. 68(1): 62-73 (2017) - 2016
- [j19]Philippe Vincent-Lamarre
, Alexandre Blondin Massé, Marcos Lopes, Mélanie Lord, Odile Marcotte, Stevan Harnad
The Latent Structure of Dictionaries. Top. Cogn. Sci. 8(3): 625-659 (2016) - 2014
- [j18]Mounira Groiez, Guy Desaulniers
Valid Inequalities and Separation Algorithms for the Set Partitioning Problem. INFOR Inf. Syst. Oper. Res. 52(4): 185-196 (2014) - [i4]Philippe Vincent-Lamarre, Alexandre Blondin Massé, Marcos Lopes, Mélanie Lord, Odile Marcotte, Stevan Harnad:
The Latent Structure of Dictionaries. CoRR abs/1411.0129 (2014) - 2013
- [j17]Mounira Groiez, Guy Desaulniers, Ahmed Hadjar, Odile Marcotte:
Separating valid odd-cycle and odd-set inequalities for the multiple depot vehicle scheduling problem. EURO J. Comput. Optim. 1(3-4): 283-312 (2013) - [i3]Olivier Picard, Mélanie Lord, Alexandre Blondin Massé, Odile Marcotte, Marcos Lopes, Stevan Harnad:
Hidden Structure and Function in the Lexicon. CoRR abs/1308.2428 (2013) - 2012
- [j16]Alain Hertz, Odile Marcotte, Asma Mdimagh, Michel Carreau, François Welt:
Optimizing the Design of a Wind Farm Collection Network. INFOR Inf. Syst. Oper. Res. 50(2): 95-104 (2012)
2000 – 2009
- 2009
- [j15]Samuel Fiorini, Odile Marcotte:
On the feedback vertex set polytope of a series-parallel graph. Discret. Optim. 6(3): 271-287 (2009) - [j14]Pierre Hansen, Alain Hertz, Rim Kilani, Odile Marcotte, David Schindl
Average distance and maximum induced forest. J. Graph Theory 60(1): 31-54 (2009) - [i2]Olivier Picard, Alexandre Blondin Massé, Stevan Harnad, Odile Marcotte, Guillaume Chicoisne, Yassine Gargouri:
Hierarchies in Dictionary Definition Space. CoRR abs/0911.5703 (2009) - 2008
- [j13]Têkogan D. Hemazro, Brigitte Jaumard, Odile Marcotte:
A column generation and branch-and-cut algorithm for the channel assignment problem. Comput. Oper. Res. 35(4): 1204-1226 (2008) - [i1]Alexandre Blondin Massé, Guillaume Chicoisne, Yassine Gargouri, Stevan Harnad, Olivier Picard, Odile Marcotte:
How Is Meaning Grounded in Dictionary Definitions? CoRR abs/0806.3710 (2008) - 2006
- [j12]Ahmed Hadjar, Odile Marcotte, François Soumis:
A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem. Oper. Res. 54(1): 130-149 (2006) - [j11]Mohamed Hamdouni, Guy Desaulniers
Dispatching Buses in a Depot Using Block Patterns. Transp. Sci. 40(3): 364-377 (2006) - [c7]Anis Ouali, Brigitte Kerhervé, Odile Marcotte, Paul Landon:
Adaptation Scenarios for New Media Artworks. ICME 2006: 1933-1936 - 2005
- [c6]Anis Ouali, Brigitte Kerhervé, Odile Marcotte, Paul Landon:
Un modèle d'adaptation pour les oeuvres médiatiques. EGC (Ateliers) 2005: 147-152 - 2002
- [j10]Brigitte Jaumard, Odile Marcotte, Christophe Meyer, Tsevi Vovor:
Erratum to "Comparison of column generation models for channel assignment in cellular networks". Discret. Appl. Math. 118(3): 299-322 (2002) - 2001
- [j9]Odile Marcotte:
Optimal Edge-Colourings for a Class of Planar Multigraphs. Comb. 21(3): 361-394 (2001) - [j8]Brigitte Jaumard, Odile Marcotte, Christophe Meyer, Tsevi Vovor:
Comparison of column generation models for channel assignment in cellular networks. Discret. Appl. Math. 112(1-3): 217-240 (2001) - 2000
- [j7]Steven Chamberland, Brunilde Sansò, Odile Marcotte:
Topological Design of Two-Level Telecommunication Networks with Modular Switches. Oper. Res. 48(5): 745-760 (2000)
1990 – 1999
- 1997
- [c5]Steven Chamberland, Brunilde Sansò, Odile Marcotte:
Heuristics for Ring Network Design When Several Types of Switches are Available. ICC (2) 1997: 570-574 - 1991
- [j6]Odile Marcotte, Subhash Suri:
Fast Matching Algorithms for Points on a Polygon. SIAM J. Comput. 20(3): 405-422 (1991) - 1990
- [j5]Odile Marcotte, Paul D. Seymour
Extending an edge-coloring. J. Graph Theory 14(5): 565-573 (1990) - [j4]Dan Bienstock, Odile Marcotte:
On a Network Design Problem That Is Intractable on Trees. Math. Oper. Res. 15(3): 530-544 (1990) - [c4]Odile Marcotte:
Exact Edge-Colorings of Graphs without Prescribed Minors. Polyhedral Combinatorics 1990: 235-244 - [c3]Odile Marcotte:
On the Chromatic Index of Multigraphs and a Conjecture of Seymour, (II). Polyhedral Combinatorics 1990: 245-280
1980 – 1989
- 1989
- [c2]Odile Marcotte, Subhash Suri:
On Geometric Matching. SCG 1989: 302-314 - [c1]Odile Marcotte, Subhash Suri:
Fast Matching Algorithms for Points on a Polygon (Extended Abstract). FOCS 1989: 60-65 - 1987
- [j3]Robert E. Bixby, Odile M.-C. Marcotte, Leslie E. Trotter Jr.:
Packing and covering with integral feasible flows in integral supply-demand networks. Math. Program. 39(3): 231-239 (1987) - 1986
- [j2]Odile Marcotte:
On the chromatic index of multigraphs and a conjecture of Seymour (I). J. Comb. Theory B 41(3): 306-331 (1986) - 1985
- [j1]Odile Marcotte:
The cutting stock problem and integer rounding. Math. Program. 33(1): 82-92 (1985)
Coauthor Index
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-11-07 20:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: