An efficient algorithm for the minimum capacity cut problem
From MaRDI portal
Publication:922927
DOI10.1007/BF01580850zbMath0711.90022OpenAlexW2005944337WikidataQ58002954 ScholiaQ58002954MaRDI QIDQ922927
Publication date: 1990
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01580850
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10)
Related Items
Generating subtour elimination constraints for the TSP from pure integer solutions, A distributed exact algorithm for the multiple resource constrained sequencing problem, A branch-and-cut algorithm for vehicle routing problems, A branch-and-cut framework for the consistent traveling salesman problem, TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration, Minimum cut problem using bases of extended polymatroids, A matheuristic algorithm for the pollution and energy minimization traveling salesman problems, Simplifying maximum flow computations: the effect of shrinking and good initial flows, Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups., Facet identification for the symmetric traveling salesman polytope, Cardinality constrained minimum cut problems: complexity and algorithms., Practical Minimum Cut Algorithms, Exact solutions to linear programming problems, On solving cycle problems with branch-and-cut: extending shrinking and exact subcycle elimination separation algorithms, The traveling salesman problem with draft limits, Graph connectivity and its augmentation: Applications of MA orderings, Branch and cut methods for network optimization, A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants, A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation, Minimum Cuts of Simple Graphs in Almost Always Linear Time, Models and algorithms for the traveling salesman problem with time-dependent service times, Unnamed Item, Implementing an efficient minimum capacity cut algorithm, The traveling purchaser problem with budget constraint, Minimizing symmetric submodular functions, Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems, Solution of large-scale symmetric travelling salesman problems
Cites Work
- Unnamed Item
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- Maximal Flow Through a Network
- Trees and Cuts
- Multi-Terminal Network Flows
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
- Selected Applications of Minimum Cuts in Networks
- Generalized Feedback Shift Register Pseudorandom Number Algorithm
