Three-dimensional matching instances are rich in stable matchings
From MaRDI portal
Publication:1626726
DOI10.1007/978-3-319-93031-2_13OpenAlexW2806673880MaRDI QIDQ1626726
Barry O'Sullivan, Guillaume Escamocher
Publication date: 21 November 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-93031-2_13
Related Items
Deep policy dynamic programming for vehicle routing problems ⋮ On random stable matchings: cyclic ones with strict preferences and two-sided ones with partially ordered preferences ⋮ Unnamed Item ⋮ On the existence of three-dimensional stable matchings with cyclic preferences ⋮ A collection of constraint programming models for the three-dimensional stable matching problem with cyclic preferences ⋮ Heavy-tails and randomized restarting beam search in goal-oriented neural sequence decoding ⋮ SeaPearl: a constraint programming solver guided by reinforcement learning ⋮ Improving branch-and-bound using decision diagrams and reinforcement learning
