On the public citation graph

A cutting plane algorithm for minimum perfect 2-matchings

https://doi.org/10.1007/bf02239975
0 signed · 42 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.1007/bf01584376openalex-snapshot
Solving matching problems with linear programming
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1137/0109047openalex-snapshot
Multi-Terminal Network Flows
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.1287/moor.7.1.67openalex-snapshot
Odd Minimum Cut-Sets and b -Matchings
inferredcites →https://doi.org/10.6028/jres.069b.013openalex-snapshot
Maximum matching and a polyhedron with 0,1-vertices

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781119584445.refsopenalex-snapshot
References
inferred← citeshttps://doi.org/10.1002/net.21826openalex-snapshot
Integer programming formulations for minimum deficiency interval coloring
inferred← citeshttps://doi.org/10.1007/3-540-47867-1_8openalex-snapshot
Polynomial-Time Separation of Simple Comb Inequalities
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-1-4615-4495-1_7openalex-snapshot
Linear Programming Based Methods for Solving Arc Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-25960-2_15openalex-snapshot
A Faster Exact Separation Algorithm for Blossom Inequalities
inferred← citeshttps://doi.org/10.1007/978-3-662-12273-0_10openalex-snapshot
Combinatorial Optimization: An Introduction
inferred← citeshttps://doi.org/10.1007/bf01580861openalex-snapshot
Facet identification for the symmetric traveling salesman polytope
inferred← citeshttps://doi.org/10.1007/bf01585699openalex-snapshot
Euclidean semi-matchings of random samples
inferred← citeshttps://doi.org/10.1007/bf01586932openalex-snapshot
Solution of large-scale symmetric travelling salesman problems
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/s10107-020-01502-4openalex-snapshot
Separation routine and extended formulations for the stable set problem in claw-free graphs
inferred← citeshttps://doi.org/10.1007/s101070050102openalex-snapshot
A new bound for the ratio between the 2-matching problem and its linear programming relaxation
inferred← citeshttps://doi.org/10.1007/s10479-005-3453-yopenalex-snapshot
Classical Cuts for Mixed-Integer Programming and Branch-and-Cut
inferred← citeshttps://doi.org/10.1007/s10479-011-1024-yopenalex-snapshot
Multi-depot Multiple TSP: a polyhedral study and computational results
inferred← citeshttps://doi.org/10.1016/0167-6377(88)90077-6openalex-snapshot
A polynomial-time solution to Papadimitriou and Steiglitz's ‘traps’
inferred← citeshttps://doi.org/10.1016/0167-6377(95)00038-0openalex-snapshot
Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies
inferred← citeshttps://doi.org/10.1016/j.cie.2023.109238openalex-snapshot
The Profitable Single Truck and Trailer Routing Problem with Time Windows: Formulation, valid inequalities and branch-and-cut algorithms
inferred← citeshttps://doi.org/10.1016/j.cor.2007.07.002openalex-snapshot
Undirected postman problems with zigzagging option: A cutting-plane approach
inferred← citeshttps://doi.org/10.1016/j.dam.2014.09.008openalex-snapshot
On the transportation problem with market choice
inferred← citeshttps://doi.org/10.1016/j.disopt.2007.05.002openalex-snapshot
Exploiting planarity in separation routines for the symmetric traveling salesman problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2008.04.037openalex-snapshot
Solving the Prize-collecting Rural Postman Problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2025.01.015openalex-snapshot
Formulations and Branch-and-cut algorithms for the Period Travelling Salesman Problem
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80121-5openalex-snapshot
Chapter 4 The traveling salesman problem
inferred← citeshttps://doi.org/10.1023/a:1018995927636openalex-snapshot
New optimality cuts for a single‐vehicle stochastic routing problem
inferred← citeshttps://doi.org/10.1109/92.335014openalex-snapshot
Analyzing and exploiting the structure of the constraints in the ILP approach to the scheduling problem
inferred← citeshttps://doi.org/10.1109/92.924064openalex-snapshot
A partitioning algorithm for technoiogy-mapped designs on single-chip emulation systems
inferred← citeshttps://doi.org/10.1134/s0005117909110149openalex-snapshot
The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal 2-matching
inferred← citeshttps://doi.org/10.1137/060664793openalex-snapshot
Odd Minimum Cut Sets and b -Matchings Revisited
inferred← citeshttps://doi.org/10.1137/1.9781611973099.102openalex-snapshot
Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs
inferred← citeshttps://doi.org/10.11591/ijeecs.v15.i2.pp390-396openalex-snapshot
Heuristic Approaches to Solve Traveling Salesman Problem
inferred← citeshttps://doi.org/10.11591/tijee.v15i2.1554openalex-snapshot
Heuristic Approaches to Solve Traveling Salesman Problem
inferred← citeshttps://doi.org/10.1287/ijoo.2025.0078openalex-snapshot
The Dantzig–Fulkerson–Johnson TSP Formulation Is Easy to Solve for Few Subtour Constraints
inferred← citeshttps://doi.org/10.1287/trsc.1090.0270openalex-snapshot
The Clustered Prize-Collecting Arc Routing Problem
inferred← citeshttps://doi.org/10.1287/trsc.1110.0370openalex-snapshot
The Windy Clustered Prize-Collecting Arc-Routing Problem
inferred← citeshttps://doi.org/10.48550/arxiv.math/0607088openalex-snapshot
Odd minimum cut sets and b-matchings revisited
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.