Algorithms for the Assignment and Transportation Problems

Cited in

(only showing first 100 items - show all)

Some Results on Sparse Matrices
Optimization of the distribution and localization of wireless sensor networks based on differential evolution approach
A metric procedure for cardinal preferences
Unsupervised human activity analysis for intelligent mobile robots
Multiplicative auction algorithm for approximate maximum weight bipartite matching
Uncertain programming model for uncertain optimal assignment problem
A dynamic unsupervised feature selection method based on information sets and fuzzy rough sets
A scalable approach to compute delay margin of a class of neutral-type time delay systems
Finding efficient make-to-order production and batch delivery schedules
Local ratio with negative weights.
Natalie 2.0: sparse global network alignment as a special case of quadratic assignment
Two notions of social capital
Profit maximization for competitive social advertising
A geometrical interpretation of the Hungarian method
Multiplicative auction algorithm for approximate maximum weight bipartite matching
The unit acquisition number of a graph
Fast computation of optimal transport via entropy-regularized extragradient methods
The hypergraph assignment problem
On the added value of bootstrap analysis for K-means clustering
Minimum cost input/output design for large-scale linear structural systems
Solving an integrated scheduling and routing problem with inventory, routing and penalty costs
Constrained overlapping clusters: minimizing the negative effects of bridge‐nodes
Index matrices as a cost optimization tool of resource provisioning in uncertain cloud computing environment
On combinatorial network flows algorithms and circuit augmentation for pseudoflows
Harmonic stability of standing water waves
A local branching heuristic for solving a graph edit distance problem
Correlation function for the grid-Poisson Euclidean matching on a line and on a circle
Effective feature construction by maximum common subgraph sampling
Simplified target assignment problem for group engagement of aircraft
Solution approaches to the three-index assignment problem
Lower bounds for the axial three-index assignment problem
Location of facility based on simulated annealing and ``ZKW algorithms
Multilevel Artificial Neural Network Training for Spatially Correlated Learning
The balanced maximally diverse grouping problem with attribute values
Exploiting partial correlations in distributionally robust optimization
Fast algorithms for placing large entries along the diagonal of a sparse matrix
On searching and indexing sequences of temporal intervals
Analysis of ground state in random bipartite matching
Critical objective function values in linear sum assignment problems
The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph
Comparative statics in markets for indivisible goods
An algorithm for flexible transshipments with perfect synchronization
Relabelling algorithms for mixture models with applications for large data sets
Multivariate Rank-Based Distribution-Free Nonparametric Testing Using Measure Transportation
Randomized near-neighbor graphs, giant components and applications in data science
Satisfied two-sided matching: a method considering elation and disappointment of agents
Hybridizations of evolutionary algorithms with large neighborhood search
Approximation algorithms for the max-buying problem with limited supply
Maximum weight bipartite matching in matrix multiplication time
The optimal tenement allocation for reducing traffic burden
Incremental assignment problem
Regularized optimization with spatial coupling for robust decision making
Approximation algorithms for the bus evacuation problem
Prioritizing replenishments of the piece picking area
Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem
Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages
3D model comparison using spatial structure circular descriptor
A seamless multilevel ensemble transform particle filter
Relative multiplexing for minimising switching in linear-optical quantum computing
Geometry helps to compare persistence diagrams
Extending hypothesis testing with persistent homology to three or more groups
A Graphics Processing Unit Algorithm to Solve the Quadratic Assignment Problem Using Level-2 Reformulation-Linearization Technique
A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method
Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking
Efficient Suboptimal Graph Isomorphism
An algorithm for then×n optimum assignment problem
Coarsened mixtures of hierarchical skew normal kernels for flow and mass cytometry analyses
Computing the sequence of \(k\)-cardinality assignments
Incremental Processing Applied to Munkres’ Algorithm and Its Application in Steinberg’s Placement Procedure
Multi-view graph embedding clustering network: joint self-supervision and block diagonal representation
scientific article; zbMATH DE number 7255037 (Why is no real title available?)
The balanced maximally diverse grouping problem with block constraints
Distribution functions, extremal limits and optimal transport
Scheduling two-machine no-wait open shops to minimize makespan
Heuristics for the mixed swapping problem
POSTURE INVARIANT CORRESPONDENCE OF INCOMPLETE TRIANGULAR MANIFOLDS
Index reduction via unimodular transformations
A clustering ensemble framework based on selection of fuzzy weighted clusters in a locally adaptive clustering algorithm
Extension of Egervàry theorem on optimal solution of assignment problem: logical approach
From the bankruptcy problem and its concede-and-divide solution to the assignment problem and its fair division solution
Cluster ensembles: a survey of approaches with recent extensions and applications
Linear-time approximation for maximum weight matching
Loading tow trains ergonomically for just-in-time part supply
Approximation algorithms for fair \(k\)-median problem without fairness violation
Generalized XOR non-locality games with graph description on a square lattice
Fast prediction of plasma instabilities with sparse-grid-accelerated optimized dynamic mode decomposition
On the influence of node centralities on graph edit distance for graph classification
Ellipse constraints for improved wide-baseline feature matching and reconstruction
A branch-and-bound approach for a vehicle routing problem with customer costs
A framework for deep constrained clustering
A geometrically informed permutation test for dependency in spatiotemporal patterns of protein species in microscopy images
A scaling algorithm for maximum weight matching in bipartite graphs
Multi-league sports scheduling with different leagues sizes
Collaborative vehicle routing: a survey
Construction of approximate entropy measure-valued solutions for hyperbolic systems of conservation laws
Dynamic topological data analysis of functional human brain networks
Composability and controllability of structural linear time-invariant systems: distributed verification
A Fast ℒ_p Spike Alignment Metric
Rössler-network with time delay: univariate impulse pinning synchronization
Closing gaps in asymptotic fair division

This page was built for publication: Algorithms for the Assignment and Transportation Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3255799)