A shortest augmenting path algorithm for dense and sparse linear assignment problems
From MaRDI portal
Publication:1085784
DOI10.1007/BF02278710zbMath0607.90056WikidataQ60468438 ScholiaQ60468438MaRDI QIDQ1085784
Publication date: 1987
Published in: Computing (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Graph theory (including graph drawing) in computer science (68R10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Solving the \(k\)-cardinality assignment problem by transformation, Statistical shape analysis of simplified neuronal trees, An efficient heuristic for the expansion problem of cellular wireless networks, Towards auction algorithms for large dense assignment problems, Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics, Point of presence design in internet protocol networks with performance guarantees, Simple and efficient heuristic approach for the multiple-depot vehicle scheduling problem, An assignment-based lower bound for a class of two-machine flow shop problems, Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties, Automatic planning of 3G UMTS all-IP release 4 networks with realistic traffic, ENHANCED HIERARCHICAL SHAPE MATCHING FOR SHAPE TRANSFORMATION, The \(k\)-cardinality assignment problem, Massively parallel augmenting path algorithms for the assignment problem, The singly constrained assignment problem: An AP basis algorithm, Unnamed Item, Dual coordinate step methods for linear network flow problems, The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems, An efficient cost scaling algorithm for the assignment problem, On the Hamming distance in combinatorial optimization problems on hypergraph matchings, Approximation of graph edit distance based on Hausdorff matching, Rate optimal Chernoff bound and application to community detection in the stochastic block models, Improving bipartite graph edit distance approximation using various search strategies, On scheduling a single machine with resource dependent release times, Distributionally robust scheduling algorithms for total flow time minimization on parallel machines using norm regularizations, An Energy-Based, Always Index $\leq$ 1 and Structurally Amenable Electrical Circuit Model, A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM, Matching samples of multiple views, Kronecker product graph matching., Motion tracking as a constrained optimization problem., A New Approximative Algorithm for the Expansion Problem of 3G Networks, Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure, Polynomial-Time Algorithms for Continuous Metrics on Atomic Clouds of Unordered Points, Mass transportation and the consistency of the empirical optimal conditional locations, Solving the rectangular assignment problem and applications, Exact and heuristic algorithms for the interval data robust assignment problem, A branch-and-bound algorithm for the singly constrained assignment problem, A note on the assignment problem with seniority and job priority constraints., The auction algorithm for the transportation problem, Robust spotter scheduling in trailer yards, Algorithms and codes for dense assignment problems: The state of the art, Large neighborhood improvements for solving car sequencing problems, On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem, Topology-aware strategy for MPI-IO operations in clusters, Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics, 2CoBel: a scalable belief function representation for 2D discernment frames, Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times, On the Influence of Node Centralities on Graph Edit Distance for Graph Classification, Exact solution of emerging quadratic assignment problems, Efficient index reduction algorithm for large scale systems of differential algebraic equations, Mallows and generalized Mallows model for matchings, Correspondence of projected 3-D points and lines using a continuous GRASP, Some assignment problems arising from multiple target tracking, A genuinely polynomial primal simplex algorithm for the assignment problem, Collaborative assignment using belief-desire-intention agent modeling and negotiation with speedup strategies, Auction algorithms for network flow problems: A tutorial introduction, An algorithm for ranking assignments using reoptimization, A branch-and-bound algorithm for assembly line worker assignment and balancing problems, A ranked linear assignment approach to Bayesian classification, A novel convex dual approach to three-dimensional assignment problem: theoretical analysis, Comparison and Bayesian Estimation of Feature Allocations, AN ASSIGNMENT-BASED LOCAL SEARCH METHOD FOR SOLVING VEHICLE ROUTING PROBLEMS, Minimizing total flow time on a single flexible machine, Hybrid symbiotic genetic optimisation for robust edge-based stereo correspondence, Random assignment problems on \(2d\) manifolds, Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726], Weakly paired multimodal fusion using multilayer extreme learning machine, Numerical resolution of an “unbalanced” mass transport problem, A comparison of two algorithms for the assignment problem, The random fractional matching problem, New Rollout Algorithms for Combinatorial Optimization Problems, A dual approach to multi-dimensional assignment problems, Harmonic stability of standing water waves, Tolerance-Based vs. Cost-Based Branching for the Asymmetric Capacitated Vehicle Routing Problem, A data parallel augmenting path algorithm for the dense linear many-to-one assignment problem, Speeding up the Hungarian algorithm, On the number ofk-cycles in the assignment problem for random matrices, Efficient cubature rules, Linear and semi-assignment problems: A core oriented approach, Scalable Semidefinite Programming, Solving the minmax product rate variation problem (PRVP) as a bottleneck assignment problem, Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order, Constrained weighted matchings and edge coverings in graphs, Solving differential-algebraic equations by Taylor series. I: Computing Taylor coefficients, Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking, DAESA—A Matlab Tool for Structural Analysis of Differential-Algebraic Equations, Linear assignment procedures
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- An efficient algorithm for the bipartite matching problem
- An efficient labeling technique for solving sparse assignment problems
- Improving the Hungarian assignment algorithm
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Algorithm for the solution of the assignment problem for sparse matrices
- An algorithm for the assignment problem
- Efficient dual simplex algorithms for the assignment problem
- A New Polynomially Bounded Shortest Path Algorithm
- Signature Methods for the Assignment Problem
- New Polynomial Shortest Path Algorithms and Their Computational Attributes
- An in-core/out-of-core method for solving large scale assignment problems
- An algorithm to solve them ×n assignment problem in expected timeO(mn logn)
- Solving the Assignment Problem by Relaxation
- Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
- A new algorithm for the assignment problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- The alternating basis algorithm for assignment problems
- Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem
- On some techniques useful for solution of transportation network problems
