Pages that link to "Item:Q2770124"
From MaRDI portal
The following pages link to Core Problems in Knapsack Algorithms (Q2770124):
Displayed 27 items.
- Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
- The constrained compartmentalized knapsack problem: mathematical models and solution methods (Q421557) (← links)
- Kernel search: a new heuristic framework for portfolio selection (Q434181) (← links)
- An improved version of a core based algorithm for the multi-objective multi-dimensional knapsack problem: a computational study and comparison with meta-heuristics (Q670759) (← links)
- Hard multidimensional multiple choice knapsack problems, an empirical study (Q733540) (← links)
- Model and algorithms for multi-period sea cargo mix problem (Q872163) (← links)
- Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem (Q955337) (← links)
- Black box scatter search for general classes of binary optimization problems (Q976017) (← links)
- Kernel search: a general heuristic for the multi-dimensional knapsack problem (Q976023) (← links)
- Sensitivity of the optimum to perturbations of the profit or weight of an item in the binary Knapsack problem (Q995928) (← links)
- On dominated terms in the general knapsack problem (Q1371953) (← links)
- Robust combinatorial optimization under budgeted-ellipsoidal uncertainty (Q1731817) (← links)
- Tolerance analysis for 0-1 knapsack problems (Q1751719) (← links)
- Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939) (← links)
- Where are the hard knapsack problems? (Q1772862) (← links)
- A kernel search to the multi-plant capacitated lot sizing problem with setup carry-over (Q1782152) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- Sensitivity analysis to perturbations of the weight of a subset of items: the knapsack case study (Q1799388) (← links)
- Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
- Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915) (← links)
- A Stackelberg knapsack game with weight control (Q2333816) (← links)
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems (Q2468486) (← links)
- The replenishment problem with multiple articles and an order threshold (Q2669586) (← links)
- CORAL: An Exact Algorithm for the Multidimensional Knapsack Problem (Q2815454) (← links)
- Sensitivity Analysis to Perturbations of the Weight of a Subset of Items: The Single Knapsack Case Study (Q2883592) (← links)
- Techniques for solving subset sum problems within a given tolerance (Q3410169) (← links)
- Balanced-evolution genetic algorithm for combinatorial optimization problems: the general outline and implementation of balanced-evolution strategy based on linear diversity index (Q6084237) (← links)