Assignment Problems
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Discrete location and assignment (90B80) Integer programming (90C10) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cited in
(only showing first 100 items - show all)- Optimizing the marriage market: an application of the linear assignment model
- Heuristic algorithms for the multi-depot ring-star problem
- On the identifiability of Bayesian factor analytic models
- An algorithm to approximate the optimal expected inner product of two vectors with given marginals
- The \(k\)-cardinality assignment problem
- Nonlinear assignment problems. Algorithms and applications
- Order acceptance and due-date quotation in low machine rates
- Improved exact approaches for row layout problems with departments of equal length
- A population-based algorithm for solving linear assignment problems with two objectives
- Fast simulated annealing for single-row equidistant facility layout
- Extending single tolerances to set tolerances
- Improving bipartite graph edit distance approximation using various search strategies
- Computational aspects of assigning agents to a line
- The bilinear assignment problem: complexity and polynomially solvable special cases
- The multi-stripe travelling salesman problem
- On integer images of max-plus linear mappings
- Linear regression with sparsely permuted data
- Tropical principal component analysis and its application to phylogenetics
- A branch-and-bound algorithm for the minimum cost bipartite perfect matching problem with conflict pair constraints
- Critical objective function values in linear sum assignment problems
- A tropical isoperimetric inequality
- Improved Lagrangian bounds and heuristics for the generalized assignment problem
- Geometric versions of the three-dimensional assignment problem under general norms
- The constant objective value property for multidimensional assignment problems
- Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
- The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure
- A population background for nonparametric density-based clustering
- Maximum matchings of a digraph based on the largest geometric multiplicity
- Linear assignment problems in combinatorial optimization
- ROML: a robust feature correspondence approach for matching objects in a set of images
- The dominance assignment problem
- A look at the past and present of optimization - an editorial
- A tale of three eras: the discovery and rediscovery of the Hungarian method
- On weighting two criteria with a parameter in combinatorial optimization problems
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review
- Decomposition method for solving a three-index planar assignment problem
- A Bayesian mixture model for clustering circular data
- The hop-constrained minimum cost flow spanning tree problem with nonlinear costs: an ant colony optimization approach
- Distribution and quantile functions, ranks and signs in dimension \(d\): a measure transportation approach
- Flexible quantile contour estimation for multivariate functional data: beyond convexity
- Surrogate parametric metamodel based on optimal transport
- Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems
- Hybrid twins based on optimal transport
- Rank-based testing for semiparametric VAR models: a measure transportation approach
- A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness
- Zero-diffusion limit for aggregation equations over bounded domains
- The quadratic cycle cover problem: special cases and efficient bounds
- Robust spotter scheduling in trailer yards
- Optimal transport: discretization and algorithms
- Scheduling batches in flowshop with limited buffers in the shampoo industry
- A Davidson college multi-objective assignment problem: a case study
- A branch-and-bound algorithm for assembly line worker assignment and balancing problems
- A new algorithm for solving a special matching problem with a general form value function under constraints
- Multi-sided assignment games on \(m\)-partite graphs
- Handling fairness issues in time-relaxed tournaments with availability constraints
- On the computation of Wasserstein barycenters
- Polynomial convolutions in max-plus algebra
- Multi-dimensional vector assignment problems
- Well-solvable cases of the QAP with block-structured matrices
- A truck scheduling problem arising in intermodal container transportation
- Reducing ergonomic risks by job rotation scheduling
- Network models and biproportional rounding for fair seat allocations in the UK elections
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem
- Task assignment in tree-like hierarchical structures
- Solving the rectangular assignment problem and applications
- On the vertices of the d-dimensional Birkhoff polytope
- Tropical bounds for eigenvalues of matrices
- Expert judgments in the cost-effectiveness analysis of resource allocations: a case study in military planning
- Upper and lower bounding procedures for the multiple knapsack assignment problem
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- The focus of attention problem
- Discrete optimal transport: complexity, geometry and applications
- Non-Archimedean transportation problems and Kantorovich ultra-norms
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
- Optimum matchings in weighted bipartite graphs
- Linearizable special cases of the QAP
- On the complexity of pattern feasibility problems in time-relaxed sports timetabling
- Minimum energy configurations on a toric lattice as a quadratic assignment problem
- Exact solution approaches for bilevel assignment problems
- SDP relaxations for some combinatorial optimization problems
- Task swapping networks in distributed systems
- Matrix relaxations in combinatorial optimization
- Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
- Point spread function field learning based on optimal transport distances
- Scaling algorithms for unbalanced optimal transport problems
- The partitioning min-max weighted matching problem
- The bipartite quadratic assignment problem and extensions
- Parallel-machine scheduling with maintenance: praising the assignment problem
- An eigensystem approach to Anderson localization
- Approximation of graph edit distance in quadratic time
- Controllability in directed complex networks: granular computing perspective
- The assignment problem with nearly Monge arrays and incompatible partner indices
- Exact and heuristic procedures for single machine scheduling with quadratic earliness and tardiness penalties
- Modelling and planning public cultural schedules for efficient use of resources
- An efficient procedure for finding best compromise solutions to the multi-objective assignment problem
- Parametrization of Random Vectors in Polynomial Chaos Expansions via Optimal Transportation
- The Hungarian method for the assignment problem
- scientific article; zbMATH DE number 3989103 (Why is no real title available?)
- Optimal bounds for integrals with respect to copulas and applications
This page was built for publication: Assignment Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3531417)
