An alternative efficient representation for the project portfolio selection problem
DOI10.1016/j.ejor.2019.08.022zbMath1430.90336OpenAlexW2968390702WikidataQ127361376 ScholiaQ127361376MaRDI QIDQ2329483
Youzhong Zhang, Xingmei Li, Shu-Cherng Fang, Yao-Huei Huang
Publication date: 17 October 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2019.08.022
linearization techniquealternative solutionproject portfolio selection problemmixed integer polynomial program
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Management decision making, including multiple objectives (90B50)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Optimal selection of project portfolios using reinvestment strategy within a flexible time horizon
- R\&D pipeline management: task interdependencies and risk management
- A fuzzy approach to R{\&}D project portfolio selection
- Robust portfolio modeling with incomplete cost information and project interdependencies
- Competence-driven project portfolio selection, scheduling and staff assignment
- A decision model for interdependent information system project selection
- A linearization method for mixed 0--1 polynomial programs
- A tabu search procedure for the resource-constrained project scheduling problem with alternative subgraphs
- On recoverable and two-stage robust selection problems with budgeted uncertainty
- Modeling project preferences in multiattribute portfolio decision analysis
- Genetic algorithm-based multi-criteria project portfolio selection
- Predicting information technology project escalation: A neural network approach
- A simple recipe for concise mixed 0-1 linearizations
- Skill-based framework for optimal software project selection and resource allocation
- Finding multiple solutions to general integer linear programs
- Fuzzy R\&D portfolio selection of interdependent projects
- Discrete Dynamic Programming and Capital Allocation
- A zero-one model for project portfolio selection and scheduling
- Note—An Improved Discrete Dynamic Programming Algorithm for Allocating Resources Among Interdependent Projects
- Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program
- Canonical Cuts on the Unit Hypercube
- Linear Reformulation of Polynomial Discrete Programming for Fast Computation
This page was built for publication: An alternative efficient representation for the project portfolio selection problem