Algorithms for the Assignment and Transportation Problems
From MaRDI portal
Cited in
(only showing first 100 items - show all)- 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
- On the added value of bootstrap analysis for K-means clustering
- Vector copulas
- Minimum cost input/output design for large-scale linear structural systems
- Multilevel ensemble transform particle filtering
- Combining spot and futures markets: a hybrid market approach to dynamic spectrum access
- Prioritizing replenishments of the piece picking area
- 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
- Branch-and-bound with decomposition-based lower bounds for the traveling umpire problem
- 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
- 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
- Extension of Egervàry theorem on optimal solution of assignment problem: logical approach
- Community detection in temporal multilayer networks, with an application to correlation networks
- A clustering ensemble framework based on elite selection of weighted clusters
- 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
- A grid-based approach to formation reconfiguration for a class of robots with non-holonomic constraints
- Effective feature construction by maximum common subgraph sampling
- Geometry helps to compare persistence diagrams
- A seamless multilevel ensemble transform particle filter
- Max-Plus Algebraic Statistical Leverage Scores
- The random fractional matching problem
- Using local similarity measures to efficiently address approximate graph matching
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)
