Pages that link to "Item:Q2371351"
From MaRDI portal
The following pages link to A pegging approach to the precedence-constrained knapsack problem (Q2371351):
Displaying 15 items.
- Clique-based facets for the precedence constrained knapsack problem (Q431007) (← links)
- The precedence constrained knapsack problem: separating maximally violated inequalities (Q494425) (← links)
- A reduction approach to the repeated assignment problem (Q531433) (← links)
- The linking set problem: a polynomial special case of the multiple-choice knapsack problem (Q844527) (← links)
- Polyhedral results for the precedence-constrained knapsack problem (Q1208480) (← links)
- Heuristic and exact algorithms for the precedence-constrained knapsack problem (Q1586807) (← links)
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021) (← links)
- A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty (Q1926975) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Lagrangian relaxation and pegging test for the clique partitioning problem (Q2256778) (← links)
- On the complexity of project scheduling to minimize exposed time (Q2514874) (← links)
- Large-scale multi-period precedence constrained knapsack problem: a mining application (Q2883587) (← links)
- A virtual pegging approach to the max–min optimization of the bi-criteria knapsack problem (Q3630434) (← links)
- AN IMPROVED REDUCTION METHOD FOR THE ROBUST OPTIMIZATION OF THE ASSIGNMENT PROBLEM (Q4649882) (← links)
- A constraint programming approach for the premarshalling problem (Q6106491) (← links)
