scientific article; zbMATH DE number 3805267
zbMath0509.90053MaRDI QIDQ4749594
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitymatchingvehicle routinglocation problemsresource allocationapproximate solutionPERTset coveringtravelling salesmanassignment problemcomputational experienceworst-case analysislogisticscritical pathNP-hard problemscombinatorial optimisationmax-flow min-cut theoremdistribution problemstransshipmentheuristic methodschinese postmanimprovement methodp-medianflows in networksbranch-and-bound methodsactivity schedulingminimax facility locationuncapacitated plant locationproject networkslower bounding schemeout-of-kilter algorithmp-centre problemshortest spanning treepolynomial bounded algorithmscontraction-compression approachm-centre problemshortest route problems
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Inventory, storage, reservoirs (90B05) Paths and cycles (05C38) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items