A new approach for modeling and solving set packing problems-Reference-Cited by-同舟云学术

A new approach for modeling and solving set packing problems

Published:2008-04 Issue:2 Volume:186 Page:504-512
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Alidaee Bahram,Kochenberger Gary,Lewis Karen,Lewis Mark,Wang Haibo

Publisher

Elsevier BV

Subject

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

Reference30 articles.

1. Alidaee, B., Glover, F., Kochenberger, G., Wang, H., 2006. Solving the Maximum Edge Weight Clique Problem via Unconstrained Quadratic Programming, Working paper, University of Colorado at Denver.

2. Simulated annealing for the unconstrained quadratic pseudo-Boolean function;Alkhamis;European Journal of Operational Research,1998

3. Scatter search approach to unconstrained quadratic binary programs;Amini,1999

4. Beasley, E., 1998. Heuristic Algorithms for the Unconstrained Binary Quadratic Programming Problem, Working Paper.

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

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

1. Binary Integer Reformulations for Adiabatic Quantum Annealing Hardware;2023-10-23

2. A Hybrid Quantum-Classical Approach to the Electric Mobility Problem;2023 IEEE International Conference on Quantum Computing and Engineering (QCE);2023-09-17

3. The set partitioning problem in a quantum context;Optimization Letters;2023-06-23

4. Quantum bridge analytics I: a tutorial on formulating and using QUBO models;Annals of Operations Research;2022-04-07

5. Optimal Seating Assignment in the COVID-19 Era via Quantum Computing;Recent Advances in Computational Optimization;2022