Online Combinatorial Optimization Problems with Non-linear Objectives

Zhiyi Huang ()
Additional contact information
Zhiyi Huang: The University of Hong Kong

A chapter in Nonlinear Combinatorial Optimization, 2019, pp 179-205 from Springer

Abstract: 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.

Date: 2019
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-030-16194-1_8

Ordering information: This item can be ordered from
http://www.springer.com/9783030161941

DOI: 10.1007/978-3-030-16194-1_8

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().