The following pages link to OpenSolver (Q23268):
Displaying 4 items.
- Approximation algorithms for \(k\)-echelon extensions of the one warehouse multi-retailer problem (Q1631181) (← links)
- Linear integer model for the course timetabling problem of a faculty in Rio de Janeiro (Q1748501) (← links)
- Emergency relocation of items using single trips: special cases of the multiple knapsack assignment problem (Q1751729) (← links)
- An optimization model for the student-to-project supervisor assignment problem-the case of an engineering department (Q2688892) (← links)
