On the public citation graph
An efficient algorithm for the minimum capacity cut problem
0 signed · 138 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_15openalex-snapshot
Maximal Flow Through a Network
inferredcites →https://doi.org/10.1007/bf01580850openalex-snapshot
An efficient algorithm for the minimum capacity cut problem
inferredcites →https://doi.org/10.1016/0167-6377(87)90002-2openalex-snapshot
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
inferredcites →https://doi.org/10.1016/0167-6377(90)90031-yopenalex-snapshot
Optimization of a 532-city symmetric traveling salesman problem by branch and cut
inferredcites →https://doi.org/10.1080/03155986.1982.11731876openalex-snapshot
Selected Applications of Minimum Cuts in Networks
inferredcites →https://doi.org/10.1109/tit.1956.1056816openalex-snapshot
A note on the maximum flow through a network
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1137/1033004openalex-snapshot
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
inferredcites →https://doi.org/10.1145/12130.12144openalex-snapshot
A new approach to the maximum flow problem
inferredcites →https://doi.org/10.1145/321765.321777openalex-snapshot
Generalized Feedback Shift Register Pseudorandom Number Algorithm
inferredcites →https://doi.org/10.1159/000273299openalex-snapshot
Der Saccus endolymphaticus bei Entzündungsprozessen
inferredcites →https://doi.org/10.1287/mnsc.26.5.495openalex-snapshot
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
inferredcites →https://doi.org/10.4153/cjm-1956-045-5openalex-snapshot
Maximal Flow Through a Network
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0509openalex-snapshot
Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1002/net.10079openalex-snapshot
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections
inferred← citeshttps://doi.org/10.1002/net.20129openalex-snapshot
Solving minimum K‐cardinality cut problems in planar graphs
inferred← citeshttps://doi.org/10.1002/net.20358openalex-snapshot
A branch‐and‐cut‐and‐price algorithm for vertex‐biconnectivity augmentation
inferred← citeshttps://doi.org/10.1002/net.21569openalex-snapshot
The Rural Postman Problem with time windows
inferred← citeshttps://doi.org/10.1002/net.70024openalex-snapshot
Partial‐Outsourcing Strategy for the Vehicle Routing Problem With Stochastic Demands
inferred← citeshttps://doi.org/10.1006/jagm.1994.1043openalex-snapshot
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
inferred← citeshttps://doi.org/10.1006/jagm.2000.1136openalex-snapshot
Cut Tree Algorithms: An Experimental Study
inferred← citeshttps://doi.org/10.1007/1-4020-0611-x_129openalex-snapshot
Combinatorial and integer optimization
inferred← citeshttps://doi.org/10.1007/11493853_11openalex-snapshot
On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price
inferred← citeshttps://doi.org/10.1007/11537311_28openalex-snapshot
A Simple and Fast Min-cut Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-36478-1_8openalex-snapshot
Solving Real-World ATSP Instances by Branch-and-Cut
inferred← citeshttps://doi.org/10.1007/3-540-45349-0_15openalex-snapshot
Cutting Planes in Constraint Programming: An Hybrid Approach
inferred← citeshttps://doi.org/10.1007/3-540-45586-8_5openalex-snapshot
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
inferred← citeshttps://doi.org/10.1007/3-540-45586-8_7openalex-snapshot
TSP Cuts Which Do Not Conform to the Template Paradigm
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_1openalex-snapshot
Reduced Cost-Based Ranking for Generating Promising Subproblems
inferred← citeshttps://doi.org/10.1007/978-1-4419-8917-8_5openalex-snapshot
Exploiting Relaxations in CP
inferred← citeshttps://doi.org/10.1007/978-1-4471-0705-7_7openalex-snapshot
ISP’s Internet Backbone Augmentation using Virtual Link Configuration in Link-state Routing
inferred← citeshttps://doi.org/10.1007/978-1-4613-0301-5_2openalex-snapshot
Branch and Cut Methods for Mixed Integer Linear Programming Problems
inferred← citeshttps://doi.org/10.1007/978-3-030-00473-6_10openalex-snapshot
An Iterated Local Search Algorithm for the Pollution Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-21534-6_6openalex-snapshot
Recent Advances in Practical Data Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-00202-1_20openalex-snapshot
Minimum Cuts of Simple Graphs in Almost Always Linear Time
inferred← citeshttps://doi.org/10.1007/978-3-642-23094-3_16openalex-snapshot
SlimCuts: GraphCuts for High Resolution Images Using Graph Reduction
inferred← citeshttps://doi.org/10.1007/978-3-642-79763-7_26openalex-snapshot
Bestimmung optimaler Einsatzpläne für Flugpersonal
inferred← citeshttps://doi.org/10.1007/bf01580084openalex-snapshot
Diagnosing infeasibilities in network flow problems
inferred← citeshttps://doi.org/10.1007/bf01580861openalex-snapshot
Facet identification for the symmetric traveling salesman polytope
inferred← citeshttps://doi.org/10.1007/bf01582226openalex-snapshot
Implementing an efficient minimum capacity cut algorithm
inferred← citeshttps://doi.org/10.1007/bf01585863openalex-snapshot
Minimizing symmetric submodular functions
inferred← citeshttps://doi.org/10.1007/bf01586932openalex-snapshot
Solution of large-scale symmetric travelling salesman problems
inferred← citeshttps://doi.org/10.1007/bf02023171openalex-snapshot
A distributed exact algorithm for the multiple resource constrained sequencing problem
inferred← citeshttps://doi.org/10.1007/bf02085634openalex-snapshot
A branch-and-cut algorithm for vehicle routing problems
inferred← citeshttps://doi.org/10.1007/bf02366865openalex-snapshot
Minimum cut problem using bases of extended polymatroids
inferred← citeshttps://doi.org/10.1007/pl00011432openalex-snapshot
Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut
inferred← citeshttps://doi.org/10.1007/s00224-007-2010-2openalex-snapshot
A Simple and Fast Min-Cut Algorithm
inferred← citeshttps://doi.org/10.1007/s004539910009openalex-snapshot
Practical Performance of Efficient Minimum Cut Algorithms
inferred← citeshttps://doi.org/10.1007/s10100-016-0437-8openalex-snapshot
Generating subtour elimination constraints for the TSP from pure integer solutions
inferred← citeshttps://doi.org/10.1007/s10107-003-0440-4openalex-snapshot
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
inferred← citeshttps://doi.org/10.1007/s101070100275openalex-snapshot
Efficient separation routines for the symmetric traveling salesman problem I: general tools and comb separation
inferred← citeshttps://doi.org/10.1007/s10288-012-0206-zopenalex-snapshot
Exact algorithms for different classes of vehicle routing problems
inferred← citeshttps://doi.org/10.1007/s10479-021-04210-0openalex-snapshot
On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms
inferred← citeshttps://doi.org/10.1007/s10878-024-01184-0openalex-snapshot
Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming
inferred← citeshttps://doi.org/10.1007/s13676-012-0010-0openalex-snapshot
Models and algorithms for the Asymmetric Traveling Salesman Problem: an experimental comparison
inferred← citeshttps://doi.org/10.1016/j.cor.2008.09.001openalex-snapshot
The traveling purchaser problem with budget constraint
inferred← citeshttps://doi.org/10.1016/j.cor.2011.01.011openalex-snapshot
A branch-and-cut algorithm for the minimum labeling Hamiltonian cycle problem and two variants
inferred← citeshttps://doi.org/10.1016/j.cor.2011.10.025openalex-snapshot
The Traveling Salesman Problem with Draft Limits
inferred← citeshttps://doi.org/10.1016/j.cor.2023.106482openalex-snapshot
Theoretical and computational analysis of a new formulation for the Rural Postman Problem and the General Routing Problem
inferred← citeshttps://doi.org/10.1016/j.dam.2011.06.030openalex-snapshot
Simplifying maximum flow computations: The effect of shrinking and good initial flows
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.07.030openalex-snapshot
A branch-and-cut framework for the consistent traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2019.11.046openalex-snapshot
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times
inferred← citeshttps://doi.org/10.1016/j.endm.2018.01.009openalex-snapshot
New Valid Inequalities for the Two-Echelon Capacitated Vehicle Routing Problem
inferred← citeshttps://doi.org/10.1016/j.orl.2006.12.010openalex-snapshot
Exact solutions to linear programming problems
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00349-3openalex-snapshot
Graph connectivity and its augmentation: applications of MA orderings
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00358-5openalex-snapshot
Cardinality constrained minimum cut problems: complexity and algorithms
inferred← citeshttps://doi.org/10.1016/s0305-0548(97)00079-8openalex-snapshot
Computational experience with a branch-and-cut algorithm for flowshop scheduling with setups
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00453-1openalex-snapshot
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
inferred← citeshttps://doi.org/10.1016/s0895-7177(00)00258-2openalex-snapshot
Branch and cut methods for network optimization
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80121-5openalex-snapshot
Chapter 4 The traveling salesman problem
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80019-2openalex-snapshot
Operations Research Methods in Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1017/9781316888568.003openalex-snapshot
Preliminaries: Shortest Path Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.005openalex-snapshot
Global Minimum Cut Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.006openalex-snapshot
More Maximum Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.007openalex-snapshot
Minimum-Cost Circulation Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.008openalex-snapshot
Generalized Flow Algorithms
inferred← citeshttps://doi.org/10.1017/9781316888568.009openalex-snapshot
Multicommodity Flow Algorithms
inferred← citeshttps://doi.org/10.1023/a:1008779125567openalex-snapshot
A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
inferred← citeshttps://doi.org/10.1080/01605682.2023.2253852openalex-snapshot
Operational Research: methods and applications
inferred← citeshttps://doi.org/10.1080/02331934.2020.1847110openalex-snapshot
TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration
inferred← citeshttps://doi.org/10.1080/15427951.2004.10129093openalex-snapshot
Graph Clustering and Minimum Cut Trees
inferred← citeshttps://doi.org/10.1080/24725854.2017.1374580openalex-snapshot
Solving the single and multiple asymmetric Traveling Salesmen Problems by generating subtour elimination constraints from integer solutions
inferred← citeshttps://doi.org/10.1109/cvpr.2019.00625openalex-snapshot
Combinatorial Persistency Criteria for Multicut and Max-Cut
inferred← citeshttps://doi.org/10.1109/ipdps.2019.00013openalex-snapshot
Shared-Memory Exact Minimum Cuts
inferred← citeshttps://doi.org/10.1109/rams.2006.1677388openalex-snapshot
Enhancing ISP network reliability with multi-criteria decision framework and genetic algorithm
inferred← citeshttps://doi.org/10.1109/rusautocon54946.2022.9896275openalex-snapshot
Analysis of the Effectiveness of a New Composite Method Joining Features of Implicit and Modular Enumeration Algorithms
inferred← citeshttps://doi.org/10.1111/itor.12991openalex-snapshot
A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
inferred← citeshttps://doi.org/10.1111/itor.70092openalex-snapshot
Branch‐and‐cut algorithms for the traveling salesman problem with job times
inferred← citeshttps://doi.org/10.1137/0803002openalex-snapshot
A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing)
inferred← citeshttps://doi.org/10.1137/1.9781611976007.4openalex-snapshot
Shared-Memory Branch-and-Reduce for Multiterminal Cuts
inferred← citeshttps://doi.org/10.1137/1033004openalex-snapshot
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
inferred← citeshttps://doi.org/10.1137/s0097539794273083openalex-snapshot
An $\NC$ Algorithm for Minimum Cuts
inferred← citeshttps://doi.org/10.1145/167088.167281openalex-snapshot
An Õ(n 2 ) algorithm for minimum cuts
inferred← citeshttps://doi.org/10.1145/195058.195241openalex-snapshot
Derandomization through approximation
inferred← citeshttps://doi.org/10.1145/234533.234534openalex-snapshot
A new approach to the minimum cut problem
inferred← citeshttps://doi.org/10.1145/237814.237829openalex-snapshot
Minimum cuts in near-linear time
inferred← citeshttps://doi.org/10.1145/331605.331608openalex-snapshot
Minimum cuts in near-linear time
inferred← citeshttps://doi.org/10.1145/3564822openalex-snapshot
Engineering Nearly Linear-time Algorithms for Small Vertex Connectivity
inferred← citeshttps://doi.org/10.1145/544397.544408openalex-snapshot
Graph cutting algorithms for distributed applications partitioning
inferred← citeshttps://doi.org/10.1201/9781420039597-9openalex-snapshot
Decomposition in Integer Linear Programming
inferred← citeshttps://doi.org/10.1201/9781420039597.ch4openalex-snapshot
Decomposition in Integer Linear Programming
inferred← citeshttps://doi.org/10.1287/ijoc.14.4.387.2830openalex-snapshot
The Role of Integer Programming Techniques in Constraint Programming's Global Constraints
inferred← citeshttps://doi.org/10.1287/ijoc.14.4.403.2827openalex-snapshot
A Hybrid Exact Algorithm for the TSPTW
inferred← citeshttps://doi.org/10.1287/mnsc.35.11.1393openalex-snapshot
A Branch-and-Cut Approach to a Traveling Salesman Problem with Side Constraints
inferred← citeshttps://doi.org/10.1287/mnsc.39.6.657openalex-snapshot
Solving Airline Crew Scheduling Problems by Branch-and-Cut
inferred← citeshttps://doi.org/10.1287/mnsc.43.11.1520openalex-snapshot
A Polyhedral Approach to the Asymmetric Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1287/moor.22.2.257openalex-snapshot
Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
inferred← citeshttps://doi.org/10.1287/trsc.1030.0040openalex-snapshot
An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem
inferred← citeshttps://doi.org/10.1287/trsc.2015.0636openalex-snapshot
A Benders Decomposition Approach for the Symmetric TSP with Generalized Latency Arising in the Design of Semiflexible Transit Systems
inferred← citeshttps://doi.org/10.1287/trsc.30.3.181openalex-snapshot
Routing Trains Through Railway Stations: Model Formulation and Algorithms
inferred← citeshttps://doi.org/10.1287/trsc.36.2.250.565openalex-snapshot
A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
inferred← citeshttps://doi.org/10.4171/dms/1-3/62openalex-snapshot
On the solution of traveling salesman problems
inferred← citeshttps://doi.org/10.47749/t/unicamp.1999.211144openalex-snapshot
Algoritmos combinatorios para a logistica de distribuição
inferred← citeshttps://doi.org/10.48550/arxiv.2101.01072openalex-snapshot
Commuting with Autonomous Vehicles: A Branch and Cut Algorithm with Redundant Modeling
inferred← citeshttps://doi.org/10.48550/arxiv.2108.04566openalex-snapshot
Algorithm Engineering for Cut Problems
inferred← citeshttps://doi.org/10.5281/zenodo.188310openalex-snapshot
FIGURE 10 in New species of Cophixalus (Anura: Microhylidae) from Papua New Guinea
inferred← citeshttps://doi.org/10.6092/unibo/amsdottorato/339openalex-snapshot
LP-based heuristics for the Traveling Salesman Problem
inferred← citeshttps://doi.org/10.70675/22232f00zc154z4403z9ad9zb300629d8110openalex-snapshot
Une approche polyédrale pour le problème du double voyageur de commerce sous contraintes de piles et pour les ordres lexicographiques
showing the first 122 of 123 · page through all 123
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.