Pages that link to "Item:Q1040971"
From MaRDI portal
The following pages link to Labeling algorithms for multiple objective integer knapsack problems (Q1040971):
Displaying 11 items.
- Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
- Multiobjective cuckoo search for design optimization (Q336332) (← links)
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (Q453890) (← links)
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206) (← links)
- What foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods? (Q993470) (← links)
- A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
- Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation (Q2184147) (← links)
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems (Q2255968) (← links)
- A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
- Multicriteria path and tree problems: discussion on exact algorithms and applications (Q4918252) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
