Abstract
Using the partial order technique, we describe a subclass of objective functions taking their optimum at the greedy point of a given feasible polyhedron inR n.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Edmonds J (1970) Submodular functions, matroids and certain polyhedra. In: Combinatorial Structures and their Applications. Gordon and Breach, New York 69–87
Zimmermann U (1977) Some partial orders related to boolean optimization and the greedy algorithm. Annals of Discrete Mathematics 1:539–550
Kovalev M (1987) Matroids in discrete optimization. Belarusian University Press, Minsk (in Russian)
Kovalev MM, Vasilkov DM The canonical order and greedy algorithms. European Journal of Operational Research
Author information
Authors and Affiliations
Additional information
Supported by the Belarusian Foundatmental Research Found
Rights and permissions
About this article
Cite this article
Kovalev, M.M., Vasilkov, D.M. The canonical order and optimization problems. Mathematical Methods of Operations Research 43, 161–167 (1996). https://doi.org/10.1007/BF01680369
Issue Date:
DOI: https://doi.org/10.1007/BF01680369