Theory of Principal Partitions Revisited
From MaRDI portal
Publication:2971607
DOI10.1007/978-3-540-76796-1_7zbMath1359.05019OpenAlexW147723608MaRDI QIDQ2971607
Publication date: 7 April 2017
Published in: Research Trends in Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-76796-1_7
Related Items
Fair integral submodular flows, Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested, Optimal hierarchical clustering on a graph, LP Relaxation and Tree Packing for Minimum $k$-Cut, A compact representation for modular semilattices and its applications, Signed ring families and signed posets, Decreasing minimization on M-convex sets: background and structures, Decreasing minimization on base-polyhedra: relation between discrete and continuous cases, Parametric bisubmodular function minimization and its associated signed ring family
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The egalitarian solution and reduced game properties in convex games
- Structural theorems for submodular functions, polymatroids and polymatroid intersections
- Submodular function minimization
- Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations
- Principal structures of submodular systems
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- Geometric algorithms and combinatorial optimization
- The principal minors of a matroid
- Discrete convex analysis
- Submodular functions and electrical networks
- The realization of finite state machines by decomposition and the principal lattice of partitions of a submodular function.
- A push-relabel framework for submodular function minimization and applications to parametric optimization
- Improving graph partitions using submodular functions.
- Population monotonicity and consistency in convex games: Some logical relations
- Notes on L-/M-convex functions and the separation theorems
- Structure of a simple scheduling polyhedron
- Principal structure of layered mixed matrices
- A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
- A fully combinatorial algorithm for submodular function minimization.
- A theorem on the principal structure for independent matchings
- Principal structure of submodular systems and Hitchcock-type independent flows
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Separation of partition inequalities with terminals
- Combinatorial auctions with decreasing marginal utilities
- The maximum-rank minimum-term-rank theorem for the pivotal transforms of a matrix
- Cores of convex games
- Monotone-path Dutta-Ray solutions on convex games
- Ordered optimal solutions and parametric minimum cut problems
- Submodular functions and optimization.
- M-Convex Function on Generalized Polymatroid
- Separation of Partition Inequalities
- A Structure Theory for the Parametric Submodular Intersection Problem
- A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
- Matroid Intersection
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- A Concept of Egalitarianism Under Participation Constraints
- Minimizing Continuous Extensions of Discrete Convex Functions with Linear Inequality Constraints
- Equitable cost allocations via primal-dual-type algorithms
- Substitutes, Complements and Ripples in Network Flows
- The Greedy Procedure for Resource Allocation Problems: Necessary and Sufficient Conditions for Optimality
- Combinatorial Canonical Form of Layered Mixed Matrices and Its Application to Block-Triangularization of Systems of Linear/Nonlinear Equations
- Optimal attack and reinforcement of a network
- NOTE ON THE UNIVERSAL BASES OF A PAIR OF POLYMATROIDS
- Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
- On the structure of all minimum cuts in a network and applications
- Multiclass Queueing Systems: Polymatroidal Structure and Optimal Scheduling Control
- Optimal flows in networks with multiple sources and sinks
- Finding the nearest point in A polytope
- A good algorithm for lexicographically optimal flows in multi-terminal networks
- Minimizing a Submodular Function on a Lattice
- Monotone Comparative Statics
- A Fast Parametric Submodular Intersection Algorithm for Strong Map Sequences
- Discrete Convex Analysis
- On Steepest Descent Algorithms for Discrete Convex Functions
- A Faster Scaling Algorithm for Minimizing Submodular Functions
- A Fast Parametric Maximum Flow Algorithm and Applications
- Horizontal Principal Structure of Layered Mixed Matrices: Decomposition of Discrete Systems by Design-Variable Selections
- A Two-Sided Discrete-Concave Market with Possibly Bounded Side Payments: An Approach by Discrete Convex Analysis
- A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
- On Convex Minimization over Base Polytopes
- Transversals and matroid partition
- Minimum partition of a matroid into independent subsets
- Lehmans switching game and a theorem of Tutte and Nash-Williams
- A THEOREM ON INDEPENDENCE RELATIONS
- Matrices and matroids for systems analysis
