Assignment Problems

DOI10.1137/1.9780898717754zbMath1196.90002OpenAlexW4239749705MaRDI QIDQ3531417

Rainer E. Burkard, Mauro Dell'Amico, Silvano Martello

Publication date: 31 October 2008

Full work available at URL: https://doi.org/10.1137/1.9780898717754

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Discrete location and assignment (90B80) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Matrix Relaxations in Combinatorial Optimization, Complexity and Polynomially Solvable Special Cases of QUBO, Non-Archimedean transportation problems and Kantorovich ultra-norms, Mathematical formulations for a 1-full-truckload pickup-and-delivery problem, Parametrization of Random Vectors in Polynomial Chaos Expansions via Optimal Transportation, Scaling algorithms for unbalanced optimal transport problems, A Pseudo-Likelihood Approach to Linear Regression With Partially Shuffled Data, Unnamed Item, Improved Graph Edit Distance Approximation with Simulated Annealing, SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning, On the complexity of pattern feasibility problems in time-relaxed sports timetabling, Geometry Helps to Compare Persistence Diagrams, Task assignment in tree-like hierarchical structures, How to Win at (One-Round) War, Minimum energy configurations on a toric lattice as a quadratic assignment problem, A weighted perfect matching with constraints on weights of its parts, Stable and extremely unequal, Ordinal optimization through multi-objective reformulation, On the Computational Complexity of Peer-to-Peer Satellite Refueling Strategies, Density estimation of multivariate samples using Wasserstein distance, Exact and heuristic methods for a workload allocation problem with chain precedence constraints, Dominant Z-Eigenpairs of Tensor Kronecker Products Decouple, On Integrality in Semidefinite Programming for Discrete Optimization, Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations, Matrix Balancing Based Interior Point Methods for Point Set Matching Problems, Distances and isomorphism between networks: stability and convergence of network invariants, Solving the rectangular assignment problem and applications, A note on block-and-bridge preserving maximum common subgraph algorithms for outerplanar graphs, On the vertices of the \(d\)-dimensional Birkhoff polytope, Tropical bounds for eigenvalues of matrices, Nonnegative tensors revisited: plane stochastic tensors, A 2/3-Approximation Algorithm for Vertex Weighted Matching in Bipartite Graphs, Exact Algorithms for Distributionally β-Robust Machine Scheduling with Uncertain Processing Times, Expert judgments in the cost-effectiveness analysis of resource allocations: a case study in military planning, Size Matters: Cardinality-Constrained Clustering and Outlier Detection via Conic Optimization, Dynamic discrete tomography, Approximation of Graph Edit Distance in Quadratic Time, Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting, Controllability in Directed Complex Networks: Granular Computing Perspective, Convergence of Entropic Schemes for Optimal Transport and Gradient Flows, Efficient algorithms for three‐dimensional axial and planar random assignment problems, A New Tractable Case of the QAP with a Robinson Matrix, Scheduling dedicated jobs with variative processing times, SDP Relaxations for Some Combinatorial Optimization Problems, Upper and lower bounding procedures for the multiple knapsack assignment problem, Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting, Some graph optimization problems with weights satisfying linear constraints, Semidefinite relaxations for partitioning, assignment and ordering problems, Enumerating extreme points of the polytopes of stochastic tensors: an optimization approach, Approximation algorithms in combinatorial scientific computing, Toward Quantifying Vertex Similarity in Networks, Unbiased Version of Hall’s Marriage Theorem in Matrix Form, Iterative Bregman Projections for Regularized Transportation Problems, Point Spread Function Field Learning Based on Optimal Transport Distances, Multiscale Nonrigid Point Cloud Registration Using Rotation-Invariant Sliced-Wasserstein Distance via Laplace--Beltrami Eigenmap, Task swapping networks in distributed systems, Optimum matchings in weighted bipartite graphs, Linearizable special cases of the QAP, A greedy and distributable approach to the Lexicographic Bottleneck Assignment Problem with conditions on exactness, Exact solution approaches for bilevel assignment problems, Order acceptance and due-date quotation in low machine rates, Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph, 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, 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, Improved exact approaches for row layout problems with departments of equal length, A population-based algorithm for solving linear assignment problems with two objectives, An efficient procedure for finding best compromise solutions to the multi-objective assignment problem, 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, Fast simulated annealing for single-row equidistant facility layout, Zero-diffusion limit for aggregation equations over bounded domains, Extending single tolerances to set tolerances, The quadratic cycle cover problem: special cases and efficient bounds, Improving bipartite graph edit distance approximation using various search strategies, On scheduling a single machine with resource dependent release times, 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, Computational aspects of assigning agents to a line, Lagrangian heuristic for a class of the generalized assignment problems, The bilinear assignment problem: complexity and polynomially solvable special cases, Optimal bounds for integrals with respect to copulas and applications, Distribution functions, extremal limits and optimal transport, Spatio-temporal multi-robot routing, Improved particle filters for multi-target tracking, Assignment markets that are uniquely determined by their core, Bottleneck partial-matching Voronoi diagrams and applications, The multi-stripe travelling salesman problem, Exact and heuristic algorithms for the interval data robust assignment problem, On integer images of max-plus linear mappings, Linear regression with sparsely permuted data, Some properties of Gromov-Hausdorff distances, Approximating the multi-level bottleneck assignment problem, Robust spotter scheduling in trailer yards, Probabilistic model validation for uncertain nonlinear systems, Tropical determinant of integer doubly-stochastic matrices, The Wiener maximum quadratic assignment problem, Two classes of quadratic assignment problems that are solvable as linear assignment problems, On the multicriteria allocation problem, Tropical principal component analysis and its application to phylogenetics, Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph, Exterior point simplex-type algorithms for linear and network optimization problems, Optimal transport: discretization and algorithms, Minimizing maximum weight of subsets of a maximum matching in a bipartite graph, 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, Minimizing value-at-risk in single-machine scheduling, A simple greedy heuristic for linear assignment interdiction, Geometric versions of the three-dimensional assignment problem under general norms, The constant objective value property for multidimensional assignment problems, Preconditioning techniques based on the Birkhoff-von Neumann decomposition, Decomposition method for solving a three-index planar assignment problem, 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, Scheduling batches in flowshop with limited buffers in the shampoo industry, A reduction approach to the repeated assignment problem, A Davidson college multi-objective assignment problem: a case study, A branch-and-bound algorithm for assembly line worker assignment and balancing problems, 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, Stochastic set packing problem, On the identifiability of Bayesian factor analytic models, The quadratic assignment problem is easy for Robinsonian matrices with Toeplitz structure, Bounds on integrals with respect to multivariate copulas, A population background for nonparametric density-based clustering, Maximum matchings of a digraph based on the largest geometric multiplicity, 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, An algorithm to approximate the optimal expected inner product of two vectors with given marginals, Handling fairness issues in time-relaxed tournaments with availability constraints, Distribution and quantile functions, ranks and signs in dimension \(d\): a measure transportation approach, ROML: a robust feature correspondence approach for matching objects in a set of images, On the computation of Wasserstein barycenters, Polynomial convolutions in max-plus algebra, Flexible quantile contour estimation for multivariate functional data: beyond convexity, Surrogate parametric metamodel based on optimal transport, Optimizing the marriage market: an application of the linear assignment model, Heuristic algorithms for the multi-depot ring-star problem, Efficient computation of tolerances in the sensitivity analysis of combinatorial bottleneck problems, Multi-dimensional vector assignment problems, Well-solvable cases of the QAP with block-structured matrices, Hybrid twins based on optimal transport, Rank-based testing for semiparametric VAR models: a measure transportation approach, A truck scheduling problem arising in intermodal container transportation, The focus of attention problem, Discrete optimal transport: complexity, geometry and applications