scientific article; zbMATH DE number 3805267

zbMath0509.90053MaRDI QIDQ4749594

T. Brian Boffey

Publication date: 1982

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

A heuristic solution to the warehouse location-routing problem, Network reliability and the probabilistic estimation of damage from fire spread, Fire risk in linear segregated structures -- fire door determination, Design of an atomized organization structure: a graph-theoretic approach, Intuitionistic fuzzy multi-criteria group decision making with an application to critical path selection, Some consistency measures of extended hesitant fuzzy linguistic preference relations, A Mathematical Programming Model for Optimizing a Petroleum Network of Pipelines and Depots, A shortest path routing problem with resource allocation, A high-level dataflow system, Optimal file allocation in a loop topology local area network, Maximization of submodular functions: theory and enumeration algorithms, A method for repairing the inconsistency of fuzzy preference relations