On the public citation graph

A branch-and-cut algorithm for the equicut problem

0 signed · 74 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1970.tb01770.xopenalex-snapshot

An Efficient Heuristic Procedure for Partitioning Graphs

inferredcites →https://doi.org/10.1007/bf01580861openalex-snapshot

Facet identification for the symmetric traveling salesman polytope

inferredcites →https://doi.org/10.1007/bf01588778openalex-snapshot

The equipartition polytope. I: Formulations, dimension and basic facets

inferredcites →https://doi.org/10.1007/bf01588779openalex-snapshot

The equipartition polytope. II: Valid inequalities and facets

inferredcites →https://doi.org/10.1007/bf02592023openalex-snapshot

On the cut polytope

inferredcites →https://doi.org/10.1016/0166-218x(94)00151-3openalex-snapshot

Some new classes of facets for the equicut polytope

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/10556789408805564openalex-snapshot

A cutting plane algorithm for the max-cut problem

inferredcites →https://doi.org/10.1137/1033001openalex-snapshot

Inertia-Controlling Methods for General Quadratic Programming

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/48014.61051openalex-snapshot

A new approach to the maximum-flow problem

inferredcites →https://doi.org/10.1159/000273299openalex-snapshot

Der Saccus endolymphaticus bei Entzündungsprozessen

inferredcites →https://doi.org/10.1287/moor.7.1.67openalex-snapshot

Odd Minimum Cut-Sets and b -Matchings

inferredcites →https://doi.org/10.1287/opre.36.3.493openalex-snapshot

An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design

inferredcites →https://doi.org/10.2307/3008450openalex-snapshot

Integer Programming and Network Flows.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9781118600245.ch8openalex-snapshot

Quadratic Optimization in 0–1 Variables

inferred← citeshttps://doi.org/10.1002/9781119005216.biblioopenalex-snapshot

General Bibliography

inferred← citeshttps://doi.org/10.1002/9781119005216.ch8openalex-snapshot

Quadratic Optimization in 0–1 Variables

inferred← citeshttps://doi.org/10.1002/nav.10084openalex-snapshot

Realignment in the National Football League: Did they do it right?

inferred← citeshttps://doi.org/10.1007/3-540-44676-1_33openalex-snapshot

Lower Bounds and Exact Algorithms for the Graph Partitioning Problem Using Multicommodity Flows

inferred← citeshttps://doi.org/10.1007/978-1-4613-1361-8_23openalex-snapshot

A New Tabu Search Approach to the 0–1 Equicut Problem

inferred← citeshttps://doi.org/10.1007/978-3-030-68154-8_44openalex-snapshot

Branch Cut and Free Algorithm for the General Linear Integer Problem

inferred← citeshttps://doi.org/10.1007/978-3-319-00200-2_2openalex-snapshot

Engineering Branch-and-Cut Algorithms for the Equicut Problem

inferred← citeshttps://doi.org/10.1007/978-3-319-49487-6_4openalex-snapshot

Recent Advances in Graph Partitioning

inferred← citeshttps://doi.org/10.1007/978-3-540-39658-1_67openalex-snapshot

Multicommodity Flow Approximation Used for Exact Graph Partitioning

inferred← citeshttps://doi.org/10.1007/978-3-642-33090-2_36openalex-snapshot

Better Bounds for Graph Bisection

inferred← citeshttps://doi.org/10.1007/978-3-642-38189-8_15openalex-snapshot

Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method

inferred← citeshttps://doi.org/10.1007/s10107-011-0503-xopenalex-snapshot

An exact algorithm for graph partitioning

inferred← citeshttps://doi.org/10.1007/s10107-014-0811-zopenalex-snapshot

An exact combinatorial algorithm for minimum graph bisection

inferred← citeshttps://doi.org/10.1007/s10472-005-9001-2openalex-snapshot

Finding optimal solutions to the graph partitioning problem with heuristic search

inferred← citeshttps://doi.org/10.1007/s10732-023-09521-yopenalex-snapshot

DSLS: a simple and efficient local search algorithm for the maximum bisection problem

inferred← citeshttps://doi.org/10.1007/s10878-011-9406-2openalex-snapshot

A branch-and-bound algorithm for the minimum cut linear arrangement problem

inferred← citeshttps://doi.org/10.1007/s12190-025-02528-7openalex-snapshot

Multi-constraint graph partitioning problems via recursive bipartition algorithm based on subspace minimization conjugate gradient method

inferred← citeshttps://doi.org/10.1007/s12532-023-00249-1openalex-snapshot

CP-Lib: Benchmark Instances of the Clique Partitioning Problem

inferred← citeshttps://doi.org/10.1007/s13198-021-01232-6openalex-snapshot

Reducing the complexity of the knapsack linear integer problem by reformulation techniques

inferred← citeshttps://doi.org/10.1016/j.asoc.2024.112109openalex-snapshot

Solving continuous quadratic programming for the discrete balanced graph partitioning problem using simulated annealing algorithm hybridized local search and multi-start algorithms

inferred← citeshttps://doi.org/10.1016/j.comnet.2022.108795openalex-snapshot

Toward scalable graph-based security analysis for cloud networks

inferred← citeshttps://doi.org/10.1016/j.cor.2016.12.012openalex-snapshot

An effective iterated tabu search for the maximum bisection problem

inferred← citeshttps://doi.org/10.1016/j.cor.2017.05.016openalex-snapshot

