Pages that link to "Item:Q499331"
From MaRDI portal
The following pages link to Minimizing maximum weight of subsets of a maximum matching in a bipartite graph (Q499331):
Displaying 5 items.
- The partitioning min-max weighted matching problem (Q320079) (← links)
- Bottleneck subset-type restricted matching problems (Q2023130) (← links)
- Solving the single crane scheduling problem at rail transshipment yards (Q2422744) (← links)
- A weighted perfect matching with constraints on weights of its parts (Q5100129) (← links)
- Scheduling dedicated jobs with variative processing times (Q5963650) (← links)
