The general Steiner problem in Boolean space and application
In a Boolean space the distance D(A,B) of points A, B is defined as their symmetric difference, i.e. \(D(A,B)=A\oplus B=\) \(AB'+A'B.\) Given n Boolean points \(x_ 1,...,x_ n\) and Boolean constants \(c_ 1,...,c_ n\). The general Steiner problem (GSP) in Boolean space is to find the point X such that \(\Phi (X)=\sum^{n}_{i=1}c_ iD(x_ i,X)\) be minimum. The case \(c_ 1=...=c_ n\) is of geometric interest. The GSP is an optimization problem of genuine Boolean function. The main idea of solution is reduced to the problem of solving the Boolean equations. The author gives an application of GSP as a mathematical model for actual optimization, and he expects further applications as well in mathematical theory as in practice.
- Generalized Steiner problems and other variants
- Some generalizations of the steiner problem in graphs
- Problems with generalized Steiner problems
- scientific article; zbMATH DE number 1182759
- The Steiner problem: a survey
- A Steiner general position problem in graph theory
- The general Steiner problem in rectangular crisscross space
- The polymatroid Steiner problems
- Algorithms and Computation
- Existence and regularity results for the Steiner problem
- Autometrized Boolean Algebras II
- Boolean geometry. II
- scientific article; zbMATH DE number 3501560 (Why is no real title available?)
- scientific article; zbMATH DE number 3204690 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- scientific article; zbMATH DE number 3319563 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- On the relations “semi-between” and “parallel” in lattices
This page was built for publication: The general Steiner problem in Boolean space and application
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q810871)