×
Boffey, T. B.

Graph theory in operations research. (English) Zbl 0509.90053

Macmillan Computer Science Series. London - Basingstoke etc.: The Macmillan Press Ltd. X, 301 p. $ 25.00; £12.95 (1982).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0509.90053

Cited in 12 Documents

MSC:

90C35 Programming involving graphs or networks
90-01 Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
05C35 Extremal problems in graph theory
90B10 Deterministic network models in operations research
65K05 Numerical mathematical programming methods
05C38 Paths and cycles
90B05 Inventory, storage, reservoirs

Keywords:

critical path; vehicle routing; logistics; p-median; activity scheduling; combinatorial optimisation; branch-and-bound methods; shortest route problems; location problems; project networks; travelling salesman; chinese postman; distribution problems; flows in networks; heuristic methods; computational complexity; polynomial bounded algorithms; NP-hard problems; uncapacitated plant location; lower bounding scheme; set covering; m-centre problem; minimax facility location; approximate solution; p-centre problem; PERT; resource allocation; assignment problem; contraction-compression approach; shortest spanning tree; matching; max-flow min-cut theorem; out-of-kilter algorithm; transshipment; improvement method; worst-case analysis; computational experience

Citations:

Zbl 0092.16002; Zbl 0234.90063; Zbl 0422.90053; Zbl 0369.90125; Zbl 0218.90063; Zbl 0136.14705; Zbl 0178.22902; Zbl 0112.12401; Zbl 0251.90027; Zbl 0274.90013; Zbl 0106.34802
Cite Review PDF