Pages that link to "Item:Q991365"
From MaRDI portal
The following pages link to A general branch-and-bound algorithm for fair division problems (Q991365):
Displaying 10 items.
- Algorithms and implementation of a set partitioning approach for modular machining line design (Q339661) (← links)
- Fair division of indivisible items between two players: design parameters for contested pile methods (Q483924) (← links)
- A modified greedy analysis pursuit algorithm for the cosparse analysis model (Q513670) (← links)
- A combinatorial algorithm to establish a fair border (Q915733) (← links)
- From the bankruptcy problem and its concede-and-divide solution to the assignment problem and its fair division solution (Q1651272) (← links)
- Fair allocation of indivisible goods with minimum inequality or minimum envy (Q2242281) (← links)
- Optimization problems in fair division theory. (Q2702490) (← links)
- (Q4666929) (← links)
- Integral Column Generation for Set Partitioning Problems with Side Constraints (Q5106424) (← links)
- (Q5155992) (← links)
