Solving the 0-1 quadratic knapsack problem with a competitive quantum inspired evolutionary algorithm
From MaRDI portal
Publication:2345653
DOI10.1016/j.cam.2015.02.016zbMath1323.90058MaRDI QIDQ2345653
Sulabh Bansal, C. Patvardhan, Anand Srivastav
Publication date: 22 May 2015
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cam.2015.02.016
90C27: Combinatorial optimization
Related Items
Uses Software
Cites Work
- Quantum-inspired evolutionary algorithms: a survey and empirical study
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- The quadratic knapsack problem -- a survey
- An extended formulation approach to the edge-weighted maximal clique problem
- A cutting-plane approach to the edge-weighted maximal clique problem
- Min-cut clustering
- Formulations and valid inequalities of the node capacitated graph partitioning problem
- Quadratic knapsack problems
- Efficient Methods For Solving Quadratic 0–1 Knapsack Problems
- Exact Solution of the Quadratic Knapsack Problem
- Quadratic Binary Programming with Application to Capital-Budgeting Problems
- A Selection Problem of Shared Fixed Costs and Network Flows