Some problems in discrete optimization

DOI10.1007/BF01584076zbMath0228.90031MaRDI QIDQ5636690

No author found.

Publication date: 1971

Published in: Mathematical Programming (Search for Journal in Brave)

Mathematics Subject Classification ID

Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Uses Software

• Algorithm 97

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Network flow, transportation and scheduling. Theory and algorithms
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• The Use of Wye-Delta Transformations in Network Simplification
• Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem
• Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
• A Decomposition Algorithm for Shortest Paths in a Network
• Steiner Minimal Trees
• Letter to the Editor—A Multicommodity Max-Flow Algorithm
• The Extension of the Cascade Algorithm to Large Graphs
• Flow Networks and Combinatorial Operations Research
• An Appraisal of Some Shortest-Path Algorithms
• Conversion of Limited-Entry Decision Tables to Optimal Computer Programs I: Minimum Average Processing Time
• Feasibility of Two Commodity Network Flows
• Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops
• The m-Center Problem
• Shortcut in the Decomposition Algorithm for Shortest Paths in a Network
• A Survey of Progress in Graph Theory in the Soviet Union
• On Determining the Minimum Number of Multiple Edges for an Incidence Sequence
• Optimal Sequencing of Two Equivalent Processors
• The Traveling Salesman Problem: A Survey
• On the Efficiency of the Algorithm for Steiner Minimal Trees
• The One-Terminal TELPAK Problem
• Pathology of Traveling-Salesman Subtour-Elimination Algorithms
• Synthesis of a Communication Network
• Set Covering and Involutory Bases
• The traveling-salesman problem and minimum spanning trees: Part II
• Set Covering and Involutory Bases
• A generalized upper bounding algorithm for multicommodity network flow problems
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
• A Theorem on Boolean Matrices
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• Multi-Commodity Network Flows