scientific article

From MaRDI portal

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

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

Publication:3945940

Jump to:navigation, search

zbMath0485.90058MaRDI QIDQ3945940

Johannes Terno

Publication date: 1981

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

zbMATH Keywords

shortest path traveling salesman knapsack problem dynamic optimization cutting planes assignment greedy algorithms branch and bound methods epsilon-optimal algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Boolean programming (90C09)

Related Items (3)

A note on the solution of group knapsack problems ⋮ A hybrid method for solving nonlinear knapsack problems ⋮ On the stochastic complexity of the asymmetric traveling salesman problem

This page was built for publication:

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