scientific article; zbMATH DE number 847288
From MaRDI portal
Publication:4865055
zbMath0860.90120MaRDI QIDQ4865055
Publication date: 25 February 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
heuristicstextbookmatchingtraveling salesmanSteiner tree problemtreesminimum cost flowbranchingsnetwork optimizationarborescencesChinese postmannetwork simplex methodminimum weight spanning trees
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Related Items (4)
Sanctions in networks: ``The most unkindest cut of all ⋮ Wasserstein distances in the analysis of time series and dynamical systems ⋮ Minimum-weight spanning tree algorithms. A survey and empirical study ⋮ Cut generation for an employee timetabling problem
This page was built for publication:
