Recherche - Optimisation Combinatoire

572 résultats

	Pour les 572 documents Envoyer sur ORCID RSS ATOM Exporter BibTeX XML-TEI CSV RTF EndNote PDF HTML Export avancé	Page : Page précédente 1 2 3 4 5 6 7 8 9 10 Page suivante	triés par Pertinence Auteur A→Z Auteur Z→A Titre A→Z Titre Z→A Date de publication croissante Date de publication décroissante Date de dépôt croissante Date de dépôt décroissante

		A combinatorial proof of a theorem of Freund Frédéric Meunier Journal of Combinatorial Theory, Series A, 2008, 1/5 (2), pp.317-325 Article dans une revue hal-00363779v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		On some classical and new hypergraph invariants Andrea Munaro General Topology [math.GN]. Université Grenoble Alpes, 2016. English. ⟨NNT : 2016GREAM072⟩ Thèse tel-01680456v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Token Sliding on Chordal Graphs Nicolas Bousquet , Marthe Bonamy WG (Workshop on Graphs), Jun 2017, Heeze, Netherlands Communication dans un congrès hal-01653135v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case, Sylvia Boyd , Joseph Cheriyan , Robert Cummings , Logan Grout , S. Ibrahimpur , et al. APPROX 2020, Aug 2020, Seattle, United States. pp.61:1-61:12 Communication dans un congrès hal-03002877v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		On line graphs of subcubic triangle-free graphs Andrea Munaro Discrete Mathematics, 2017, 340 (6), pp.1210 - 1226. ⟨10.1016/j.disc.2017.01.006⟩ Article dans une revue hal-01568249v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Shorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs András Sebő , Jens Vygen Combinatorica, 2014, 34 (5), pp.597-629. ⟨10.1007/s00493-014-2960-3⟩ Article dans une revue hal-01592748v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs Marwane Bouznif , Julien Moncel , Myriam Preissmann Discrete Applied Mathematics, 2016, 208, pp.27-40. ⟨10.1016/j.dam.2016.03.009⟩ Article dans une revue hal-01579781v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Planning of Low Voltage Distribution Systems with Uncertainty on Load Demand Vannak Vai , Egor Gladkikh , Long Bun , Marie-Cécile Alvarez-Hérault , Bertrand Raison Regional Conference on Energy Engineering (RCEnE2016), Nov 2016, Phnom Penh, Cambodia Communication dans un congrès hal-01502759v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Study of Low-Voltage Distribution System with Integration of PV-Battery Energy Storage for Urban Area in Developing Country Vannak Vai , Egor Gladkikh , Long Bun , Marie-Cécile Alvarez-Hérault , Bertrand Raison 2017 IEEE International Conference on Environment and Electrical Engineering (EEEIC), Jun 2017, Milan, Italy Communication dans un congrès hal-01537193v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Parcours et Coupes Frédéric Meunier , András Sebő " Graphes et applications - vol.2 ", édité par JC Fournier, Hermes Lavoisier, chap 1, 2007 Chapitre d'ouvrage hal-00366985v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Odd pairs of cliques Michel Burlet , Frédéric Maffray graph theory in paris, 2006, pp.85-95 Article dans une revue hal-00363652v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Edge-connectivity augmentation of graphs over symmetric parity families Zoltán Szigeti Discrete Mathematics, 2008, 308 (24), pp.6527-6532 Article dans une revue hal-00363848v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Routages optimaux : tours, flots et chemins. Guyslain Naves Informatique [cs]. Université Joseph-Fourier - Grenoble I, 2010. Français. ⟨NNT : ⟩ Thèse tel-00465585v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		On circle graphs with girth at least five Louis Esperet , Pascal Ochem Discrete Mathematics, 2009, 309 (8), pp.2217-2222 Article dans une revue hal-00451863v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Covering symmetric semi-monotone functions Zoltán Szigeti , Roland Grappe Discrete Applied Mathematics, 2008, 156 (1), pp.138-144 Article dans une revue hal-00187293v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Multiflow Feasibility : an Annotated Tableau Guyslain Naves , András Sebő Research Trends in Combinatorial Optimization, Springer, pp.261-283, 2009 Chapitre d'ouvrage hal-00313948v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Comparison of Bundle and Classical Column Generation Olivier Briant , Claude Lemaréchal , Philippe Meurdesoif , Sophie Michel , Nancy Perrot , et al. Mathematical Programming, 2008, 113 (2), pp.299-344. ⟨10.1007/s10107-006-0079-z⟩ Article dans une revue inria-00342510v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Drawing disconnected graphs on the Klein bottle Laurent Beaudou , Antoine Gerbaud , Roland Grappe , Frédéric Palesi 2008 Pré-publication, Document de travail hal-00363494v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		A linear bound for the Colin de Verdière parameter $\mu$ for graphs embedded on surfaces Camille Lanuel , Francis Lazarus , Rudi Pendavingh 2023 Pré-publication, Document de travail hal-04010163v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		All finite sets are Ramsey in the maximum norm Andrey Kupavskii , Aresenii Sagdeev 2021 Pré-publication, Document de travail hal-03236582v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		The Salesman's Improved Paths through Forests András Sebő , Anke van Zuylen Journal of the ACM (JACM), 2019, 66 (4), pp.1 - 16. ⟨10.1145/3326123⟩ Article dans une revue hal-03002862v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Graphs with convex balls Jérémie Chalopin , Victor Chepoi , Ugo Giocanti 2024 Pré-publication, Document de travail hal-03550018v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Local boxicity Louis Esperet , Lyuben Lichev European Journal of Combinatorics, 2022, 102, pp.103495. ⟨10.1016/j.ejc.2021.103495⟩ Article dans une revue hal-03048296v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults David Adjiashvili , Felix Hommelsheim , Moritz Mühlenthaler , Oliver Schaudt 18th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, Jun 2022, Torshavn, Faroe Islands. pp.5:1--5:19, ⟨10.4230/LIPIcs.SWAT.2022.5⟩ Communication dans un congrès hal-04214508v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Flexible Graph Connectivity David Adjiashvili , Felix Hommelsheim , Moritz Mühlenthaler Mathematical Programming, 2022, 192 (1-2), pp.409-441. ⟨10.1007/s10107-021-01664-9⟩ Article dans une revue hal-04215559v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Sketching Distances in Monotone Graph Classes Louis Esperet , Nathaniel Harms , Andrey Kupavskii Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2022), Sep 2022, online, United States. pp.18:1-18:23, ⟨10.4230/LIPIcs.APPROX/RANDOM.2022.18⟩ Communication dans un congrès hal-03582311v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Coarse geometry of quasi-transitive graphs beyond planarity Louis Esperet , Ugo Giocanti 2023 Pré-publication, Document de travail hal-04349705v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Adjacency Labelling for Planar Graphs (and Beyond) Louis Esperet , Vida Dujmović , Cyril Gavoille , Gwenaël Joret , Piotr Micek , et al. Journal of the ACM (JACM), 2021, 68 (6), pp.1-33. ⟨10.1145/3477542⟩ Article dans une revue hal-03374608v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Locating Dominating Sets in local tournaments Thomas Bellitto , Caroline Brosse , Benjamin Lévêque , Aline Parreau Discrete Applied Mathematics, 2023, 337, pp.14-24. ⟨10.1016/j.dam.2023.04.010⟩ Article dans une revue hal-03417187v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More
		Sparse universal graphs for planarity Louis Esperet , Gwenaël Joret , Pat Morin Journal of the London Mathematical Society, 2023, 108 (4), pp.1333-1357. ⟨10.1112/jlms.12781⟩ Article dans une revue hal-02965331v1	Envoyer sur ORCID Exporter BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite Export avancé Partager Gmail Facebook X LinkedIn More

