Proximity theorems of discrete convex functions

Kazuo Murota, Akihisa Tamura

研究成果: Article

7 引用 (Scopus)

抜粋

A proximity theorem is a statement that, given an optimization problem and its relaxation, an optimal solution to the original problem exists in a certain neighborhood of a solution to the relaxation. Proximity theorems have been used successfully, for example, in designing efficient algorithms for discrete resource allocation problems. After reviewing the recent results for L-convex and M-convex functions, this paper establishes proximity theorems for larger classes of discrete convex functions, L2-convex functions and M 2-convex functions, that are relevant to the polymatroid intersection problem and the submodular flow problem.

元の言語English
ページ(範囲)539-562
ページ数24
ジャーナルMathematical Programming
99
発行部数3
DOI
出版物ステータスPublished - 2004 4
外部発表Yes

    フィンガープリント

ASJC Scopus subject areas

  • Applied Mathematics
  • Mathematics(all)
  • Safety, Risk, Reliability and Quality
  • Management Science and Operations Research
  • Software
  • Computer Graphics and Computer-Aided Design
  • Computer Science(all)

これを引用