Pages that link to "Item:Q1761999"
From MaRDI portal
The following pages link to Greedy algorithms for a class of knapsack problems with binary weights (Q1761999):
Displaying 10 items.
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- On a biobjective search problem in a line: formulations and algorithms (Q393048) (← links)
- Generalized multiple objective bottleneck problems (Q453049) (← links)
- Greedy algorithms for the minimization knapsack problem: average behavior (Q733910) (← links)
- Symmetry properties of resolving sets and metric bases in hypercubes (Q1677292) (← links)
- Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937) (← links)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- On a particular case of the multi-criteria unconstrained optimization problem (Q2883560) (← links)
- (Q3792480) (← links)