Filtrer vos résultats

A combinatorial proof of a theorem of Freund

On some classical and new hypergraph invariants

Token Sliding on Chordal Graphs

A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case,

On line graphs of subcubic triangle-free graphs

Shorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the path version, and 4/3 for two-edge-connected subgraphs

A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs

Planning of Low Voltage Distribution Systems with Uncertainty on Load Demand

Study of Low-Voltage Distribution System with Integration of PV-Battery Energy Storage for Urban Area in Developing Country

Parcours et Coupes

Odd pairs of cliques

Edge-connectivity augmentation of graphs over symmetric parity families

Routages optimaux : tours, flots et chemins.

On circle graphs with girth at least five

Covering symmetric semi-monotone functions

Multiflow Feasibility : an Annotated Tableau

Comparison of Bundle and Classical Column Generation

Drawing disconnected graphs on the Klein bottle

A linear bound for the Colin de Verdière parameter $\mu$ for graphs embedded on surfaces

All finite sets are Ramsey in the maximum norm

The Salesman's Improved Paths through Forests

Graphs with convex balls

Local boxicity

Fault-Tolerant Edge-Disjoint s-t Paths - Beyond Uniform Faults

Flexible Graph Connectivity

Sketching Distances in Monotone Graph Classes

Coarse geometry of quasi-transitive graphs beyond planarity

Adjacency Labelling for Planar Graphs (and Beyond)

Locating Dominating Sets in local tournaments

Sparse universal graphs for planarity