On the public citation graph

A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems

0 signed · 90 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.1002/net.3230200306openalex-snapshot
An application of lagrangean decomposition to the resource‐constrained minimum weighted arborescence problem
inferredcites →https://doi.org/10.1007/11585978_12openalex-snapshot
Probabilistic Subgraph Matching Based on Convex Relaxation
inferredcites →https://doi.org/10.1007/978-1-4419-1153-7_1152openalex-snapshot
Quadratic Assignment Problem
inferredcites →https://doi.org/10.1007/978-1-4613-0303-9_27openalex-snapshot
The Quadratic Assignment Problem
inferredcites →https://doi.org/10.1007/978-3-319-10404-1_11openalex-snapshot
Active Graph Matching for Automatic Joint Segmentation and Annotation of C. elegans
inferredcites →https://doi.org/10.1007/978-3-642-15555-0_36openalex-snapshot
Reweighted Random Walks for Graph Matching
inferredcites →https://doi.org/10.1007/978-3-642-23094-3_3openalex-snapshot
Globally Optimal Image Partitioning by Multicuts
inferredcites →https://doi.org/10.1007/978-3-642-33712-3_56openalex-snapshot
Globally Optimal Closed-Surface Segmentation for Connectomics
inferredcites →https://doi.org/10.1007/978-3-642-33783-3_41openalex-snapshot
Fast Planar Correlation Clustering for Image Segmentation
inferredcites →https://doi.org/10.1007/978-3-642-39140-8_9openalex-snapshot
Break and Conquer: Efficient Correlation Clustering for Image Segmentation
inferredcites →https://doi.org/10.1007/bf01581239openalex-snapshot
The partition problem
inferredcites →https://doi.org/10.1007/bf02592954openalex-snapshot
Lagrangean decomposition: A model yielding stronger lagrangean bounds
inferredcites →https://doi.org/10.1007/s10559-011-9300-zopenalex-snapshot
Diffusion algorithms and structural recognition optimization problems
inferredcites →https://doi.org/10.1007/s11263-009-0275-4openalex-snapshot
The Pascal Visual Object Classes (VOC) Challenge
inferredcites →https://doi.org/10.1007/s11263-011-0442-2openalex-snapshot
Unsupervised Learning for Graph Matching
inferredcites →https://doi.org/10.1007/s11263-015-0809-xopenalex-snapshot
A Comparative Study of Modern Inference Techniques for Structured Discrete Energy Minimization Problems
inferredcites →https://doi.org/10.1016/0377-2217(88)90029-xopenalex-snapshot
A Lagrangean dual ascent algorithm for simple plant location problems
inferredcites →https://doi.org/10.1016/0377-2217(89)90213-0openalex-snapshot
An application-oriented guide for designing Lagrangean dual ascent algorithms
inferredcites →https://doi.org/10.1016/s0167-5060(08)70728-3openalex-snapshot
Sharp Lower Bounds and Efficient Algorithms for the Simple Plant Location Problem
inferredcites →https://doi.org/10.1051/ro/1987210403071openalex-snapshot
Lagrangean decomposition for integer programming : theory and applications
inferredcites →https://doi.org/10.1109/18.910585openalex-snapshot
On the optimality of solutions of the max-product belief-propagation algorithm in arbitrary graphs
inferredcites →https://doi.org/10.1109/34.491619openalex-snapshot
A graduated assignment algorithm for graph matching
inferredcites →https://doi.org/10.1109/34.969114openalex-snapshot
Fast approximate energy minimization via graph cuts
inferredcites →https://doi.org/10.1109/cvpr.2010.5540122openalex-snapshot
Covering trees and lower-bounds on quadratic assignment
inferredcites →https://doi.org/10.1109/cvpr.2011.5995652openalex-snapshot
A study of Nesterov's scheme for Lagrangian decomposition and MAP labeling
inferredcites →https://doi.org/10.1109/cvpr.2012.6247667openalex-snapshot
Factorized graph matching
inferredcites →https://doi.org/10.1109/cvpr.2012.6247863openalex-snapshot
A bundle approach to efficient MAP-inference by Lagrangian relaxation
inferredcites →https://doi.org/10.1109/cvpr.2014.17openalex-snapshot
Cut, Glue, & Cut: A Fast, Approximate Solver for Multicut Partitioning
inferredcites →https://doi.org/10.1109/cvpr.2015.7298973openalex-snapshot
Fusion moves for correlation clustering
inferredcites →https://doi.org/10.1109/cvpr.2016.135openalex-snapshot
Pairwise Matching through Max-Weight Bipartite Belief Propagation
inferredcites →https://doi.org/10.1109/cvpr.2017.530openalex-snapshot
A Message Passing Algorithm for the Minimum Cost Multicut Problem
inferredcites →https://doi.org/10.1109/cvpr.2017.747openalex-snapshot
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching
inferredcites →https://doi.org/10.1109/iccv.2005.20openalex-snapshot
A spectral technique for correspondence problems using pairwise constraints
inferredcites →https://doi.org/10.1109/iccv.2011.6126550openalex-snapshot
Probabilistic image segmentation with closedness constraints
inferredcites →https://doi.org/10.1109/iccv.2013.29openalex-snapshot
Higher Order Matching for Consistent Multiple Target Tracking
inferredcites →https://doi.org/10.1109/iccv.2015.204openalex-snapshot
Efficient Decomposition of Image and Mesh Graphs by Lifted Multicuts
inferredcites →https://doi.org/10.1109/icde.2009.43openalex-snapshot
Large-Scale Deduplication with Constraints Using Dedupalog
inferredcites →https://doi.org/10.1109/tac.2008.2007159openalex-snapshot
Application of a Smoothing Technique to Decomposition in Convex Optimization
inferredcites →https://doi.org/10.1109/tpami.2006.200openalex-snapshot
Convergent Tree-Reweighted Message Passing for Energy Minimization
inferredcites →https://doi.org/10.1109/tpami.2007.1036openalex-snapshot
A Linear Programming Approach to Max-Sum Problem: A Review
inferredcites →https://doi.org/10.1109/tpami.2009.134openalex-snapshot
Revisiting the Linear Programming Relaxation Approach to Gibbs Energy Minimization and Weighted Constraint Satisfaction
inferredcites →https://doi.org/10.1109/tpami.2009.143openalex-snapshot
Fusion Moves for Markov Random Field Optimization
inferredcites →https://doi.org/10.1109/tpami.2010.108openalex-snapshot
MRF Energy Minimization and Beyond via Dual Decomposition
inferredcites →https://doi.org/10.1109/tpami.2012.105openalex-snapshot
A Dual Decomposition Approach to Feature Correspondence
inferredcites →https://doi.org/10.1109/tpami.2014.2363465openalex-snapshot
A New Look at Reweighted Message Passing
inferredcites →https://doi.org/10.1109/tpami.2014.2363833openalex-snapshot
Marginal Consistency: Upper-Bounding Partition Functions over Commutative Semirings
inferredcites →https://doi.org/10.1137/1.9781611973075.24openalex-snapshot
Belief Propagation for Min-cost Network Flow: Convergence & Correctness
inferredcites →https://doi.org/10.1145/1217299.1217303openalex-snapshot
Clustering aggregation
inferredcites →https://doi.org/10.1145/1772690.1772776openalex-snapshot
Clustering query refinements by user intent
inferredcites →https://doi.org/10.1145/2623330.2623743openalex-snapshot
Correlation clustering in MapReduce
inferredcites →https://doi.org/10.1145/322217.322226openalex-snapshot
Database Location in Computer Networks
inferredcites →https://doi.org/10.1162/089120101753342653openalex-snapshot
A Machine Learning Approach to Coreference Resolution of Noun Phrases
inferredcites →https://doi.org/10.1287/mnsc.32.9.1095openalex-snapshot
A Multiplier Adjustment Method for the Generalized Assignment Problem
inferredcites →https://doi.org/10.1287/mnsc.36.6.674openalex-snapshot
Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
inferredcites →https://doi.org/10.1287/opre.37.4.658openalex-snapshot
Technical Note—An Improved Dual Based Algorithm for the Generalized Assignment Problem
inferredcites →https://doi.org/10.1561/2200000001openalex-snapshot
Graphical Models, Exponential Families, and Variational Inference
inferredcites →https://doi.org/10.1561/9781601981851openalex-snapshot
Graphical Models, Exponential Families, and Variational Inference
inferredcites →https://doi.org/10.1609/aaai.v29i1.9785openalex-snapshot
A Local Sparse Model for Matching Problem
inferredcites →https://doi.org/10.3115/1073083.1073102openalex-snapshot
Improving machine learning approaches to coreference resolution
inferredcites →https://doi.org/10.3115/1611638.1611641openalex-snapshot
Bounding and comparing methods for correlation clustering beyond ILP
inferredcites →https://doi.org/10.4324/9781003580447-17openalex-snapshot
Lagrangian Decomposition and Nonsmooth Optimization: Bundle Algorithm, Prox Iteration, Augmented Lagrangian
inferredcites →https://doi.org/10.48550/arxiv.0710.0013openalex-snapshot
Lagrangian Relaxation for MAP Estimation in Graphical Models
inferredcites →https://doi.org/10.48550/arxiv.1205.2625openalex-snapshot
Convergent message passing algorithms - a unifying view
inferredcites →https://doi.org/10.7551/mitpress/7503.003.0051openalex-snapshot
Using Combinatorial Optimization within Max-Product Belief Propagation

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-58604-1_25openalex-snapshot
Deep Graph Matching via Blackbox Differentiation of Combinatorial Solvers
inferred← citeshttps://doi.org/10.1007/s11263-020-01359-2openalex-snapshot
Image Matching from Handcrafted to Deep Features: A Survey
inferred← citeshttps://doi.org/10.1016/j.dam.2020.01.021openalex-snapshot
Sparse recovery with integrality constraints
inferred← citeshttps://doi.org/10.1016/j.inffus.2021.02.012openalex-snapshot
A review of multimodal image matching: Methods and applications
inferred← citeshttps://doi.org/10.1016/j.patcog.2019.03.021openalex-snapshot
Synchronisation of partial multi-matchings via non-negative factorisations
inferred← citeshttps://doi.org/10.1109/cvpr.2017.530openalex-snapshot
A Message Passing Algorithm for the Minimum Cost Multicut Problem
inferred← citeshttps://doi.org/10.1109/cvpr.2017.747openalex-snapshot
A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching
inferred← citeshttps://doi.org/10.1109/cvpr.2018.00453openalex-snapshot
DS: Tighter Lifting-Free Convex Relaxations for Quadratic Matching Problems
inferred← citeshttps://doi.org/10.1109/cvpr.2019.01140openalex-snapshot
MAP Inference via Block-Coordinate Frank-Wolfe Algorithm
inferred← citeshttps://doi.org/10.1109/cvpr.2019.01141openalex-snapshot
A Convex Relaxation for Multi-Graph Matching
inferred← citeshttps://doi.org/10.1109/cvpr42600.2020.00758openalex-snapshot
Relative Interior Rule in Block-Coordinate Descent
inferred← citeshttps://doi.org/10.1109/cvpr52688.2022.00802openalex-snapshot
RAMA: A Rapid Multicut Algorithm on GPU
inferred← citeshttps://doi.org/10.1109/cvpr52729.2023.01153openalex-snapshot
Solving Relaxations of MAP-MRF Problems: Combinatorial in-Face Frank-Wolfe Directions
inferred← citeshttps://doi.org/10.1109/icc64753.2024.10883697openalex-snapshot
A Distributed Algorithm for Assigning UAVs to Multiple Heterogeneous Positions of Interest
inferred← citeshttps://doi.org/10.1109/iccv48922.2021.00621openalex-snapshot
Fusion Moves for Graph Matching
inferred← citeshttps://doi.org/10.1109/iccv48922.2021.00627openalex-snapshot
Making Higher Order MOT Scalable: An Efficient Approximate Solver for Lifted Disjoint Paths
inferred← citeshttps://doi.org/10.1109/tip.2024.3357251openalex-snapshot
A Robust Framework for One-Shot Key Information Extraction via Deep Partial Graph Matching
inferred← citeshttps://doi.org/10.1145/3512527.3531369openalex-snapshot
Efficient Linear Attention for Fast and Accurate Keypoint Matching
inferred← citeshttps://doi.org/10.1613/jair.1.15604openalex-snapshot
Using Constraint Propagation to Bound Linear Programs
inferred← citeshttps://doi.org/10.48550/arxiv.1612.05441openalex-snapshot
A Message Passing Algorithm for the Minimum Cost Multicut Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1709.04989openalex-snapshot
On Coordinate Minimization of Convex Piecewise-Affine Functions
inferred← citeshttps://doi.org/10.48550/arxiv.2004.06375openalex-snapshot
A Primal-Dual Solver for Large-Scale Tracking-by-Assignment
inferred← citeshttps://doi.org/10.48550/arxiv.2009.00481openalex-snapshot
Efficient Message Passing for 0-1 ILPs with Binary Decision Diagrams
inferred← citeshttps://doi.org/10.48550/arxiv.2109.13967openalex-snapshot
One-shot Key Information Extraction from Document with Deep Partial Graph Matching
inferred← citeshttps://doi.org/10.70675/41aa9998z81c1z43e6za7edz0d1c22c2877fopenalex-snapshot
Development of normative and pathological model of cortical folding by machine learning on graphs
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.