Minimization of an M-convex function

Akiyoshi Shioura

doi:10.1016/S0166-218X(97)00140-6

Minimization of an M-convex function

Akiyoshi Shioura

Research output: Contribution to journal › Article › peer-review

26 Citations (Scopus)

Abstract

We study the minimization of an M-convex function introduced by Murota. It is shown that any vector in the domain can be easily separated from a minimizer of the function. Based on this property, we develop a polynomial time algorithm.

Original language	English
Pages (from-to)	215-220
Number of pages	6
Journal	Discrete Applied Mathematics
Volume	84
Issue number	1-3
DOIs	https://doi.org/10.1016/S0166-218X(97)00140-6
Publication status	Published - 1998 May 15
Externally published	Yes

Keywords

Base Polyhedron
Convex function
Matroid
Minimization

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Access to Document

10.1016/S0166-218X(97)00140-6

Cite this

@article{e14d13804014495197fc49350c6f3fbd,

title = "Minimization of an M-convex function",

abstract = "We study the minimization of an M-convex function introduced by Murota. It is shown that any vector in the domain can be easily separated from a minimizer of the function. Based on this property, we develop a polynomial time algorithm.",

keywords = "Base Polyhedron, Convex function, Matroid, Minimization",

author = "Akiyoshi Shioura",

year = "1998",

month = may,

day = "15",

doi = "10.1016/S0166-218X(97)00140-6",

language = "English",

volume = "84",

pages = "215--220",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier",

number = "1-3",

}

TY - JOUR

T1 - Minimization of an M-convex function

AU - Shioura, Akiyoshi

PY - 1998/5/15

Y1 - 1998/5/15

N2 - We study the minimization of an M-convex function introduced by Murota. It is shown that any vector in the domain can be easily separated from a minimizer of the function. Based on this property, we develop a polynomial time algorithm.

AB - We study the minimization of an M-convex function introduced by Murota. It is shown that any vector in the domain can be easily separated from a minimizer of the function. Based on this property, we develop a polynomial time algorithm.

KW - Base Polyhedron

KW - Convex function

KW - Matroid

KW - Minimization

UR - http://www.scopus.com/inward/record.url?scp=0000872922&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0000872922&partnerID=8YFLogxK

U2 - 10.1016/S0166-218X(97)00140-6

DO - 10.1016/S0166-218X(97)00140-6

M3 - Article

AN - SCOPUS:0000872922

SN - 0166-218X

VL - 84

SP - 215

EP - 220

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 1-3

ER -

Minimization of an M-convex function

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this