A SEMIDEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR QUADRATIC KNAPSACK PROBLEMS WITHIN THE SCIP OPTIMIZATION SUITE
Bachelor's
Saved in:
Main Author: | CHIA TECK YAN |
---|---|
Other Authors: | MATHEMATICS |
Published: |
2021
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/204354 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
A SEMIDEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR QUADRATIC KNAPSACK PROBLEMS WITHIN THE SCIP OPTIMIZATION SUITE
by: CHIA TECK YAN
Published: (2021) -
A SEMI-DEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR BINARY INTEGER QUADRATIC PROBLEMS USING SCIPSUITE
by: LOH CHENG WAI MATHIAS
Published: (2019) -
On semidefinite programming relaxations of the traveling salesman problem
by: De Klerk, Etienne., et al.
Published: (2009) -
Algorithms for Large Scale Nuclear Norm Minimization and Convex Quadratic Semidefinite Programming Problems
by: JIANG KAIFENG
Published: (2012) -
SCIP Flap for Tongue Reconstruction
by: Choi J.W.
Published: (2023)