scientific article

zbMath0427.90058MaRDI QIDQ3863425

Edward Minieka

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

linear programmingcoveringcombinatorial optimizationmatchinggreedy algorithmcomputational methodsspanning treetraveling salesman problemPERTlocationbranch and bound algorithmChinese postman problemCPMheuristic methodalgorithmic approachnetwork flow problemsshortest path problemselementary expositionflows in networksproject planningproject networksout-of-kilter algorithmmaximum branching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Linear programming (90C05) Deterministic network models in operations research (90B10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Related Items (25)

File allocation in a distributed database ⋮ Solvable cases of the \(k\)-person Chinese postman problem ⋮ A new algorithm for the directed Chinese postman problem ⋮ Large-scale network analysis with applications to transportation, communication and inference networks ⋮ On \(O(n^2)\) heuristic algorithm for the directed Steiner minimal tree problem ⋮ Flow and greedy algorithms of resource co-allocation in distributed systems ⋮ Biased graphs IV: Geometrical realizations ⋮ Locational analysis ⋮ Biased graphs. II: The three matroids ⋮ MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES ⋮ Multiple Routing Strategies in a Labelled Network ⋮ Time-varying universal maximum flow problems ⋮ On the expected value of stochastic linear programs and (dynamic) network flow problems ⋮ The problem of the optimal placing of the information-technological reserve in distributed data processing systems ⋮ Long-term staffing based on qualification profiles ⋮ The maximum benefit Chinese postman problem and the maximum benefit traveling salesman problem ⋮ Biased graphs. I: Bias, balance, and gains ⋮ On shortest-path algorithms in the topological design of computer networks: a comparative study ⋮ An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs ⋮ Unnamed Item ⋮ Mathematical modelling for optimized control of Moscow's sewer network ⋮ Fuzzy association rules and the extended mining algorithms ⋮ Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree ⋮ Equivalence between the minimum covering problem and the maximum matching problem ⋮ A linear-time algorithm for solving the center problem on weighted cactus graphs

This page was built for publication: