A new upper bound for the 0-1 quadratic knapsack problem-Reference-Cited by-同舟云学术

A new upper bound for the 0-1 quadratic knapsack problem

Published:1999-02 Issue:3 Volume:112 Page:664-672
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Billionnet Alain,Faye Alain,Soutif Éric

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference19 articles.

1. Linear programming for the 0-1 quadratic knapsack problem;Billionnet;European Journal of Operational Research,1996

2. Best network flow bound for the quadratic knapsack problem;Chaillou;Lecture Notes in Mathematics,1986

3. A decomposition method for quadratic zero-one programming;Chardaire;Management Science,1995

4. Clustering and domination in perfect graphs;Corneil;Discrete Applied Mathematics,1984

5. De Farias Jr., I.R., Maculan, N., Michelon, P., 1993. Branch and Bound Schemes using Lagrangean Decomposition Techniques for 0-1 Quadratic Knapsack Problems, Logique et Analyse, to appear

Cited by 37 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The polynomial robust knapsack problem;European Journal of Operational Research;2023-03

2. QKPICA: A Socio-Inspired Algorithm for Solution of Large-Scale Quadratic Knapsack Problems;Lecture Notes in Electrical Engineering;2023

3. Solving the Quadratic Knapsack Problem Using GRASP;Metaheuristics for Machine Learning;2022-08-13

4. Knapsack problems — An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems;Computers & Operations Research;2022-07

5. On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem;Mathematical Methods of Operations Research;2020-02-12