Pages that link to "Item:Q1883748"
From MaRDI portal
The following pages link to Partitioning a finite set by a dynamic programming method (Q1883748):
Displaying 8 items.
- An approach to solution of the movements routing problem with several participants (Q357112) (← links)
- Distribution of assignments among participants under conditions of constraints (Q664296) (← links)
- Improving dynamic programming strategies for partitioning (Q818974) (← links)
- Job distribution algorithms (Q885731) (← links)
- A dynamic programming approach to the complete set partitioning problem (Q1091142) (← links)
- An algorithm for partitioning a set into simple parts (Q2498282) (← links)
- (Q2723960) (← links)
- (Q3054537) (← links)