Pages that link to "Item:Q3823367"

The following pages link to Generating the Discrete Efficient Frontier to the Capital Budgeting Problem (Q3823367):

Displaying 15 items.

• Dynamic programming algorithms for the bi-objective integer knapsack problem (Q299843) (← links)
• Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
• Quadratic model for allocating operational budget in public and nonprofit organizations (Q478057) (← links)
• A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206) (← links)
• Approximative solution methods for multiobjective combinatorial optimization. With discussion and a rejoinder by the authors. (Q703286) (← links)
• Integrating partial optimization with scatter search for solving bi-criteria \({0, 1}\)-knapsack problems (Q857299) (← links)
• Solving efficiently the 0-1 multi-objective knapsack problem (Q947962) (← links)
• A single facility location problem with a weighted maximin-minimax rectilinear distance (Q1085041) (← links)
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm. (Q1413848) (← links)
• A quantum-inspired artificial immune system for the multiobjective 0-1 knapsack problem (Q1644042) (← links)
• Investment decisions and sensitivity analysis: NPV-consistency of rates of return (Q1754333) (← links)
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem (Q2356097) (← links)
• Inverse multi-objective combinatorial optimization (Q2444572) (← links)
• A survey of recent developments in multiobjective optimization (Q2468335) (← links)
• (Q4945108) (← links)