Completeness of vector discrete optimization problems

DOI10.1007/BF02367750zbMath0837.90089OpenAlexW2092600231MaRDI QIDQ1905199

M. K. Kravtsov, Vladimir A. Emelichev

Publication date: 8 January 1996

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

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

zbMATH Keywords

sets of alternativesdiscrete vector optimizationmulticriterion integer problems

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29)

Cites Work

• Finding the set of alternatives in discrete multicriterion problems
• Topics of polyhedral combinatorics in transportation problems with exclusions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Completeness of vector discrete optimization problems