scientific article; zbMATH DE number 6850470

zbMath1403.90588arXiv1711.00405MaRDI QIDQ4608056

Sahil Singla

Publication date: 15 March 2018

Full work available at URL: https://arxiv.org/abs/1711.00405

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Economics of information (91B44)

Related Items

Scheduling with testing on multiple identical parallel machines ⋮ Online makespan minimization with budgeted uncertainty ⋮ Unnamed Item ⋮ Stochastic graph exploration with limited resources ⋮ Stochastic Probing with Increasing Precision ⋮ Unnamed Item ⋮ An adversarial model for scheduling with testing ⋮ Query minimization under stochastic uncertainty ⋮ Algorithms for the unit-cost stochastic score classification problem ⋮ Online Allocation and Pricing: Constant Regret via Bellman Inequalities ⋮ Explorable uncertainty in scheduling with non-uniform testing times