Some problems in discrete optimization
From MaRDI portal
Publication:5636690
Cites work
- scientific article; zbMATH DE number 3159208 (Why is no real title available?)
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 2146482 (Why is no real title available?)
- scientific article; zbMATH DE number 3441964 (Why is no real title available?)
- scientific article; zbMATH DE number 3225079 (Why is no real title available?)
- scientific article; zbMATH DE number 3235858 (Why is no real title available?)
- scientific article; zbMATH DE number 3268843 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- scientific article; zbMATH DE number 3316608 (Why is no real title available?)
- scientific article; zbMATH DE number 3314878 (Why is no real title available?)
- scientific article; zbMATH DE number 3336525 (Why is no real title available?)
- scientific article; zbMATH DE number 3363584 (Why is no real title available?)
- scientific article; zbMATH DE number 3363585 (Why is no real title available?)
- scientific article; zbMATH DE number 3380524 (Why is no real title available?)
- A Decomposition Algorithm for Shortest Paths in a Network
- A Survey of Progress in Graph Theory in the Soviet Union
- A Theorem on Boolean Matrices
- A generalized upper bounding algorithm for multicommodity network flow problems
- A note on two problems in connexion with graphs
- A suggested computation for maximal multi-commodity network flows
- 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
- Flow Networks and Combinatorial Operations Research
- Heuristic Methods for Solving Large Scale Network Routing Problems: The Telpaking Problem
- Letter to the Editor—A Multicommodity Max-Flow Algorithm
- Minimal Number of Multiple Edges in Realization of an Incidence Sequence Without Loops
- Multi-Commodity Network Flows
- Network flow, transportation and scheduling. Theory and algorithms
- On Determining the Minimum Number of Multiple Edges for an Incidence Sequence
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph II. Uniqueness
- On the Efficiency of the Algorithm for Steiner Minimal Trees
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Optimal Sequencing of Two Equivalent Processors
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
- Pathology of Traveling-Salesman Subtour-Elimination Algorithms
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem
- Set Covering and Involutory Bases
- Set Covering and Involutory Bases
- Shortcut in the Decomposition Algorithm for Shortest Paths in a Network
- Steiner Minimal Trees
- Synthesis of a Communication Network
- The m-Center Problem
- The Extension of the Cascade Algorithm to Large Graphs
- The One-Terminal TELPAK Problem
- The Traveling Salesman Problem: A Survey
- The Use of Wye-Delta Transformations in Network Simplification
- The traveling-salesman problem and minimum spanning trees: Part II
This page was built for publication: Some problems in discrete optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5636690)
