Polyhedrally tight set functions and discrete convexity View on Open Library

Polyhedrally tight set functions and discrete convexity

by Satoru Fujishige

No reviews yet
First published: 2005 1 language

Reviews

Log in or sign up to write a review.

No reviews yet. Be the first!

More by Satoru Fujishige

Submodular functions and optimization

Submodular functions and optimization

Dual greedy polyhedra, choice functions, and abstract convex geometries

Dual greedy polyhedra, choice functions,...

The minimum-norm-point algorithm applied to submodular function minimization and linear programming

The minimum-norm-point algorithm applied...

A note on disjoint arborescences

A note on disjoint arborescences

A two-sided discrete-concava market with bounded side payments : an approach by discrete convex analysis

A two-sided discrete-concava market with...

Matroids on convex geometries (cg-matroids)

Matroids on convex geometries (cg-matroi...