Structures of polyhedra determined by submodular functions on crossing families

DOI10.1007/BF02592217zbMATH Open0545.90097OpenAlexW2068241960MaRDI QIDQ3337243FDOQ3337243

Authors: Satoru Fujishige 

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02592217

Recommendations

• Optimization over the polyhedron determined by a submodular function on a co-intersecting family
• Structural theorems for submodular functions, polymatroids and polymatroid intersections
• scientific article; zbMATH DE number 1953186
• scientific article; zbMATH DE number 1379520
• Polyhedral structure of submodular and posi-modular systems
• scientific article; zbMATH DE number 1303026
• On structures of bisubmodular polyhedra
• scientific article; zbMATH DE number 1342137
• Lattice polyhedra and submodular flows
• scientific article; zbMATH DE number 437545

zbMATH Keywords

submodular functiondistributive latticecrossing family of subsetsindependent flow problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Integer programming (90C10) Polytopes and polyhedra (52Bxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Minimization on submodular flows
• Computing Maximal “Polymatroidal” Network Flows
• ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
• AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
• Minimization of Some Nonlinear Functions over Polymatroidal Network Flows
• An Algorithm for Submodular Functions on Graphs
• Title not available (Why is that?)
• A PRIMAL APPROACH TO THE INDEPENDENT ASSIGNMENT PROBLEM
• Title not available (Why is that?)
• AN ALGORITHM FOR FINDING AN OPTIMAL INDEPENDENT LINKAGE

Cited In (29)

• Title not available (Why is that?)
• Edge splitting and connectivity augmentation in directed hypergraphs.
• Structural theorems for submodular functions, polymatroids and polymatroid intersections
• A note on the Frank-Tardos bi-truncation algorithm for crossing- submodular functions
• Combined connectivity augmentation and orientation problems
• A note on Frank's generalized polymatroids
• Lattice polyhedra and submodular flows
• Submodular systems and related topics
• On the orientation of graphs and hypergraphs
• Directed submodularity, ditroids and directed submodular flows
• Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested
• Duality for balanced submodular flows
• On Packing Dijoins in Digraphs and Weighted Digraphs
• A CHARACTERIZATION OF FACES OF THE BASE POLYHEDRON ASSOCIATED WITH A SUBMODULAR SYSTEM
• Polyhedral structure of submodular and posi-modular systems
• Linear and combinatorial sharing problems
• A decomposition of distributive lattices
• An out-of-kilter method for submodular flows
• Generalized polymatroids and submodular flows
• A capacity scaling algorithm for convex cost submodular flows
• Fair integral submodular flows
• A vector exchange property of submodular systems
• A Survey on Covering Supermodular Functions
• Optimization over the polyhedron determined by a submodular function on a co-intersecting family
• On the subdifferential of a submodular function
• Title not available (Why is that?)
• Tree-compositions and orientations
• Decreasing minimization on M-convex sets: algorithms and applications
• Sharing problems

This page was built for publication: Structures of polyhedra determined by submodular functions on crossing families

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3337243)