Stochastic Packing Integer Programs with Few Queries release_5yiveileeje2fkdguhv2wnytke

by Takanori Maehara, Yutaro Yamaguchi

Released as a article .

2017  

Abstract

We consider a stochastic variant of the packing-type integer linear programming problem, which contains random variables in the objective vector. We are allowed to reveal each entry of the objective vector by conducting a query, and the task is to find a good solution by conducting a small number of queries. We propose a general framework of adaptive and non-adaptive algorithms for this problem, and provide a unified methodology for analyzing the performance of those algorithms. We also demonstrate our framework by applying it to a variety of stochastic combinatorial optimization problems such as matching, matroid, and stable set problems.
In text/plain format

Archived Files and Locations

application/pdf  317.2 kB
file_2cgmytolengdbhctzjtofjq3wa
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2017-07-13
Version   v1
Language   en ?
arXiv  1707.04020v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: e508a953-d3cf-43cc-a3b0-0e0498ee23c7
API URL: JSON