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

DOI10.1002/sapm197554117zbMath0311.90075MaRDI QIDQ4071032

Daniel J. Kleitman, Armin Claus

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

90C35: Programming involving graphs or networks

65K05: Numerical mathematical programming methods

90C90: Applications of mathematical programming

Related Items

Some problems in discrete optimization, Unnamed Item