Pages that link to "Item:Q2356097"
From MaRDI portal
The following pages link to A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097):
Displaying 7 items.
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- An enhanced branch-and-bound algorithm for the talent scheduling problem (Q322481) (← 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)
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
- Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem (Q2079394) (← links)
- An exact algebraic \(\epsilon \)-constraint method for bi-objective linear integer programming based on test sets (Q2282534) (← links)
- Route-reduction-based dynamic programming for large-scale satellite range scheduling problem (Q5059256) (← links)
