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