scientific article; zbMATH DE number 3763671

MaRDI QIDQ3945940zbMATH OpenFDO

Authors Johannes Terno

Publication date 1981

zbMATH Keywords

assignmentbranch and bound methodscutting planesdynamic optimizationepsilon-optimal algorithmgreedy algorithmsknapsack problemshortest pathtraveling salesman

Mathematics Subject Classification ID

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

Cited in

(3)

• A hybrid method for solving nonlinear knapsack problems
• A note on the solution of group knapsack problems
• On the stochastic complexity of the asymmetric traveling salesman 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 Q3945940)