On the public citation graph
Solving matching problems with linear programming
0 signed · 98 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.1002/nav.3800310107openalex-snapshot
A primal simplex variant for the maximum‐flow problem
inferredcites →https://doi.org/10.1002/net.3230130406openalex-snapshot
An analysis of alternative strategies for implementing matching algorithms
inferredcites →https://doi.org/10.1002/net.3230160102openalex-snapshot
Solving large‐scale matching problems efficiently: A new primal matching approach
inferredcites →https://doi.org/10.1007/978-0-8176-4842-8_26openalex-snapshot
Paths, Trees, and Flowers
inferredcites →https://doi.org/10.1007/978-3-642-51576-7openalex-snapshot
Assignment and Matching Problems: Solution Methods with FORTRAN-Programs
inferredcites →https://doi.org/10.1007/bf02579273openalex-snapshot
The ellipsoid method and its consequences in combinatorial optimization
inferredcites →https://doi.org/10.1007/bfb0121194openalex-snapshot
A primal algorithm for optimum matching
inferredcites →https://doi.org/10.1016/0020-0190(78)90016-9openalex-snapshot
An O(|V|3) algorithm for finding maximum flows in networks
inferredcites →https://doi.org/10.1016/0167-6377(81)90020-1openalex-snapshot
Weakly bipartite graphs and the Max-cut problem
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.1287/opre.32.6.1195openalex-snapshot
A Cutting Plane Algorithm for the Linear Ordering Problem
inferredcites →https://doi.org/10.4153/cjm-1957-024-0openalex-snapshot
A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem
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/net.20358openalex-snapshot
A branch‐and‐cut‐and‐price algorithm for vertex‐biconnectivity augmentation
inferred← citeshttps://doi.org/10.1002/net.3230160102openalex-snapshot
Solving large‐scale matching problems efficiently: A new primal matching approach
inferred← citeshttps://doi.org/10.1002/net.3230190406openalex-snapshot
A new algorithm for general matching problems using network flow subproblems
inferred← citeshttps://doi.org/10.1002/net.3230190510openalex-snapshot
The path set polytope of an acyclic, directed graph with an application to machine sequencing
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_216openalex-snapshot
Branch and price: Integer programming with column generation; Decomposition techniques for MILP: Lagrangian relaxation; Integer linear complementary problem; Integer programming; Integer programming: Algebraic methods; Integer programming: Branch and bound methods; Integer programming: Branch and…
inferred← citeshttps://doi.org/10.1007/0-387-32942-0_4openalex-snapshot
Modelling for Feasibility - the Case of Mutually Orthogonal Latin Squares Problem
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-48518-x_2openalex-snapshot
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_288openalex-snapshot
Integer Programming: Cutting Plane Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4613-3449-1_11openalex-snapshot
Interior Point Methods for Combinatorial Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-4495-1_3openalex-snapshot
Matching: Arc Routing and the Solution Connection
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-030-54621-2_18-1openalex-snapshot
Assignment and Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-82450-0_3openalex-snapshot
LP-Based Combinatorial Problem Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-87729-2_8openalex-snapshot
Auswahl von theoriebezogenen Veröffentlichungen
inferred← citeshttps://doi.org/10.1007/bf01293485openalex-snapshot
New primal and dual matching heuristics
inferred← citeshttps://doi.org/10.1007/bf01580861openalex-snapshot
Facet identification for the symmetric traveling salesman polytope
inferred← citeshttps://doi.org/10.1007/bf01580902openalex-snapshot
Solving combinatorial optimization problems using Karmarkar's algorithm
inferred← citeshttps://doi.org/10.1007/bf01581206openalex-snapshot
A cutting plane algorithm for the windy postman problem
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/bf01589097openalex-snapshot
A cutting plane algorithm for a clustering problem
inferred← citeshttps://doi.org/10.1007/bf01589110openalex-snapshot
Facets and algorithms for capacitated lot sizing
inferred← citeshttps://doi.org/10.1007/bf01594929openalex-snapshot
Solving (large scale) matching problems combinatorially
inferred← citeshttps://doi.org/10.1007/bf02085634openalex-snapshot
A branch-and-cut algorithm for vehicle routing problems
inferred← citeshttps://doi.org/10.1007/bf02206819openalex-snapshot
Solving real-world linear ordering problems using a primal-dual interior point cutting plane method
inferred← citeshttps://doi.org/10.1007/bf02239975openalex-snapshot
A cutting plane algorithm for minimum perfect 2-matchings
inferred← citeshttps://doi.org/10.1007/bf02568602openalex-snapshot
Combinatorial optimization and small polytopes
inferred← citeshttps://doi.org/10.1007/bfb0057526openalex-snapshot
Calculating exact ground states of spin glasses: A polyhedral approach
inferred← citeshttps://doi.org/10.1007/pl00011426openalex-snapshot
A cutting plane algorithm for the General Routing Problem
inferred← citeshttps://doi.org/10.1007/s00453-014-9945-xopenalex-snapshot
Fast Algorithms for the Undirected Negative Cost Cycle Detection Problem
inferred← citeshttps://doi.org/10.1007/s11750-022-00651-3openalex-snapshot
Constraint relaxation for the discrete ordered median problem
inferred← citeshttps://doi.org/10.1007/s12243-022-00907-wopenalex-snapshot
A bi-objective optimization model for segment routing traffic engineering
inferred← citeshttps://doi.org/10.1016/0166-218x(95)00045-sopenalex-snapshot
Cardinality-restricted chains and antichains in partially ordered sets
inferred← citeshttps://doi.org/10.1016/0167-6377(91)90003-8openalex-snapshot
A polyhedral approach to edge coloring
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50004-xopenalex-snapshot
10.1016/b978-044488002-4/50004-x
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.cortex.2013.11.005openalex-snapshot
Multiple fMRI system-level baseline connectivity is disrupted in patients with consciousness alterations
inferred← citeshttps://doi.org/10.1016/j.dam.2014.01.001openalex-snapshot
Ordered weighted average combinatorial optimization: Formulations and their properties
inferred← citeshttps://doi.org/10.1016/j.ejor.2016.07.026openalex-snapshot
The Hierarchical Mixed Rural Postman Problem: Polyhedral analysis and a branch-and-cut algorithm
inferred← citeshttps://doi.org/10.1016/s0927-0507(89)01007-8openalex-snapshot
Chapter VI Integer programming
inferred← citeshttps://doi.org/10.1017/s0962492919000035openalex-snapshot
Approximation algorithms in combinatorial scientific computing
inferred← citeshttps://doi.org/10.1023/b:joco.0000038916.51082.5eopenalex-snapshot
Even Cycles and Perfect Matching Problems with Side Constraints
inferred← citeshttps://doi.org/10.1051/ro/2014008openalex-snapshot
Integer programming approaches for minimum stabbing problems
inferred← citeshttps://doi.org/10.1080/17509653.2016.1269136openalex-snapshot
A new hybrid matheuristic optimization algorithm for solving design and network engineering problems
inferred← citeshttps://doi.org/10.1093/oso/9780198538561.003.0006openalex-snapshot
Interior point algorithms for integer programming
inferred← citeshttps://doi.org/10.1109/focs.2012.35openalex-snapshot
The Cutting Plane Method Is Polynomial for Perfect Matchings
inferred← citeshttps://doi.org/10.1109/iccv51070.2023.01814openalex-snapshot
EgoHumans: An Egocentric 3D Multi-Human Benchmark
inferred← citeshttps://doi.org/10.1109/rait.2018.8389077openalex-snapshot
Content matching problem in large scale network using weighted b-matching algorithm
inferred← citeshttps://doi.org/10.1109/sc.2016.65openalex-snapshot
Designing Scalable b-MATCHING Algorithms on Distributed Memory Multiprocessors by Approximation
inferred← citeshttps://doi.org/10.1109/tit.2017.2788038openalex-snapshot
Maximum Weight Matching Using Odd-Sized Cycles: Max-Product Belief Propagation and Half-Integrality
inferred← citeshttps://doi.org/10.1109/tvcg.2020.3030399openalex-snapshot
Zoomless Maps: External Labeling Methods for the Interactive Exploration of Dense Point Sets at a Fixed Map Scale
inferred← citeshttps://doi.org/10.1111/1467-9574.00104openalex-snapshot
Polyhedral techniques in combinatorial optimization II: applications and computations
inferred← citeshttps://doi.org/10.1111/itor.13363openalex-snapshot
The biobjective minimum‐cost perfect matching problem and Chinese postman problem
inferred← citeshttps://doi.org/10.1117/12.2211530openalex-snapshot
Automatic identification of resting state networks: an extended version of multiple template-matching
inferred← citeshttps://doi.org/10.1137/0803035openalex-snapshot
Reducing Matching to Polynomial Size Linear Programming
inferred← citeshttps://doi.org/10.1137/1034048openalex-snapshot
Path-Following Methods for Linear Programming
inferred← citeshttps://doi.org/10.1137/15m1026304openalex-snapshot
Efficient Approximation Algorithms for Weighted $b$-Matching
inferred← citeshttps://doi.org/10.1145/347792.347815openalex-snapshot
Implementing weighted b-matching algorithms
inferred← citeshttps://doi.org/10.1145/351827.384250openalex-snapshot
Implementing weighted b-matching algorithms
inferred← citeshttps://doi.org/10.1145/48014.48015openalex-snapshot
A new class of heuristic algorithms for weighted perfect matching
inferred← citeshttps://doi.org/10.1155/2011/143732openalex-snapshot
Solving the Minimum Label Spanning Tree Problem by Mathematical Programming Techniques
inferred← citeshttps://doi.org/10.11606/d.45.1992.tde-20210729-003034openalex-snapshot
Poliedros e clutters bloqueadores e antibloqueadores
inferred← citeshttps://doi.org/10.11606/d.45.2010.tde-20122010-123246openalex-snapshot
Comparação entre uma solução combinatória e um método de planos-de-corte para o problema do emparelhamento de peso máximo
inferred← citeshttps://doi.org/10.1287/ijoc.11.2.138openalex-snapshot
Computing Minimum-Weight Perfect Matchings
inferred← citeshttps://doi.org/10.1287/moor.2015.0714openalex-snapshot
The Cutting Plane Method is Polynomial for Perfect Matchings
inferred← citeshttps://doi.org/10.1287/opre.36.3.493openalex-snapshot
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
inferred← citeshttps://doi.org/10.1287/opre.48.5.671.12410openalex-snapshot
The Uncapacitated Facility Location Problem with Client Matching
inferred← citeshttps://doi.org/10.1287/opre.51.2.281.12790openalex-snapshot
On the Undirected Rural Postman Problem: Tight Bounds Based on a New Formulation
inferred← citeshttps://doi.org/10.24963/ijcai.2020/475openalex-snapshot
Learning to Accelerate Heuristic Searching for Large-Scale Maximum Weighted b-Matching Problems in Online Advertising
inferred← citeshttps://doi.org/10.26481/umamet.1995014openalex-snapshot
Polyhedral Techniques in Combinatorial Optimization
inferred← citeshttps://doi.org/10.33915/etd.312openalex-snapshot
On the Design, Analysis, and Implementation of Algorithms for Selected Problems in Graphs and Networks
inferred← citeshttps://doi.org/10.4018/978-1-5225-7335-7.ch017openalex-snapshot
Capacitated Graph Theoretical Algorithms for Wireless Sensor Networks Towards Internet of Things
inferred← citeshttps://doi.org/10.48550/arxiv.1306.1167openalex-snapshot
A Graphical Transformation for Belief Propagation: Maximum Weight Matchings and Odd-Sized Cycles
inferred← citeshttps://doi.org/10.48550/arxiv.1306.1426openalex-snapshot
A modeling framework for Ordered Weighted Average Combinatorial Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1509.06849openalex-snapshot
Minimum Weight Perfect Matching via Blossom Belief Propagation
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.