Pages that link to "Item:Q947962"
From MaRDI portal
The following pages link to Solving efficiently the 0-1 multi-objective knapsack problem (Q947962):
Displayed 13 items.
- A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives (Q429651) (← links)
- Computational performance of basic state reduction based dynamic programming algorithms for bi-objective 0-1 knapsack problems (Q453890) (← links)
- Dynamic programming with ordered structures: Theory, examples and applications (Q622035) (← links)
- Connectedness of efficient solutions in multiple objective combinatorial optimization (Q650207) (← links)
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206) (← links)
- The small world of efficient solutions: empirical evidence from the bi-objective \(\{0,1\}\)-knapsack problem (Q989830) (← links)
- What foreclosed homes should a municipality purchase to stabilize vulnerable neighborhoods? (Q993470) (← links)
- On embedding subclasses of height-balanced trees in hypercubes (Q1006750) (← links)
- Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (Q1027579) (← links)
- Labeling algorithms for multiple objective integer knapsack problems (Q1040971) (← links)
- Solving multiobjective, multiconstraint knapsack problems using mathematical programming and evolutionary algorithms (Q1043327) (← links)
- Greedy algorithms for a class of knapsack problems with binary weights (Q1761999) (← links)
- AN OPTIMIZATION MODEL FOR REUSE SCENARIO SELECTION CONSIDERING RELIABILITY AND COST IN SOFTWARE PRODUCT LINE DEVELOPMENT (Q2892539) (← links)
