Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering-Reference-Cited by-同舟云学术

Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering

Published:2022-01-21 Issue:1 Volume:44 Page:498-517
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Forrester Richard J.^ORCID,Waddell Lucas A.

Funder

Office of Naval Research

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

https://link.springer.com/content/pdf/10.1007/s10878-021-00840-z.pdf

Reference19 articles.

1. Adams W, Forrester R (2005) A simple recipe for concise mixed 0–1 linearizations. Oper Res Lett 33(1):55–61

2. Adams WP, Guignard M, Hahn PM, Hightower WL (2007) A level-2 reformulation-linearization technique bound for the quadratic assignment problem. Eur J Oper Res 180(3):983–996

3. Billionnet A, Calmels F (1996) Linear programming for the 0–1 quadratic knapsack problem. Eur J Oper Res 92(2):310–325

4. Billionnet A, Soutif E (2004) Using a mixed integer programming tool for solving the 0–1 quadratic knapsack problem. INFORMS J Comput 16(2):188–197

5. Caprara A, Pisinger D, Toth P (1999) Exact solution of the quadratic Knapsack problem. INFORMS J Comput 11(2):125–137

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

1. Cost-Damage Analysis of Attack Trees;2023 53rd Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN);2023-06

2. Linearization Strategies for Binary Quadratic and Higher-Order Polynomial Programs;Encyclopedia of Optimization;2022-09-21