On Some Probability Inequalities for Some Discrete Optimization Problems

Edward Kh. Gimadi
Additional contact information
Edward Kh. Gimadi: Sobolev Institute of Mathematics

A chapter in Operations Research Proceedings 2005, 2006, pp 283-289 from Springer

Abstract: Summary Probabilistic analysis of algorithms for discrete optimization problems is the subject of many recent investigations (Karp, Frieze, Radhavan at al). Probability inequalities of well known researchers (Chernov, Hoefding at al) are widely exploited in this works. The paper aims at demonstrating some results of probabilistic analysis of algorithms for a number of well known combinatorial problems that use another efficient (productive) probability inequalities (of Bernstein, Borovkov, Petrov, etc.). The results deal with proofs of asymptotical optimality of polynomial approximation algorithms for solving the traveling salesman problem, the bin packing problem, the multi-index assignment problem, the uncapacitated facility location problem, the problem of finding the regular connected subgraph of maximum weight

Date: 2006
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-32539-0_45

Ordering information: This item can be ordered from
http://www.springer.com/9783540325390

DOI: 10.1007/3-540-32539-5_45

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().