Pages that link to "Item:Q1248462"
From MaRDI portal
The following pages link to The 0-1 knapsack problem with multiple choice constraints (Q1248462):
Displayed 19 items.
- A multi-criteria approach to approximate solution of multiple-choice knapsack problem (Q721960) (← links)
- A branch and bound algorithm for solving the multiple-choice knapsack problem (Q760766) (← links)
- Model and algorithms for multi-period sea cargo mix problem (Q872163) (← links)
- Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
- On maintenance scheduling of production units (Q1159562) (← links)
- A minimal algorithm for the multiple-choice knapsack problem (Q1388832) (← links)
- Reliability optimization of a series system with multiple-choice and budget constraints (Q1590812) (← links)
- Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method (Q1761134) (← links)
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem (Q1894383) (← links)
- The multiple multidimensional knapsack with family-split penalties (Q2029273) (← links)
- Three-stage approaches for optimizing some variations of the resource constrained shortest-path sub-problem in a column generation context (Q2371346) (← links)
- A versatile algorithm for assembly line balancing (Q2383104) (← links)
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem (Q2467571) (← links)
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls (Q2496024) (← links)
- Optimal selection of touristic packages based on user preferences during sports mega-events (Q2672108) (← links)
- A o(n logn) algorithm for LP knapsacks with GUB constraints (Q3854926) (← links)
- A mathematical programming system for preference and compatibility maximized menu planning and scheduling (Q4166537) (← links)
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
- A decomposition approach for multidimensional knapsacks with family‐split penalties (Q6195028) (← links)