On the complexity of stable hypergraph matching, stable multicommodity flow and related problems

Csáji, Gergely

doi:10.1016/j.tcs.2022.07.025

Search citation statements

Order By: Relevance

Paper Sections

Select...

Matching Under Preferences1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The computational complexity of computing stable solutions was studied by Fleiner et al (2023). Stable flows were also studied by using the stable fractional solutions by the Scarf-algorithm by Csáji (2022). Finally, Cseh et al (2022) analysed the special case of three dimensional stable matchings with cyclic preferences using constraints programming.…”

Section: Matching Under Preferencesmentioning

confidence: 99%

Optimization methods and algorithms

Biró,

Bozóki,

Király

et al. 2024

Cent Eur J Oper Res

View full text Add to dashboard Cite

Recent results of three areas, pickup and delivery, optimal mass transportation, matching under preferences are highlighted. The topics themselves have been selected from the active research fields of Hungarian Operations Research. We also provide a short summary of selected research results from the 34th Hungarian Operations Research Conference, held in Cegléd, Hungary, August 31–September 2, 2021.

show abstract

Section: Matching Under Preferencesmentioning

confidence: 99%