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

DOI10.1007/S10559-016-9855-9zbMATH Open1348.90570OpenAlexW2476923378MaRDI QIDQ333559FDOQ333559

Authors: S. 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

Recommendations

• Lexicographic optima in the multicriteria discrete optimization problem
• Lexicographic search of optimal solutions of Boolean programming problems
• scientific article; zbMATH DE number 1353833
• Lexicographic-lexicographical optimization problems with alternative criteria
• Some problems of lexicographical optimization with alternative criteria.

zbMATH Keywords

lexicographic orderdiscrete programming problemlexicographic maximumlexicographic search algorithm

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cites Work

• Title not available (Why is that?)

Cited In (3)

• An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem
• Lexicographic search of optimal solutions of Boolean programming problems
• Lexicographic local search and the \(p\)-center problem.

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

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