A polyhedral approach to bisubmodular function minimization

Qimeng Yu, Simge Küçükyavuz*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We consider minimization problems with bisubmodular objective functions. We propose valid inequalities, namely the poly-bimatroid inequalities, and provide a complete linear description of the convex hull of the epigraph of a bisubmodular function. Furthermore, we develop a cutting plane algorithm for constrained bisubmodular minimization based on the poly-bimatroid inequalities. Our computational experiments on the minimization subproblem in robust coupled sensor placement show that our algorithm can solve highly non-linear problems that do not admit compact mixed-integer linear formulations.

Original languageEnglish (US)
Pages (from-to)5-10
Number of pages6
JournalOperations Research Letters
Volume49
Issue number1
DOIs
StatePublished - Jan 2021

Keywords

  • Bisubmodular minimization
  • Bisubmodular polyhedra
  • Convex hull
  • Coupled sensor placement
  • Cutting planes

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'A polyhedral approach to bisubmodular function minimization'. Together they form a unique fingerprint.

Cite this