Item Infomation
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Trung Thanh. Nguyen | - |
dc.contributor.author | Khaled Elbassioni | - |
dc.date.accessioned | 2022-01-17T02:27:18Z | - |
dc.date.available | 2022-01-17T02:27:18Z | - |
dc.date.issued | 2021 | - |
dc.identifier.uri | https://dlib.phenikaa-uni.edu.vn/handle/PNK/4009 | - |
dc.description | 49(5),633-638 | - |
dc.description.abstract | Binary non-linear programs belong to the class of which are computationally hard even to approximate. This paper aims to explore some conditions on the problem structure, under which the resulting problem can be well approximated. Particularly, we consider a setting when both objective function and constraint are low-rank functions, which depend only on a few of the input variables, and provide approximation schemes. Our result generalizes and unifies some existing results in the literature. | vi |
dc.language.iso | en | vi |
dc.publisher | Elsevier | vi |
dc.subject | Binary non-linear program | - |
dc.subject | Convex program | |
dc.title | A PTAS for a class of binary non-linear programs with low-rank functions | vi |
dc.type | Bài báo khoa học | vi |
eperson.identifier.doi | https://doi.org/10.1016/j.orl.2021.06.017 | - |
Appears in Collections | ||
Bài báo khoa học |
Files in This Item:
There are no files associated with this item.