scientific article

From MaRDI portal

Revision as of 18:06, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3865832

Jump to:navigation, search

zbMath0428.90034MaRDI QIDQ3865832

Christoph Witzgall

Publication date: 1980

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial algorithm direct solution algorithms generalized upper bounds one-row linear programs

Mathematics Subject Classification ID

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

Related Items (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:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3865832&oldid=17483678"