scientific article
From MaRDI portal
Publication:3205014
zbMath0415.90057MaRDI QIDQ3205014
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
computational complexitylinear programmingheuristicscombinatorial optimizationresearch surveytraveling salesman problemworst-case performancematching problemassignment problemapproximate algorithmscomputational aspectsbranch-and-bound methodsshortest spanning trees
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Boolean programming (90C09)
Related Items
Two-edge connected spanning subgraphs and polyhedra, A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem, Managing tendupatta leaf logistics: an integrated approach, Minimum-weight two-connected spanning networks, Solving the linear matroid parity problem as a sequence of matroid intersection problems, Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations, A restricted Lagrangean approach to the traveling salesman problem, Optimizing over the subtour polytope of the travelling salesman problem
