scientific article

zbMath0467.90039MaRDI QIDQ3920982

Robert E. Beck, Bernard Kolman

Publication date: 1980

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

zbMATH Keywords

softwareconvexitytraveling salesmanperturbationsbranch and boundnetworksgraphsoptimal solutionsknapsack problemsimplex methodcutting planeassignmentlinear algebraoperations researchdual programeconomic interpretationout-of-kilter algorithmmaximal flow problemelementary textbook

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Applications of mathematical programming (90C90) Integer programming (90C10) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Duality theory (optimization) (49N15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to linear algebra (15-01)

Related Items (5)

SUCCESSIVE MAPPINGS: AN APPROACH TO POLYGONAL MESH SIMPLIFICATION WITH GUARANTEED ERROR BOUNDS ⋮ An intelligent moving object optimization algorithm for design problems with mixed variables, mixed constraints and multiple objectives ⋮ Further results on the spectral decomposition of an incidence matrix ⋮ Revisiting the 0,1 assignment problem ⋮ Classes of matrices for the traveling salesman problem

This page was built for publication: