scientific article
zbMath0678.90052MaRDI QIDQ3993083
Eberhard Triesch, Hubertus Th. Jongen
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
heuristicsshortest pathmatchingbranch and boundprobabilistic analysistravelling salesmanminimum spanning treeknapsacktransshipmentBellman's optimality principleunimodular matricesnetwork simplex method
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Dynamic programming (90C39) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Boolean programming (90C09) Combinatorial aspects of matroids and geometric lattices (05B35)
This page was built for publication:
