scientific article

zbMATH Open0541.90076MaRDI QIDQ3329226

Krzysztof Dudzinski, Stanisław Walukiewicz

Publication date: 1984

Title of this publication is not available (Why is that?)

zbMATH Keywords

algorithmbranch and bound approachlinear multiple-choice knapsack problemmedian in ordered sets

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (5)

Solving the linear multiple choice knapsack problem with two objectives: Profit and equity ⋮ A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints ⋮ An O(n) algorithm for the multiple-choice knapsack linear program ⋮ An O(n) algorithm for the linear multiple choice knapsack problem and related problems ⋮ A fast algorithm for the linear multiple-choice knapsack problem

Recommendations

• Title not available (Why is that?) 👍 👎
• A branch and bound algorithm for solving the multiple-choice knapsack problem 👍 👎
• An O(n) algorithm for the linear multiple choice knapsack problem and related problems 👍 👎
• A dynamic programming approach to solving the multiple choice knapsack problem 👍 👎
• A fast algorithm for the linear multiple-choice knapsack problem 👍 👎
• An exact algorithm for large multiple knapsack problems 👍 👎
• A minimal algorithm for the multiple-choice knapsack problem 👍 👎
• The linear multiple choice knapsack problem 👍 👎
• An O(n) algorithm for the multiple-choice knapsack linear program 👍 👎

This page was built for publication:

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