Stochastic packing integer programs with few queries

zbMATH Open1410.90140MaRDI QIDQ4607899FDOQ4607899

Authors: Takanori Maehara, Yutaro Yamaguchi 

Publication date: 15 March 2018

Full work available at URL: http://dl.acm.org/citation.cfm?id=3175288

Recommendations

• Stochastic packing integer programs with few queries
• Adaptivity and approximation for stochastic packing problems
• The benefit of adaptivity in stochastic packing problems with probing
• A stochastic probing problem with applications
• Submodular stochastic probing on matroids

Mathematics Subject Classification ID

Stochastic programming (90C15) Integer programming (90C10)

Cited In (6)

• Query-Competitive Sorting with Uncertainty.
• An adversarial model for scheduling with testing
• Stochastic minimum vertex cover in general graphs: a \(3/2\)-approximation
• Stochastic packing integer programs with few queries
• Adaptivity and approximation for stochastic packing problems
• Output sensitive fault tolerant maximum matching

This page was built for publication: Stochastic packing integer programs with few queries

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