An exact algorithm for Min-Max hyperstructure equipartition with a connected constraint

inferred← citeshttps://doi.org/10.1016/j.cor.2022.106088openalex-snapshot

Partitioning through projections: Strong SDP bounds for large graph partition problems

inferred← citeshttps://doi.org/10.1016/j.dam.2007.12.007openalex-snapshot

Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method

inferred← citeshttps://doi.org/10.1016/j.disc.2011.01.018openalex-snapshot

From equipartition to uniform cut polytopes: Extended polyhedral results

inferred← citeshttps://doi.org/10.1016/j.disc.2022.112884openalex-snapshot

An overview of graph covering and partitioning

inferred← citeshttps://doi.org/10.1016/j.disopt.2006.08.001openalex-snapshot

Facet-defining inequalities for the simple graph partitioning polytope

inferred← citeshttps://doi.org/10.1016/j.engappai.2024.109819openalex-snapshot

REINFORCE with Bound-guided Gradient Estimator for the traveling salesman problem toward scale generalization

inferred← citeshttps://doi.org/10.1016/j.trc.2020.02.008openalex-snapshot

Trip-based graph partitioning in dynamic ridesharing

inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00287-7openalex-snapshot

Solution of large weighted equicut problems

inferred← citeshttps://doi.org/10.1016/s0895-7177(03)90134-8openalex-snapshot

Performance of a genetic algorithm for the graph partitioning problem

inferred← citeshttps://doi.org/10.1049/ell2.70674openalex-snapshot

An Efficient Iterated Greedy Algorithm for the Maximum Bisection Problem

inferred← citeshttps://doi.org/10.1080/23311835.2016.1162372openalex-snapshot

Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm

inferred← citeshttps://doi.org/10.1109/cisp-bmei.2016.7853034openalex-snapshot

Parallel subgraph matching on massive graphs

inferred← citeshttps://doi.org/10.1109/icde53745.2022.00219openalex-snapshot

Personalized Graph Summarization: Formulation, Scalable Algorithms, and Applications

inferred← citeshttps://doi.org/10.1109/rtsi.2016.7740568openalex-snapshot

Dynamic optimisation of price arbitrage techniques

inferred← citeshttps://doi.org/10.1109/tc.2013.7openalex-snapshot

An Efficient Memetic Algorithm for theMax-Bisection Problem

inferred← citeshttps://doi.org/10.1109/tnsm.2016.2628894openalex-snapshot

Nodes Migration Scheduling of Access Networks

inferred← citeshttps://doi.org/10.1109/tsg.2012.2227513openalex-snapshot

Optimized Thermal and Electrical Scheduling of a Large Scale Virtual Power Plant in the Presence of Energy Storages

inferred← citeshttps://doi.org/10.1111/1467-9574.00104openalex-snapshot

Polyhedral techniques in combinatorial optimization II: applications and computations

inferred← citeshttps://doi.org/10.1134/s1064230706040083openalex-snapshot

Models and methods for solving the problem of network vulnerability

inferred← citeshttps://doi.org/10.1137/1.9781611972924.3openalex-snapshot

Exact Combinatorial Branch-and-Bound for Graph Bisection

inferred← citeshttps://doi.org/10.1145/3394486.3403239openalex-snapshot

Prioritized Restreaming Algorithms for Balanced Graph Partitioning

inferred← citeshttps://doi.org/10.1145/3544779openalex-snapshot

Memetic Algorithms for Spatial Partitioning Problems

inferred← citeshttps://doi.org/10.1177/097324701000600301openalex-snapshot

Fifty Years of Integer Programming: A Review of the Solution Approaches

inferred← citeshttps://doi.org/10.1287/ijoc.12.3.177.12637openalex-snapshot

Solving Graph Bisection Problems with Semidefinite Programming

inferred← citeshttps://doi.org/10.15587/1729-4061.2020.198849openalex-snapshot

Improvement of the branch and bound algorithm for solving the knapsack linear integer problem

inferred← citeshttps://doi.org/10.15587/1729-4061.2020.211793openalex-snapshot

Development of an exact method for zero-one linear programming model

inferred← citeshttps://doi.org/10.3390/e22091026openalex-snapshot

Distributed Attack Modeling Approach Based on Process Mining and Graph Segmentation

inferred← citeshttps://doi.org/10.3934/naco.2015.5.151openalex-snapshot

Speeding up a memetic algorithm for the max-bisection problem

inferred← citeshttps://doi.org/10.4018/978-1-7998-3970-5.ch003openalex-snapshot

Improving the Optimality Verification and the Parallel Processing of the General Knapsack Linear Integer Problem

inferred← citeshttps://doi.org/10.48550/arxiv.1311.3144openalex-snapshot

Recent Advances in Graph Partitioning

inferred← citeshttps://doi.org/10.48550/arxiv.1506.07731openalex-snapshot

A multidimensional maximum bisection problem

inferred← citeshttps://doi.org/10.5445/ir/1000035713openalex-snapshot

High Quality Graph Partitioning

inferred← citeshttps://doi.org/10.70675/45eae187z1b63z42e2zbd78zb240e597c1d8openalex-snapshot

Revisiting Data Partitioning for Scalable RDF Graph Processing

inferred← citeshttps://doi.org/10.7282/t3sb4419openalex-snapshot

Two applications of combinatorial optimization

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.