Online constrained optimization with recourse

DOI10.1016/J.IPL.2012.09.011MaRDI QIDQ1943619zbMATH OpenOpenAlexFDO

Authors T. Avitabile, Claire Mathieu, L. Parkinson

Publication date 20 March 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2012.09.011

zbMATH Keywords

ad-auctionsapproximation algorithmsbipartite matchingmaximum cutonline algorithms

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)

Recommendations

• Algorithms – ESA 2005
• Online primal-dual algorithms for covering and packing
• Shrinking maxima, decreasing costs: new online packing and covering problems
• Shrinking maxima, decreasing costs: new online packing and covering problems
• Approximating sparse covering integer programs online

Cited in

(18)

• Online BP functions maximization
• Exploiting problem structure in optimization under uncertainty via online convex optimization
• An online convex optimization-based framework for convex bilevel optimization
• Approximating sparse covering integer programs online
• Shrinking maxima, decreasing costs: new online packing and covering problems
• Shrinking maxima, decreasing costs: new online packing and covering problems
• Online set packing
• Online primal-dual algorithms for covering and packing
• Online maximum matching with recourse
• Constrained Online Convex Optimization With Feedback Delays
• Online Convex Optimization With Binary Constraints
• Algorithms – ESA 2005
• Introduction to Online Convex Optimization
• scientific article; zbMATH DE number 7758339 (Why is no real title available?)
• The power of amortized recourse for online graph problems
• Stable Approximation Algorithms for the Dynamic Broadcast Range-Assignment Problem
• The online piercing set problem with recourse
• Online maximum matching with recourse

This page was built for publication: Online constrained optimization with recourse

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1943619)