Linear programming for the 0–1 quadratic knapsack problem-Reference-Cited by-同舟云学术

Linear programming for the 0–1 quadratic knapsack problem

Published:1996-07 Issue:2 Volume:92 Page:310-325
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Billionnet Alain,Calmels Frédéric

Publisher

Elsevier BV

Subject

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

Reference20 articles.

1. A tight linearization and an algorithm for zero-one quadratic programming problems;Adams;Management Science,1986

2. Experiments in quadratic 0–1 programming;Barahona;Mathematical Programming,1989

3. Minimization of a quadratic pseudo-Boolean function;Billionnet;European Journal of Operational Research,1994

4. Les problèmes de placement dans les systèmes distribués;Billionnet;Technique et Sciences Informatiques,1989

5. The indefinite zero-one quadratic problem;Carter;Discrete Applied Mathematics,1984

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

1. A novel dynamic programming heuristic for the quadratic knapsack problem;European Journal of Operational Research;2024-11

2. Toward Practical Benchmarks of Ising Machines: A Case Study on the Quadratic Knapsack Problem;IEEE Access;2024

3. A lifted-space dynamic programming algorithm for the Quadratic Knapsack Problem;Discrete Applied Mathematics;2023-08

4. Inductive linearization for binary quadratic programs with linear constraints: a computational study;4OR;2023-03-23

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