Pages that link to "Item:Q5138780"

The following pages link to A Quasi-Polynomial Approximation for the Restricted Assignment Problem (Q5138780):

Displaying 2 items.

• Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings (Q6634523) (← links)
• Time-sharing scheduling with tolerance capacities (Q6655677) (← links)