A study of one class of integer multicriterion problems

DOI10.1016/0041-5553(88)90144-9zbMATH Open0668.90081OpenAlexW1973148924MaRDI QIDQ3821962

V. A. Pereplitsa, I. V. Sergienko

Publication date: 1988

Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0041-5553(88)90144-9

zbMATH Keywords

Pareto setcomplete set of alternativeslower estimationpolynomial approximate algorithmsasymptotically accurate algorithmlexicographic subsetlinear convolution algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31)

Related Items (2)

A fragmented model for the problem of land use on hypergraphs ⋮ An analysis of six greedy selection rules on a class of zero-one integer programming models

This page was built for publication: A study of one class of integer multicriterion problems

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