New approaches to solving discrete programming problems on the basis of lexicographic search

DOI10.1007/S10559-016-9855-9zbMath1348.90570OpenAlexW2476923378MaRDI QIDQ333559

Sergey V. Chupov

Publication date: 31 October 2016

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

Full work available at URL: https://doi.org/10.1007/s10559-016-9855-9

zbMATH Keywords

lexicographic orderdiscrete programming problemlexicographic maximumlexicographic search algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (1)

An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem

Cites Work

• Unnamed Item

This page was built for publication: New approaches to solving discrete programming problems on the basis of lexicographic search