Pages that link to "Item:Q5928374"
From MaRDI portal
The following pages link to Budgeting with bounded multiple-choice constraints. (Q5928374):
Displaying 13 items.
- A ``reduce and solve'' approach for the multiple-choice multidimensional knapsack problem (Q297243) (← links)
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
- A new multi-objective algorithm for a project selection problem (Q948801) (← links)
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
- An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition (Q1038300) (← links)
- Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound (Q1665694) (← links)
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem (Q1753394) (← links)
- Iterative semi-continuous relaxation heuristics for the multiple-choice multidimensional knapsack problem (Q1761941) (← links)
- Budget management with applications (Q1849379) (← links)
- A dynamic model of soft budget-constraint (Q1929415) (← links)
- SAT encodings for pseudo-Boolean constraints together with at-most-one constraints (Q2060735) (← links)
- Selection among ranked projects under segmentation, policy and logical constraints (Q2426570) (← links)
- Project prioritization under policy restrictions. A combination of MCDA with 0-1 programming (Q2576271) (← links)