Minimization of a supermodular functions over a relatively complemented finite lattice
DOI:
https://doi.org/10.17268/sel.mat.2017.02.04Keywords:
Combinatorial optimization, relatively complemented finite lattice, supermodular functionAbstract
This work presents two discarding principles to solve the problem of the minimization of a supermodular function over a relatively complemented finite lattice. This result generalizes the one presented in [1] for the case of a supermodular function defined in the class of subsets of a given finite set.
References
N. Aragonés S. Minimización de funciones supermodulares, Selecciones Matemáticas, Vol. 02(02): 49-52 (2015).
G. Gratzer Lattice Theory, Dover Publications, Inc, Mineola, New York. (2009).
V. R. Jachatúrov, Métodos matemáticos de programación regional, Nauka, Moscú. (1989).
V. R. Jachatúrov, Métodos Combinatorios y Algoritmos para la solución de problemas de optimización discreta de gran escala, Nauka, Moscú. (2000).
Published
How to Cite
Issue
Section
License
The authors who publish in this journal accept the following conditions:
1. The authors retain the copyright and assign to the journal the right of the first publication, with the work registered with the Creative Commons Attribution License,Atribución 4.0 Internacional (CC BY 4.0) which allows third parties to use what is published whenever they mention the authorship of the work And to the first publication in this magazine.
2. Authors may make other independent and additional contractual arrangements for non-exclusive distribution of the version of the article published in this journal (eg, include it in an institutional repository or publish it in a book) provided they clearly state that The paper was first published in this journal.
3. Authors are encouraged to publish their work on the Internet (for example, on institutional or personal pages) before and during the review and publication process, as it can lead to productive exchanges and to a greater and more rapid dissemination Of the published work.
