scientific article; zbMATH DE number 3314878

No author found.

Publication date: 1969

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

integer programming network flows Gomory cut

Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Optimal distributed execution of join queries, Combinatorial approaches to multiflow problems, On equivalent knapsack problems, Two commodity flows, Metric and ultrametric inequalities for directed graphs, A decomposition algorithm for multi-terminal network flows, Incorporating processor costs in optimizing the distributed execution of join queries, Edge-connectivity augmentation problems, An algorithm for large scale 0-1 integer programming with application to airline crew scheduling, Approximation algorithms for weighted matching, Dynamic supply chain design with inventory, Executing join queries in an uncertain distributed environment, Allocating relations in a distributed database system, On the computational complexity of the Abelian permutation group structure, membership and intersection problems, Minimizing the response time of executing a join between fragmented relations in a distributed database system, Scatter search and star-paths: Beyond the genetic metaphor, Generalizing the all-pairs min cut problem, How to find the convex hull of all integer points in a polyhedron?, The propagation of updates to relational tables in a distributed database system, Generalized polymatroids and submodular flows, Location and layout planning. A survey, A binary integer linear program with multi-criteria and multi-constraint levels, Speeding up Karmarkar's algorithm for multicommodity flows, Atomic routing game with capacity constraints, Genetic algorithms in constrained optimization, Multiterminal flows and cuts, Maximum \((s,t)\)-flows in planar networks in \(\mathcal O(|V| \log |V|)\) time, The planar multiterminal cut problem, The design of a 0-1 integer optimizer and its application in the Carmen system, The subgraph homeomorphism problem, A number theoretic reformulation and decomposition method for integer programming, On inclusion problem for deterministic multitape automata, Integer programming by long division, Tight bounds for periodicity theorems on the unbounded knapsack problem, Number of natural solutions of a system of linear Diophantine equations, Diophantine quadratic equation and Smith normal form using scaled extended integer Abaffy-Broyden-Spedicato algorithms, Optimal planning of network structures within an exchange area, The Unbounded Knapsack Problem, Characterizing (quasi-)ultrametric finite spaces in terms of (directed) graphs, Restricted vertex multicut on permutation graphs, An exact algorithm for large unbounded knapsack problems, On maximum flows in polyhedral domains, Optimising the distributed execution of join queries in polynomial time, Further results on the spectral decomposition of an incidence matrix, Ancestor tree for arbitrary multi-terminal cut functions, An empirical analysis of exact algorithms for the unbounded knapsack problem, Discrete optimization algorithms and problems of decision making in a fuzzy environment, Fine covers of a VAS language, Step graphs and their application to the organization of commodity flows in networks, A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix, The decomposition of a communication network considering traffic demand interrelations, Primal-dual approximation algorithms for integral flow and multicut in trees, A bounded dual (all-integer) integer programming algorithm with an objective cut, Decomposition algorithms for finding the shortest path between a source node and a sink node of a network, Parallelschnitte in der ganzzahligen optimierung, Graph connectivity and its augmentation: Applications of MA orderings, Computer-based algorithms for multiple criteria and multiple constraint level integer linear programming, Aggregation of equations in integer programming, Accelerating Greenberg's method for the computation of knapsack functions, Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint), A note on transition systems, An application of Gomory cuts in number theory, A cyclic integer covering problem, Matrix operations and the properties of networks and directed graphs, Maximum flows and minimum cuts in the plane, A measure-theoretical max-flow-min-cut problem, Complexity of some problems in Petri nets, Static main storage packing problems, Algorithms of discrete optimization and their application to problems with fuzzy coefficients, Discrete right hand side parametrization for linear integer programs, Multicommodity flows in tree-like networks, An extension of Hu's group minimization algorithm, Problems of efficient application and development of a network under capital investments and credits, Evaluating multiple join queries in a distributed database system, On max-flow min-cut and integral flow properties for multicommodity flows in directed networks, A relation between the knapsack and group knapsack problems, On the asymptotic integer algorithm, A characterization of signed hypergraphs and its applications to VLSI via minimization and logic synthesis, An empirical investigation of some bicriterion shortest path algorithms, Flüsse in antisymmetrischen Netzwerken. (Flows in anti-symmetric networks.), Unbounded knapsack problem: Dynamic programming revisited, Edmonds polytopes and a hierarchy of combinatorial problems, An improved approximation algorithm of MULTIWAY CUT., A cyclic production problem: An application of max-algebra, Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties, Polytopes of partitions of numbers, A linear-time algorithm for edge-disjoint paths in planar graphs, Recent trends in combinatorial optimization, Integer and mixed-integer programming models: General properties, A parametric algorithm for convex cost network flow and related problems, On a simple deadlock recovery problem, The inclusion problem for some classes of deterministic multitape automata, Shortest paths in networks with vector weights, Predicting nearly as well as the best pruning of a planar decision graph., Recognizing badly presented \(Z\)-modules, A maximum flow problem with intermediate node requirements, Analysis of algorithms on problems in general abelian groups, Fair relation and modified synchronic distances in a Petri net, Examples of max-flow and min-cut problems with duality gaps in continuous networks, An algorithm for the periodic solutions in the knapsack problem, The minimum cost flow problem: A unifying approach to dual algorithms and a new tree-search algorithm, Some Results on Polyhedra of Semigroup Problems, Synthesis of directed multicommodity flow networks, A note on handling residual lengths, Efficient algorithms for generalized cut‐trees, On a parametric shortest path problem from primal—dual multicommodity network optimization, Analysis of the knapsack problem using L-partition, Computation of the forwarding index via flows: A note, Some problems in discrete optimization, An approximation algorithm for the \(B\)-prize-collecting multicut problem in trees, Integer points on the Gomory fractional cut (hyperplane), On the maximal flow problem with real arc capacities, Computing Maximum Flows in Undirected Planar Networks with Both Edge and Vertex Capacities, A two product dynamic economic lot size production model with either-or production constraints, Minimal disconnecting sets in directed multi‐commodity networks, On some techniques useful for solution of transportation network problems, Generation of all integer points for given sets of linear inequalities, Comparison of algorithms for calculation of g.c.d. of polynomials, Computational experience with a group theoretic integer programming algorithm, The knapsack problem: A survey, Unnamed Item, Storage cost considerations in secondary index selection, On stochastic integer programming, Metric and ultrametric spaces of resistances, Unnamed Item, An efficient scaling procedure for gain networks, Maximum Flows and Minimum Cuts in the Plane, On mixed integer quadratic programs, Shortest path algorithms for knapsack type problems, Lot sizing algorithms with applications to engineering and economics, Shortest-path queries in static networks, Sequential approach to the solution of mixed linear programs, On multicommodity flows in planar graphs, Production‐allocation scheduling and capacity expansion using network flows under uncertainty, More pathological examples for network flow problems, Selection of dedicated channels and flow optimization in a packet switched network, Tree decomposition algorithm for large networks, A fundamental problem in vehicle routing, Unnamed Item, On optimum path problems, A cut-flow procedure for transportation network optimization, Multicommodity network flows—A survey, The flow deviation method: An approach to store‐and‐forward communication network design, The Collapsing 0–1 Knapsack Problem, Level-planar drawings with few slopes, Level-planar drawings with few slopes, State‐space partition techniques for multiterminal flows in stochastic networks, Multiterminal network flows and applications, Decomposition algorithms for minimal cut problems, Subclass of the Steiner problems on a plane with rectilinear metric, Maximal flow through a domain, The continuous collapsing Knapsack problem, Decomposition algorithms for locating minimal cuts in a network, Synthesis of single-product networks, A comparative study of algorithms for computing the Smith normal form of an integer matrix†, Unnamed Item, A decomposition algorithm for locating a shortest path between two nodes in a network, Über die irrednziblen punkte des eckenpolyeders, A Simple Algorithm for Finding a Non-negative Basic Solution of a System of Linear Algebraic Equations, Solving Linear Programming Problems by Reducing to the Form with an Obvious Answer, On building minimum cost communication networks over time, An economic equilibrium model on a multicommodity network, A bad network problem for the simplex method and other minimum cost flow algorithms, On integer solutions to quadratic programs by a branch and bound technique, Determining minimal cuts with a minimal number of arcs