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

DOI10.1007/s10559-018-0057-5zbMath1445.90091OpenAlexW2882979844MaRDI QIDQ1616250

Sergey V. Chupov

Publication date: 1 November 2018

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

Full work available at URL: https://doi.org/10.1007/s10559-018-0057-5

zbMATH Keywords

lexicographic orderlexicographic maximumlexicographic search algorithmmultidimensional Boolean knapsack problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09) Approximation algorithms (68W25)

Uses Software

• OR-Library

Cites Work

• New approaches to solving discrete programming problems on the basis of lexicographic search
• Heuristics for the 0-1 multidimensional knapsack problem
• A genetic algorithm for the multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• Improved results on the 0--1 multidimensional knapsack problem
• Unnamed Item

This page was built for publication: An approximate algorithm for lexicographic search in multiple orders for the solution of the multidimensional Boolean knapsack problem