scientific article
From MaRDI portal
Publication:3236250
zbMath0072.37802MaRDI QIDQ3236250
D. R. Fulkerson, George B. Dantzig
Publication date: 1956
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Parameterized complexity dichotomy for \textsc{Steiner Multicut}, CUBCO: Prediction of Protein Complexes Based on Min-cut Network Partitioning into Biclique Spanned Subgraphs, History-dependent scheduling: models and algorithms for scheduling with general precedence and sequence dependence, The extremal length of a network, Another Proof of Euler’s Circuit Theorem, Maximum-Minimum Sätze über Graphen, Paths of bounded length and their cuts: parameterized complexity and algorithms, Dyadic programs and subdual methods, Investments in stochastic maximum flow networks, Partition-based logical reasoning for first-order and propositional theories, George Dantzig's impact on the theory of computation, On mixed connectivity certificates, A primal simplex variant for the maximum-flow problem, Graph cuts with interacting edge weights: examples, approximations, and algorithms, Matching theory -- a sampler: From Dénes König to the present, On matching numbers of tree and bipartite degree sequences, Über reguläre Kettengruppen, On the complexity of interval scheduling with a resource constraint, Some polynomially solvable subcases of the detailed routing problem in VLSI design, Industrial aspects and literature survey: fleet composition and routing, A network solution to a general vehicle scheduling problem, On partitions of a partially ordered set, Engpässe, Staustellen und glatte homogene Ströme in Netzen, A survey of network interdiction models and algorithms, A generalization of the cut-set, Systems of representatives, Approximating the maximum clique minor and some subgraph homeomorphism problems, Optimization of communication nets with switching, On mixed connectivity certificates, Graphs and Algorithms in Communication Networks on Seven League Boots, Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms, Minimizing the number of machines for scheduling jobs with equal processing times, Minimizing the number of vehicles in periodic scheduling: The non-Euclidean case, The \(\alpha\)-maximum flow model with uncertain capacities, George B. Dantzig: a legendary life in mathematical programming, Dispatching a fishing trawler fleet in the Canadian Atlantic groundfish industry
