A faster strongly polynomial time algorithm for submodular function minimization

Name: A faster strongly polynomial time algorithm for submodular function minimization
Creator: James B. Orlin
Keywords: Combinatorial optimization, 4. Education, 0211 other engineering and technologies, Integer programming, submodular function minimization, strongly polynomial time algorithm, 0102 computer and information sciences, 02 engineering and technology, 7. Clean energy, 01 natural sciences

James B. Orlin

Found an issue? Give us feedback

Mathematical Program...arrow_drop_down

Mathematical Programming

Article . 2007 . Peer-reviewed

License: Springer TDM

Data sources: Crossref

zbMATH Open

Article . 2009

Data sources: zbMATH Open

https://doi.org/10.1007/978-3-...

Part of book or chapter of book . 2007 . Peer-reviewed

Data sources: Crossref

DBLP

Conference object

Data sources: DBLP

DBLP

Article

Data sources: DBLP

https://dx.doi.org/10.1007/978...

Article

Data sources: Microsoft Academic Graph

https://dx.doi.org/10.1007/s10...

Article

Data sources: Microsoft Academic Graph

A faster strongly polynomial time algorithm for submodular function minimization

descriptionPublicationkeyboard_double_arrow_right Article , Part of book or chapter of book , Conference object 25 Jun 2007 English Publisher:Springer Science and Business Media LLCJournal:Mathematical Programming, volume 118, pages 237-251 (issn: 0025-5610, eissn: 1436-4646,

Copyright policy )

Authors: James B. Orlin;

doi: 10.1007/s10107-007-0189-2 , 10.1007/978-3-540-72792-7_19

A faster strongly polynomial time algorithm for submodular function minimization

- Summary
- Subjects
- Metrics

Abstract

For the problem of minimizing a submodular function \(f(x)\) on a finite set \(V\) a strongly polynomial oracle algorithm is suggested. The algorithm uses distance functions and exploits optimality conditions.

Related Organizations

Massachusetts Institute of Technology
United States

Keywords

Combinatorial optimization, Integer programming, submodular function minimization, strongly polynomial time algorithm

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	153
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 1%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%