Pages that link to "Item:Q2708224"
From MaRDI portal
The following pages link to Balancing and optimizing a portfolio of R&D projects (Q2708224):
Displayed 20 items.
- Robust efficiency measures for linear knapsack problem variants (Q323349) (← links)
- Optimal selection of energy efficiency measures for energy sustainability of existing buildings (Q342204) (← links)
- Scenario-based portfolio selection of investment projects with incomplete probability and utility information (Q439347) (← links)
- A new effective dynamic program for an investment optimization problem (Q505320) (← links)
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- A new multi-objective algorithm for a project selection problem (Q948801) (← links)
- Alternating control tree search for knapsack/covering problems (Q972644) (← links)
- Optimization of R\&D project portfolios under endogenous uncertainty (Q992625) (← links)
- The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
- An application of the multiple knapsack problem: the self-sufficient marine (Q1752270) (← links)
- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem (Q1755228) (← links)
- Evaluating projects based on intuitionistic fuzzy group decision making (Q1760853) (← links)
- Particle swarm optimization with time-varying acceleration coefficients for the multidimensional knapsack problem (Q1994450) (← links)
- Public R\&D project portfolio selection problem with cancellations (Q2014587) (← links)
- Mature or emerging markets: competitive duopoly investment decisions (Q2355111) (← links)
- Constructing and evaluating balanced portfolios of R\&D projects with interactions: a DEA based methodology (Q2488923) (← links)
- Adaptive memory search for multidemand multidimensional knapsack problems (Q2489302) (← links)
- Modeling multiple plant sourcing decisions (Q3532786) (← links)
- Holistic fleet optimization incorporating system design considerations (Q6057031) (← links)
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners (Q6094505) (← links)
