scientific article; zbMATH DE number 3668317

MaRDI QIDQ3865832zbMATH OpenFDO

Authors Christoph Witzgall

Publication date 1980

zbMATH Keywords

direct solution algorithmsgeneralized upper boundsone-row linear programspolynomial algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05)

Cited in

(4)

• Implementation and analysis of a variant of the dual method for the capacitated transshipment problem
• A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
• AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints
• A branch and bound algorithm for solving the multiple-choice knapsack problem

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 Q3865832)