A SEMI-DEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR BINARY INTEGER QUADRATIC PROBLEMS USING SCIPSUITE
Master's
Saved in:
Main Author: | LOH CHENG WAI MATHIAS |
---|---|
Other Authors: | MATHEMATICS |
Format: | Theses and Dissertations |
Language: | English |
Published: |
2019
|
Subjects: | |
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/153737 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Language: | English |
Similar Items
-
Branch and bound on the network model
by: Jain, S.
Published: (2013) -
SUBSET SELECTION USING BRANCH AND BOUND FORREGRESSION
by: SANDEEP SETHURAMAN
Published: (2019) -
Branch-and-bound algorithms for simple assembly line balancing problem
by: Liu, S.B., et al.
Published: (2014) -
A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
by: Lijun Wei, et al.
Published: (2020) -
Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
by: Peng, J., et al.
Published: (2016)