File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/978-3-030-16194-1_8
- Scopus: eid_2-s2.0-85066824869
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Book Chapter: Online Combinatorial Optimization Problems with Non-linear Objectives
| Title | Online Combinatorial Optimization Problems with Non-linear Objectives |
|---|---|
| Authors | |
| Issue Date | 2019 |
| Publisher | Springer. |
| Citation | Online Combinatorial Optimization Problems with Non-linear Objectives. In Ding-Zhu, D, Pardalos, P.M. and Zhao, Z. (Eds.), Nonlinear Combinatorial Optimization, p. 179-205. Switzerland: Springer, 2019 How to Cite? |
| Abstract | We survey some recent progress on the design and the analysis of online algorithms for optimization problems with non-linear, usually convex, objectives. We focus on an extension of the online primal dual technique, and highlight its application in a number of applications, including an online matching problem with concave returns, an online scheduling problem with speed-scalable machines subjective to convex power functions, and a family of online covering and packing problems with convex objectives. |
| Persistent Identifier | http://hdl.handle.net/10722/273340 |
| ISBN | |
| ISSN | 2020 SCImago Journal Rankings: 0.523 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Huang, Z | - |
| dc.date.accessioned | 2019-08-06T09:27:03Z | - |
| dc.date.available | 2019-08-06T09:27:03Z | - |
| dc.date.issued | 2019 | - |
| dc.identifier.citation | Online Combinatorial Optimization Problems with Non-linear Objectives. In Ding-Zhu, D, Pardalos, P.M. and Zhao, Z. (Eds.), Nonlinear Combinatorial Optimization, p. 179-205. Switzerland: Springer, 2019 | - |
| dc.identifier.isbn | 9783030161934 | - |
| dc.identifier.issn | 1931-6828 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/273340 | - |
| dc.description.abstract | We survey some recent progress on the design and the analysis of online algorithms for optimization problems with non-linear, usually convex, objectives. We focus on an extension of the online primal dual technique, and highlight its application in a number of applications, including an online matching problem with concave returns, an online scheduling problem with speed-scalable machines subjective to convex power functions, and a family of online covering and packing problems with convex objectives. | - |
| dc.language | eng | - |
| dc.publisher | Springer. | - |
| dc.relation.ispartof | Nonlinear Combinatorial Optimization | - |
| dc.title | Online Combinatorial Optimization Problems with Non-linear Objectives | - |
| dc.type | Book_Chapter | - |
| dc.identifier.email | Huang, Z: zhiyi@cs.hku.hk | - |
| dc.identifier.authority | Huang, Z=rp01804 | - |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.doi | 10.1007/978-3-030-16194-1_8 | - |
| dc.identifier.scopus | eid_2-s2.0-85066824869 | - |
| dc.identifier.hkuros | 299980 | - |
| dc.identifier.spage | 179 | - |
| dc.identifier.epage | 205 | - |
| dc.identifier.eissn | 1931-6836 | - |
| dc.publisher.place | Switzerland | - |
| dc.identifier.issnl | 1931-6828 | - |