A new algorithm for quadratic integer programming problems with cardinality constraint

DOI10.1007/s13160-019-00403-0zbMath1442.90134OpenAlexW2997951740MaRDI QIDQ2174794

Fenlan Wang, Liyuan Cao

Publication date: 27 April 2020

Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s13160-019-00403-0

zbMATH Keywords

quadratic integer programmingcardinality constraintdomain cutoptimality gap

Mathematics Subject Classification ID

Integer programming (90C10) Nonlinear programming (90C30) Quadratic programming (90C20)

Related Items (2)

The cardinality constrained inverse center location problems on tree networks with edge length augmentation ⋮ Distributed primal outer approximation algorithm for sparse convex programming with separable structures

Cites Work

• Unnamed Item
• Unnamed Item
• Constraint qualifications and optimality conditions for optimization problems with cardinality constraints
• Algorithm for cardinality-constrained quadratic optimization
• Heuristic algorithms for the portfolio selection problem with minimum transaction lots
• Continuous-time mean-variance portfolio selection: a stochastic LQ framework
• Optimal Dynamic Portfolio Selection: Multiperiod Mean-Variance Formulation
• Optimal Cardinality Constrained Portfolio Selection
• Improving the Performance of MIQP Solvers for Quadratic Programs with Cardinality and Minimum Threshold Constraints: A Semidefinite Program Approach
• An Exact Solution Approach for Portfolio Optimization Problems Under Stochastic and Integer Constraints
• Convergent Lagrangian and Contour Cut Method for Nonlinear Integer Programming with a Quadratic Objective Function
• Lagrangian relaxation procedure for cardinality-constrained portfolio optimization
• Investment-Consumption Models with Transaction Fees and Markov-Chain Parameters
• Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints
• A new exact algorithm for concave knapsack problems with integer variables
• OPTIMAL LOT SOLUTION TO CARDINALITY CONSTRAINED MEAN–VARIANCE FORMULATION FOR PORTFOLIO SELECTION

This page was built for publication: A new algorithm for quadratic integer programming problems with cardinality constraint