Quasi M-convex and L-convex functions - Quasiconvexity in discrete optimization

Kazuo Murota, Akiyoshi Shioura

Research output: Contribution to journalConference articlepeer-review

12 Citations (Scopus)

Abstract

Two classes of discrete quasiconvex functions, called quasi M- and L-convex functions were introduced. The structure of quasi M- and L-convex functions with respect to level sets was investigated. It was shown that various greedy algorithms work for the minimization of quasi M- and L-convex functions.

Original languageEnglish
Pages (from-to)467-494
Number of pages28
JournalDiscrete Applied Mathematics
Volume131
Issue number2
DOIs
Publication statusPublished - 2003 Sep 12
EventSubmodularity - Atlanta, GA, United States
Duration: 2000 Aug 12000 Aug 1

Keywords

  • Base polyhedron
  • Discrete optimization
  • Matroid
  • Quasiconvex function

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Quasi M-convex and L-convex functions - Quasiconvexity in discrete optimization'. Together they form a unique fingerprint.

Cite this