scientific article; zbMATH DE number 3965788

MaRDI QIDQ3734141zbMATH OpenFDO

Authors Paul A. Jensen, J. W. Barnes

Publication date 1984

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Deterministic network models in operations research (90B10) Integer programming (90C10) Programming involving graphs or networks (90C35)

Cited in

(14)

• Solving many linear programs that differ only in the right-hand side
• Probabilistic shortest path problems with budgetary constraints
• A decomposition algorithm to determine the maximum flow in a generalized network
• Recognizing hidden bicircular networks
• An algorithm for the ranking of shortest paths
• Activity nets: A guided tour through some recent developments
• Optimization problems of transportation in communication networks with variable capacities
• A simulated annealing for multi-criteria network path problems
• On a particular quadratic network problem
• Maximum outflow in generalized flow networks
• An algorithm for ranking paths that may contain cycles
• On a special class of bicriterion path problems
• The structure of bases in bicircular matroids
• Use of penalties in a branch and bound procedure for the fixed charge transportation problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3734141)