Pages that link to "Item:Q4166537"
From MaRDI portal
The following pages link to A mathematical programming system for preference and compatibility maximized menu planning and scheduling (Q4166537):
Displaying 6 items.
- A branch and bound algorithm for solving the multiple-choice knapsack problem (Q760766) (← links)
- A heuristic for multiple choice programming (Q1089261) (← links)
- The history of the application of mathematical programming to menu planning (Q1197668) (← links)
- Shrimp feed formulation via evolutionary algorithm with power heuristics for handling constraints (Q1694234) (← links)
- Multi-constrained matroidal knapsack problems (Q1824560) (← links)
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383) (← links)