Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Annegret Wagler"'
Autor:
Annegret Wagler
Publikováno v:
Discrete Applied Mathematics. 308:209-219
This work is devoted to the study of the Lovasz–Schrijver PSD-operator L S + applied to the edge relaxation ESTAB ( G ) of the stable set polytope STAB ( G ) of a graph G . In order to characterize the graphs G for which STAB ( G ) is achieved in o
Publikováno v:
SN Computer Science
SN Computer Science, 2023, 4 (1), pp.79. ⟨10.1007/s42979-022-01486-2⟩
SN Computer Science, 2023, 4 (1), pp.79. ⟨10.1007/s42979-022-01486-2⟩
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8c399dc321a17cdb34bf8480b55c3d13
https://hal.science/hal-03903422
https://hal.science/hal-03903422
Publikováno v:
Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints
Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints, 13526, Springer International Publishing, pp.22-34, 2022, Lecture Notes in Computer Science, ⟨10.1007/978-3-031-18530-4_2⟩
Lecture Notes in Computer Science ISBN: 9783031185298
Branch-and-Cut for a 2-Commodity Flow Relocation Model with Time Constraints, 13526, Springer International Publishing, pp.22-34, 2022, Lecture Notes in Computer Science, ⟨10.1007/978-3-031-18530-4_2⟩
Lecture Notes in Computer Science ISBN: 9783031185298
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9766cd8845c100e5fdfbf3c8aa89cedf
https://hal.science/hal-03903441
https://hal.science/hal-03903441
Publikováno v:
11th International Conference on Operations Research and Enterprise Systems
11th International Conference on Operations Research and Enterprise Systems, Feb 2022, Online Streaming, France. pp.17-27, ⟨10.5220/0010787000003117⟩
11th International Conference on Operations Research and Enterprise Systems, Feb 2022, Online Streaming, France. pp.17-27, ⟨10.5220/0010787000003117⟩
International audience
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9bd87d98b1436b66a3b53f69d862054d
https://hal.science/hal-03903462
https://hal.science/hal-03903462
Publikováno v:
Combinatorial Optimization. ISCO 2020
Combinatorial Optimization. ISCO 2020, pp.3-14, 2020, Print 978-3-030-53261-1 / Online 978-3-030-53262-8. ⟨10.1007/978-3-030-53262-8_1⟩
Lecture Notes in Computer Science ISBN: 9783030532611
ISCO
Combinatorial Optimization. ISCO 2020, pp.3-14, 2020, Print 978-3-030-53261-1 / Online 978-3-030-53262-8. ⟨10.1007/978-3-030-53262-8_1⟩
Lecture Notes in Computer Science ISBN: 9783030532611
ISCO
International audience; The problems of determining open locating-dominating or locating total-dominating sets of minimum cardinality in a graph G are variations of the classical minimum dominating set problem in G and are all known to be hard for ge
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba0bdf53b8ab5e27ffc0eb834bb6f7c4
https://hal.uca.fr/hal-03152094
https://hal.uca.fr/hal-03152094
Publikováno v:
Discrete Applied Mathematics
Discrete Applied Mathematics, 2020, 281, pp.6-41. ⟨10.1016/j.dam.2019.08.001⟩
Discrete Applied Mathematics, Elsevier, 2020, 281, pp.6-41. ⟨10.1016/j.dam.2019.08.001⟩
Discrete Applied Mathematics, 2020, 281, pp.6-41. ⟨10.1016/j.dam.2019.08.001⟩
Discrete Applied Mathematics, Elsevier, 2020, 281, pp.6-41. ⟨10.1016/j.dam.2019.08.001⟩
International audience; The problems of determining minimum identifying, locating-dominating or open locating-dominating codes are special search problems that are challenging both from a theoretical and a computational point of view, even for severa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::830f7b7860c4dc5ae8549c5071a7ae71
https://hal.uca.fr/hal-03154751/document
https://hal.uca.fr/hal-03154751/document
Publikováno v:
Electronic Notes in Discrete Mathematics
Electronic Notes in Discrete Mathematics, Elsevier, 2018, 69, pp.85-92. ⟨10.1016/j.endm.2018.07.012⟩
Electronic Notes in Discrete Mathematics, 2018, 69, pp.85-92. ⟨10.1016/j.endm.2018.07.012⟩
Electronic Notes in Discrete Mathematics, Elsevier, 2018, 69, pp.85-92. ⟨10.1016/j.endm.2018.07.012⟩
Electronic Notes in Discrete Mathematics, 2018, 69, pp.85-92. ⟨10.1016/j.endm.2018.07.012⟩
International audience; We study minor related row family inequalities for the set covering polyhedron of circular matrices. We address the issue of generating these inequalities via the Chvátal-Gomory procedure and establish a general upper bound f
Publikováno v:
LAGOS
Electronic Notes in Theoretical Computer Science
LAGOS 2019
LAGOS 2019, Jun 2019, Belo Horizonte, Brazil. pp.135-145, ⟨10.1016/j.entcs.2019.08.013⟩
Electronic Notes in Theoretical Computer Science
LAGOS 2019
LAGOS 2019, Jun 2019, Belo Horizonte, Brazil. pp.135-145, ⟨10.1016/j.entcs.2019.08.013⟩
International audience; The problems of determining minimum identifying, locating-dominating, open locating-dominating or locating total-dominating codes in a graph G are variations of the classical minimum dominating set problem in G and are all kno
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6e0dd95e273f98f3826dd5d55214441e
https://hal.uca.fr/hal-02017469/document
https://hal.uca.fr/hal-02017469/document
Building biological models by inferring functional dependencies from experimental data is an important issue in Molecular Biology. To relieve the biologist from this traditionally manual process, various approaches have been proposed to increase the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e584eae42fbcb036bf3f4689d329c9b5
https://publishup.uni-potsdam.de/frontdoor/index/index/docId/41241
https://publishup.uni-potsdam.de/frontdoor/index/index/docId/41241
Publikováno v:
RAIRO-Operations Research
RAIRO-Operations Research, 2019, 53, pp.1007-1031. ⟨10.1051/ro/2018042⟩
RAIRO-Operations Research, EDP Sciences, In press, ⟨10.1051/ro/2018042⟩
RAIRO-Operations Research, 2019, 53, pp.1007-1031. ⟨10.1051/ro/2018042⟩
RAIRO-Operations Research, EDP Sciences, In press, ⟨10.1051/ro/2018042⟩
The VIPAFLEET project consists in developing models and algorithms for man- aging a fleet of Individual Public Autonomous Vehicles (VIPA). Hereby, we consider a fleet of cars distributed at specified stations in an industrial area to supply internal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2447461275969c961792eb54776f310d
https://hal.science/hal-02047318/file/arXiv_1703.10565.pdf
https://hal.science/hal-02047318/file/arXiv_1703.10565.pdf