Algorithms for the Assignment and Transportation Problems
From MaRDI portal
Publication:3255799
DOI10.1137/0105003zbMath0083.15302OpenAlexW2141461755MaRDI QIDQ3255799
Publication date: 1957
Published in: Journal of the Society for Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0105003
Related Items
Distribution-Free Consistent Independence Tests via Center-Outward Ranks and Signs, Graph-Based Equilibrium Metrics for Dynamic Supply–Demand Systems With Applications to Ride-sourcing Platforms, Maximum and optimal 1-2 matching problem of the different kind, Index Matrices as a Cost Optimization Tool of Resource Provisioning in Uncertain Cloud Computing Environment, Scalable Inference for Hybrid Bayesian Hidden Markov Model Using Gaussian Process Emission, Generalized XOR non-locality games with graph description on a square lattice, Community Detection in Temporal Multilayer Networks, with an Application to Correlation Networks, A METRIC PROCEDURE FOR CARDINAL PREFERENCES, Unnamed Item, Duale transportoptimierung, Geometry Helps to Compare Persistence Diagrams, The balanced maximally diverse grouping problem with attribute values, Multi-view graph embedding clustering network: joint self-supervision and block diagonal representation, The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph, Multiplicative auction algorithm for approximate maximum weight bipartite matching, Routing electric vehicles with a single recharge per route, Relative multiplexing for minimising switching in linear-optical quantum computing, Multi-league sports scheduling with different leagues sizes, Multivariate Rank-Based Distribution-Free Nonparametric Testing Using Measure Transportation, A Seamless Multilevel Ensemble Transform Particle Filter, A branch-and-bound approach for a vehicle routing problem with customer costs, Max-Plus Algebraic Statistical Leverage Scores, Hybridizations of evolutionary algorithms with large neighborhood search, Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages, Two notions of social capital, Approximation algorithms for fair \(k\)-median problem without fairness violation, Optimal transport methods for combinatorial optimization over two random point sets, Nonstationary fuzzy neural network based on fcmnet clustering and a modified CG method with Armijo-type rule, Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching, Utility/privacy trade-off as regularized optimal transport, On the Stability of Multigraded Betti Numbers and Hilbert Functions, ESTIMATING AND ENHANCING THE FEEDBACKABILITY OF COMPLEX NETWORKS, A Privacy-Preserving Method to Optimize Distributed Resource Allocation, Unnamed Item, A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique, Correlation function for the Grid-Poisson Euclidean matching on a line and on a circle, Some Results on Sparse Matrices, ASSIGNMENT QUERY AND ITS IMPLEMENTATION IN MOVING OBJECT DATABASES, POSTURE INVARIANT CORRESPONDENCE OF INCOMPLETE TRIANGULAR MANIFOLDS, A contribution to quadratic assignment problems, The random fractional matching problem, An algorithm for then×n optimum assignment problem, Constrained overlapping clusters: minimizing the negative effects of bridge‐nodes, Harmonic stability of standing water waves, Rössler-network with time delay: Univariate impulse pinning synchronization, Relabelling algorithms for mixture models with applications for large data sets, Efficient Suboptimal Graph Isomorphism, Closing Gaps in Asymptotic Fair Division, Multilevel Artificial Neural Network Training for Spatially Correlated Learning, Scalable Semidefinite Programming, Unnamed Item, A Scalable Approach to Compute Delay Margin of a Class of Neutral-Type Time Delay Systems, Unnamed Item, Incremental Processing Applied to Munkres’ Algorithm and Its Application in Steinberg’s Placement Procedure, On the added value of bootstrap analysis for \(K\)-means clustering, Minimum cost input/output design for large-scale linear structural systems, Construction of approximate entropy measure-valued solutions for hyperbolic systems of conservation laws, Analysis of ground state in random bipartite matching, Detecting almost symmetries of graphs, Profit maximization for competitive social advertising, Satisfied two-sided matching: a method considering elation and disappointment of agents, Prioritizing replenishments of the piece picking area, The optimal tenement allocation for reducing traffic burden, Index Reduction via Unimodular Transformations, Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking, Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem, Jacobi's bound for a diffiety defined by a quasi-regular system, Linear-Time Approximation for Maximum Weight Matching, From the bankruptcy problem and its concede-and-divide solution to the assignment problem and its fair division solution, Massively parallel augmenting path algorithms for the assignment problem, Incremental assignment problem, A clustering ensemble framework based on elite selection of weighted clusters, 3D model comparison using spatial structure circular descriptor, Computing the sequence of \(k\)-cardinality assignments, Extending hypothesis testing with persistent homology to three or more groups, GM-PHD filter combined with track-estimate association and numerical interpolation, A framework for deep constrained clustering, Fast similarity search for graphs by edit distance, Optimal role and position assignment in multi-robot freely reachable formations, Approximation of graph edit distance based on Hausdorff matching, A grid-based approach to formation reconfiguration for a class of robots with non-holonomic constraints, Optimization methods for the train unit shunting problem, Maximum travelling salesman problem. I, The complexity and on-line algorithm for automated storage and retrieval system with stacker cranes on one rail, Effective feature construction by maximum common subgraph sampling, Distribution functions, extremal limits and optimal transport, Auction dynamics: a volume constrained MBO scheme, Comparative statics in markets for indivisible goods, Inventory-based dispatching of automated guided vehicles on container terminals, Optimal relay assignment and power allocation for cooperative communications, Vector copulas, The graph matching problem, Multi-machine scheduling with interval constrained position-dependent processing times, Multiobjective optimization for a wireless ad hoc sensor distribution on shaped-bounded areas, Multiframe many-many point correspondence for vehicle tracking in high density wide area aerial videos, 2CoBel: a scalable belief function representation for 2D discernment frames, Exploiting partial correlations in distributionally robust optimization, The unit acquisition number of a graph, Randomized near-neighbor graphs, giant components and applications in data science, A local branching heuristic for solving a graph edit distance problem, Approximation of Graph Edit Distance in Quadratic Time, On the Influence of Node Centralities on Graph Edit Distance for Graph Classification, The stable marriage problem: an interdisciplinary review from the physicist's perspective, Natalie 2.0: sparse global network alignment as a special case of quadratic assignment, Ellipse Constraints for Improved Wide-Baseline Feature Matching and Reconstruction, Using local similarity measures to efficiently address approximate graph matching, On searching and indexing sequences of temporal intervals, Coloring invariants of knots and links are often intractable, Critical objective function values in linear sum assignment problems, Solving an integrated scheduling and routing problem with inventory, routing and penalty costs, Finding efficient make-to-order production and batch delivery schedules, Cluster ensembles: a survey of approaches with recent extensions and applications, Location of facility based on simulated annealing and ``ZKW algorithms, Composability and controllability of structural linear time-invariant systems: distributed verification, A polynomial-time maximum common subgraph algorithm for outerplanar graphs and its application to chemoinformatics, A genuinely polynomial primal simplex algorithm for the assignment problem, Collaborative vehicle routing: a survey, Approximation algorithms for the max-buying problem with limited supply, Privacy by diversity in sequential releases of databases, An efficient simple metaheuristic for minimizing the makespan in two-machine no-wait job shops, A flexible cluster-oriented alternative clustering algorithm for choosing from the Pareto front of solutions, Local ratio with negative weights., Scheduling two-machine no-wait open shops to minimize makespan, Fast algorithms for placing large entries along the diagonal of a sparse matrix, A new implementation of an algorithm for the optimal assignment problem: An improved version of Munkres' algorithm, A Fast ℒp Spike Alignment Metric, Regularized optimization with spatial coupling for robust decision making, Approximation algorithms for the bus evacuation problem, The balanced maximally diverse grouping problem with block constraints, Uncertain programming model for uncertain optimal assignment problem, A geometrical interpretation of the Hungarian method, Optimization of the distribution and localization of wireless sensor networks based on differential evolution approach, Heuristics for the mixed swapping problem, Simplified target assignment problem for group engagement of aircraft, Multilevel Ensemble Transform Particle Filtering, Fréchet means for distributions of persistence diagrams, Loading tow trains ergonomically for just-in-time part supply, Optimal assignments with supervisions, Algorithms in unnormalized arithmetic. III: Matrix inversion, A priority based unbalanced time minimization assignment problem, Combining Spot and Futures Markets: A Hybrid Market Approach to Dynamic Spectrum Access, Almost mutually best in matching markets: rank gaps and size of the core, Learning subtree pattern importance for Weisfeiler-Lehman based graph kernels, Maximum weight bipartite matching in matrix multiplication time, Unsupervised human activity analysis for intelligent mobile robots, Computing in combinatorial optimization, Deep learning observables in computational fluid dynamics, Lower bounds for the axial three-index assignment problem, A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method, A clustering ensemble framework based on selection of fuzzy weighted clusters in a locally adaptive clustering algorithm, The hypergraph assignment problem, EmbAssi: embedding assignment costs for similarity search in large graph databases, A case of non-convergent dual changes in assignment problems, Probabilistic Fréchet means for time varying persistence diagrams
