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

online algorithmsapproximation algorithmsmaximum cutbipartite matchingad-auctions

Mathematics Subject Classification ID

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

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

(17)

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

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)