Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Theory of Principal Partitions Revisited - MaRDI portal

Theory of Principal Partitions Revisited (Q2971607)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Theory of Principal Partitions Revisited	scientific article

Statements

scholarly article

0 references

Theory of Principal Partitions Revisited (English)

0 references

Satoru Fujishige

0 references

Research Trends in Combinatorial Optimization

0 references

publication date

7 April 2017

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-540-76796-1_7

0 references

Cores of convex games

0 references

Separation of partition inequalities with terminals

0 references

Principal structures of submodular systems

0 references

Equitable cost allocations via primal-dual-type algorithms

0 references

The maximum-rank minimum-term-rank theorem for the pivotal transforms of a matrix

0 references

Ordered optimal solutions and parametric minimum cut problems

0 references

Geometric algorithms and combinatorial optimization

0 references

Submodular functions and optimization.

0 references

Matroid Intersection

0 references

The principal minors of a matroid

0 references

Structural theorems for submodular functions, polymatroids and polymatroid intersections

0 references

Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector

0 references

0 references

Optimal flows in networks with multiple sources and sinks

0 references

Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations

0 references

Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections

0 references

Substitutes, Complements and Ripples in Network Flows

0 references

Discrete Convex Analysis

0 references

Finding the nearest point in A polytope

0 references

0 references

A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization

0 references

On Convex Minimization over Base Polytopes

0 references

On the structure of all minimum cuts in a network and applications

0 references

A THEOREM ON INDEPENDENCE RELATIONS

0 references

On Steepest Descent Algorithms for Discrete Convex Functions

0 references

Principal structure of submodular systems and Hitchcock-type independent flows

0 references

Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations

0 references

A Fast Parametric Maximum Flow Algorithm and Applications

0 references

Monotone-path Dutta-Ray solutions on convex games

0 references

The egalitarian solution and reduced game properties in convex games

0 references

Matrices and matroids for systems analysis

0 references

A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences

0 references

M-Convex Function on Generalized Polymatroid

0 references

Separation of Partition Inequalities

0 references

0 references

Minimizing a Submodular Function on a Lattice

0 references

Principal structure of layered mixed matrices

0 references

NOTE ON THE UNIVERSAL BASES OF A PAIR OF POLYMATROIDS

0 references

Population monotonicity and consistency in convex games: Some logical relations

0 references

Optimal attack and reinforcement of a network

0 references

A Faster Scaling Algorithm for Minimizing Submodular Functions

0 references

A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis

0 references

The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality

0 references

On the Problem of Decomposing a Graph into <i>n</i> Connected Factors

0 references

Edge-Disjoint Spanning Trees of Finite Graphs

0 references

Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control

0 references

A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions

0 references

Submodular functions and electrical networks

0 references

Two algorithms for maximizing a separable concave function over a polymatroid feasible region

0 references

Combinatorial auctions with decreasing marginal utilities

0 references

A Concept of Egalitarianism Under Participation Constraints

0 references

Structure of a simple scheduling polyhedron

0 references

A theorem on the principal structure for independent matchings

0 references

Monotone Comparative Statics

0 references

Lehmans switching game and a theorem of Tutte and Nash-Williams

0 references

Minimum partition of a matroid into independent subsets

0 references

Transversals and matroid partition

0 references

About strongly polynomial time algorithms for quadratic optimization over submodular constraints

0 references

A combinatorial algorithm minimizing submodular functions in strongly polynomial time.

0 references

Discrete convex analysis

0 references

A good algorithm for lexicographically optimal flows in multi-terminal networks

0 references

A fully combinatorial algorithm for submodular function minimization.

0 references

Notes on L-/M-convex functions and the separation theorems

0 references

Submodular function minimization

0 references

The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function.

0 references

A push-relabel framework for submodular function minimization and applications to parametric optimization

0 references

Improving graph partitions using submodular functions.

0 references

0 references

0 references

0 references

Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints

0 references

A Structure Theory for the Parametric Submodular Intersection Problem

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-540-76796-1_7

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2971607

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2971607&oldid=36314823"