Combinatorial solution of the partition problem for a discrete set

DOI10.1007/BF02665893zbMATH Open0907.90225OpenAlexW2016376151MaRDI QIDQ1264591FDOQ1264591

A. I. Stiranka

Publication date: 22 November 1998

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

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

zbMATH Keywords

set partitioning

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Partitions of sets (05A18)

Cites Work

• The vectorization of the partition problem
• Concept of linearity and convexity in a discrete space. Combinatorial linear problems. II
• Title not available (Why is that?)

Cited In (5)

• Partitioning a finite set by a dynamic programming method
• Title not available (Why is that?)
• Title not available (Why is that?)
• Division of a set of segments into nonintersecting parts on a discrete plane
• Title not available (Why is that?)

   Recommendations

• Combinatorics of set partitions 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On the sumset partition problem 👍 👎
• A Generalization of the Partition Problem 👍 👎
• Discrete version of an optimal partitioning problem 👍 👎
• Complementary set partitions 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Combinatorial solution of the partition problem for a discrete set

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