Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem

DOI10.1002/sapm197554117zbMath0311.90075OpenAlexW3150716766MaRDI QIDQ4071032

Armin Claus, Daniel J. Kleitman

Publication date: 1975

Published in: Studies in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/sapm197554117

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90)

Related Items (2)

Some problems in discrete optimization ⋮ The network redesign problem for access telecommunications networks

This page was built for publication: Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem