Opposite Elements in Clutters

DOI10.1287/moor.2017.0864zbMath1439.90018OpenAlexW2754102152MaRDI QIDQ5219549

Ricardo Fukasawa, Ahmad Abdi, Laura Sanità

Publication date: 12 March 2020

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: http://eprints.lse.ac.uk/101835/1/opposite.pdf

zbMATH Keywords

arborescencesset covering polyhedronpacking propertyideal cluttersreplication conjecture

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (3)

Delta Minors, Delta Free Clutters, and Entanglement ⋮ Intersecting restrictions in clutters ⋮ Ideal Clutters That Do Not Pack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of simple games
• Expressing combinatorial optimization problems by linear programs
• The matroids with the max-flow min-cut property
• A catalog of minimally nonideal matrices
• Arborescence polytopes for series-parallel graphs
• The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combinatorial designs and related systems
• Combinatorial Optimization
• Delta Minors, Delta Free Clutters, and Entanglement
• Integer Programming
• Maximal Flow Through a Network
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Lehman's Theorem and the Directed Steiner Tree Problem
• On the width—length inequality
• The Forbidden Minors of Binary Clutters
• Ideal Clutters That Do Not Pack
• A Solution of the Shannon Switching Game
• Optimum branchings
• Bottleneck extrema
• Blocking and anti-blocking pairs of polyhedra
• The packing property.

This page was built for publication: Opposite Elements in Clutters