16 citations · 34 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2021★ 4 cited
A pessimist's approach to one-sided matching
Tom Demeulemeester, Dries Goossens, Ben Hermans +1
Inspired by real-world applications such as the assignment of pupils to schools or the allocation of social housing, the one-sided matching problem studies how a set of agents can…
cs.DS2013
A Combination of Flow Shop Scheduling and the Shortest Path Problem
Kameng Nip, Zhenbo Wang, Fabrice Talla Nobibon +1
This paper studies a combinatorial optimization problem which is obtained by combining the flow shop scheduling problem and the shortest path problem. The objective of the obtained…