Blocking systems of a graph and intersection-union interchange equality in bottleneck problems involving sets and fuzzy sets

DOI10.1016/0016-0032(82)90049-7zbMath0488.90054OpenAlexW2064088606MaRDI QIDQ1166415

Shu Park Chan, Kenji Onaga

Publication date: 1982

Published in: Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0016-0032(82)90049-7

zbMATH Keywords

fuzzy setscombinatorial optimizationexamplesbottleneck problemsblocking systemnon-empty intersection propertysample set inclusion property

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Integer programming (90C10) Deterministic network models in operations research (90B10) Theory of fuzzy sets, etc. (03E72)

Cites Work

• A boolean theory of network flows and metrics and its applications to particle transmission and clustering
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• Paths, Trees, and Flowers
• Flow Networks and Combinatorial Operations Research
• Bottleneck extrema

This page was built for publication: Blocking systems of a graph and intersection-union interchange equality in bottleneck problems involving sets and fuzzy sets