scientific article; zbMATH DE number 742961
From MaRDI portal
Publication:4763403
zbMath0829.68095MaRDI QIDQ4763403
Publication date: 11 April 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10)
Related Items
On Element-Connectivity Preserving Graph Simplification, A branch-and-cut algorithm for the preemptive swapping problem, A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms, Efficient algorithms for minimum range cut problems, Vertex covering with capacitated trees, Tight approximation ratio of a general greedy splitting algorithm for the minimum \(k\)-way cut problem, A distributed fault identification protocol for wireless and mobile ad hoc networks, Practical Minimum Cut Algorithms, On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms, Separating maximally violated comb inequalities in planar graphs, Binary Steiner trees: structural results and an exact solution approach, A branch‐and‐cut algorithm for the nonpreemptive swapping problem, Implementing an efficient minimum capacity cut algorithm, The asymmetric traveling salesman problem with replenishment arcs, Diagnosing infeasibilities in network flow problems, Minimizing symmetric submodular functions, Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut, A note on optimal covering augmentation for graphic polymatroids.
