Lexicographic search of optimal solutions of Boolean programming problems

DOI10.1007/978-3-319-68640-0_5MaRDI QIDQ1797536zbMATH OpenOpenAlexFDO

Authors S. V. Chupov

Publication date 22 October 2018

Full work available at URL https://doi.org/10.1007/978-3-319-68640-0_5

zbMATH Keywords

optimizationefficiencyBoolean programminglexicographic search

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Boolean programming (90C09)

Recommendations

• scientific article; zbMATH DE number 1524187
• Auxiliary possibilities of the solution of a lexicographic knapsack problem in Boolean programming
• Boolean lexicographic optimization: algorithms \& applications
• New approaches to solving discrete programming problems on the basis of lexicographic search
• scientific article; zbMATH DE number 5159232

Cited in

(6)

• An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem
• Boolean lexicographic optimization: algorithms \& applications
• A lexicographic optimization algorithm
• scientific article; zbMATH DE number 5158986 (Why is no real title available?)
• New approaches to solving discrete programming problems on the basis of lexicographic search
• scientific article; zbMATH DE number 1524187 (Why is no real title available?)

This page was built for publication: Lexicographic search of optimal solutions of Boolean programming problems

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