The Orthant Non-Interaction Theorem for Certain Combinatorial Polyhedra and its Implications in the Intersection and the Dilworth Truncation of Bisubmodular Functions

DOI10.1080/02331939508844117zbMath0855.90104OpenAlexW2090738940MaRDI QIDQ4888278

Satoru Fujishige, Sachin B. Patkar

Publication date: 28 July 1996

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331939508844117

zbMATH Keywords

Dilworth truncationsystems of inequalitiesclass of polyhedraintersection of two bisubmodular polyhedra

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial optimization (90C27)

Related Items (1)

Personal reminiscence: combinatorial and discrete optimization problems in which I have been interested

Cites Work

• Unnamed Item
• Some combinatorial properties of discriminants in metric vector spaces
• Pseudomatroids
• Directed submodularity, ditroids and directed submodular flows
• \(b\)-matching degree-sequence polyhedra
• On totally dual integral systems
• Greedy algorithm and symmetric matroids
• A greedy algorithm for solving a certain class of linear programmes

This page was built for publication: The Orthant Non-Interaction Theorem for Certain Combinatorial Polyhedra and its Implications in the Intersection and the Dilworth Truncation of Bisubmodular Functions