Pages that link to "Item:Q2892372"
From MaRDI portal
The following pages link to Dynamic Programming to Minimize the Maximum Number of Open Stacks (Q2892372):
Displaying 8 items.
- Minimizing sequence-dependent setup costs in feeding batch processes under due date restrictions (Q398878) (← links)
- Exploiting subproblem dominance in constraint programming (Q453591) (← links)
- Lock-free parallel dynamic programming (Q666192) (← links)
- The minimization of open stacks problem: a review of some properties and their use in pre-processing operations (Q1046052) (← links)
- Optimal patchings for consecutive ones matrices (Q2125569) (← links)
- A method for detecting symmetries in constraint models and its generalisation (Q2342650) (← links)
- A biased random-key genetic algorithm for the minimization of open stacks problem (Q2803254) (← links)
- Mathematical models for the minimization of open stacks problem (Q6082193) (← links)
