Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)
Recommendations
Cites work
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 3644805 (Why is no real title available?)
- scientific article; zbMATH DE number 6118218 (Why is no real title available?)
- scientific article; zbMATH DE number 4199950 (Why is no real title available?)
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 3982880 (Why is no real title available?)
- scientific article; zbMATH DE number 4043612 (Why is no real title available?)
- scientific article; zbMATH DE number 3685223 (Why is no real title available?)
- scientific article; zbMATH DE number 3759934 (Why is no real title available?)
- scientific article; zbMATH DE number 124861 (Why is no real title available?)
- scientific article; zbMATH DE number 151870 (Why is no real title available?)
- scientific article; zbMATH DE number 3482073 (Why is no real title available?)
- scientific article; zbMATH DE number 3564691 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1203226 (Why is no real title available?)
- scientific article; zbMATH DE number 1302195 (Why is no real title available?)
- scientific article; zbMATH DE number 1304348 (Why is no real title available?)
- scientific article; zbMATH DE number 679866 (Why is no real title available?)
- scientific article; zbMATH DE number 679871 (Why is no real title available?)
- scientific article; zbMATH DE number 714526 (Why is no real title available?)
- scientific article; zbMATH DE number 714527 (Why is no real title available?)
- scientific article; zbMATH DE number 714530 (Why is no real title available?)
- scientific article; zbMATH DE number 714531 (Why is no real title available?)
- scientific article; zbMATH DE number 714541 (Why is no real title available?)
- scientific article; zbMATH DE number 1086908 (Why is no real title available?)
- scientific article; zbMATH DE number 1163720 (Why is no real title available?)
- scientific article; zbMATH DE number 1173721 (Why is no real title available?)
- scientific article; zbMATH DE number 1175960 (Why is no real title available?)
- scientific article; zbMATH DE number 1175961 (Why is no real title available?)
- scientific article; zbMATH DE number 3440185 (Why is no real title available?)
- scientific article; zbMATH DE number 776090 (Why is no real title available?)
- scientific article; zbMATH DE number 3272833 (Why is no real title available?)
- scientific article; zbMATH DE number 3343655 (Why is no real title available?)
- scientific article; zbMATH DE number 4187451 (Why is no real title available?)
- scientific article; zbMATH DE number 3073200 (Why is no real title available?)
- scientific article; zbMATH DE number 3095897 (Why is no real title available?)
- A New Lower Bound Via Projection for the Quadratic Assignment Problem
- A Note on Assignment Problems
- A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
- A branch and bound algorithm for the Koopmans-Beckmann quadratic assignment problem
- A dual framework for lower bounds of the quadratic assignment problem based on linearization
- A greedy genetic algorithm for the quadratic assignment problem
- A minimax assignment problem in treelike communication networks
- A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems
- A solvable case of the quadratic assignment problem
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- Algorithm and Average-value Bounds for Assignment Problems
- Algorithm for the solution of the bottleneck assignment problem
- Algorithms for two bottleneck optimization problems
- Alternate strategies for solving bottleneck assignment problems - analysis and computational results
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
- An Algorithm for the Three-Index Assignment Problem
- An algebraic approach to assignment problems
- An algorithm for the planar three-index assignment problem
- An algorithm for the quadratic assignment problem using Benders' decomposition
- An algorithm to solve them ×n assignment problem in expected timeO(mn logn)
- An augmenting path method for solving linear bottleneck assignment problems
- An improved annealing scheme for the QAP
- Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem
- Assignment Problems and the Location of Economic Activities
- Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
- Asymptotic Properties of the Quadratic Assignment Problem
- Average Case Analysis of a Heuristic for the Assignment Problem
- Balanced optimization problems
- Balancing hydraulic turbine runners - A discrete combinatorial optimization problem
- Bottleneck extrema
- Certain expected values in the random assignment problem
- Combinational optimization problems for which almost every algorithm is asymptotically optimal
- Complexity of a 3-dimensional assignment problem
- Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\)
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- Facets of the three-index assignment polytope
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Generating quadratic assignment test problems with known optimal permutations
- Heuristics for biquadratic assignment problems and their computational comparison
- Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
- Letter to the Editor—The Multidimensional Assignment Problem
- Linear-time separation algorithms for the three-index assignment polytope
- Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems
- Location, scheduling, design and integer programming
- Lower bounds for the quadratic assignment problem based upon a dual formulation
- Massively parallel tabu search for the quadratic assignment problem
- Matching is as easy as matrix inversion
- Matchings in random regular bipartite digraphs
- Matrix multiplication via arithmetic progressions
- Maximal Flow Through a Network
- Monge sequences and a simple assignment algorithm
- Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking
- On Latin squares and the facial structure of related polytopes
- On Representatives of Subsets
- On linear programs with random costs
- On lower bounds for a class of quadratic 0,1 programs
- On random quadratic bottleneck assignment problems
- On the Expected Value of a Random Assignment Problem
- On the SQAP-polytope
- On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
- On the complexity of decomposing matrices arising in satellite communication
- On the quadratic assignment problem
- Optimization by simulated annealing
- P-Complete Approximation Problems
- Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
- Perspectives of Monge properties in optimization
- Probabilistic asymptotic properties of some combinatorial optimization problems
- QAPLIB - a quadratic assignment problem library
- Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
- Semidefinite programming relaxations for the quadratic assignment problem
- Solution methods and computational investigations for the linear bottleneck assignment problem
- Stochastic Analysis of the Quadratic Assignment Problem
- Symmetrization of nonsymmetric quadratic assignment problems and the Hoffman-Wielandt inequality
- Tabu Search Applied to the Quadratic Assignment Problem
- Tabu search for the planar three-index assignment problem
- Technical Note—An Improved Algorithm for the Bottleneck Assignment Problem
- The Backboard Wiring Problem: A Placement Algorithm
- The Factorization of Linear Graphs
- The QAP-polytope and the star transformation
- The Reactive Tabu Search
- The asymptotic probabilistic behaviour of quadratic sum assignment problems
- The complexity of facets resolved
- The number of 9x9 Latin squares
- The quadratic assignment problem
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- The quadratic assignment problem. Theory and algorithms
- The random linear bottleneck assignment problem
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Three-dimensional axial assignment problems with decomposable cost coefficients
- Time-slot assignment for TDMA-systems
- Time-tables, polyhedra and the greedy algorithm
- Traffic assignment in communication satellites
- Weakly admissible transformations for solving algebraic assignment and transportation problems
Cited in
(53)- scientific article; zbMATH DE number 151870 (Why is no real title available?)
- A MIP model for scheduling India's general elections and police movement
- scientific article; zbMATH DE number 1568992 (Why is no real title available?)
- Computational studies of randomized multidimensional assignment problems
- A performance guarantee heuristic for electronic components placement problems including thermal effects
- An exact algorithm for the minimum squared load assignment problem
- Assignment problems.
- Application of optimal transportation theory to the reconstruction of the early Universe
- On optimality of a polynomial algorithm for random linear multidimensional assignment problem
- A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
- On uniform \(k\)-partition problems
- On the complexity of the assignment problem with ordinal data
- Incremental assignment problem
- An assignment problem and its application in education domain: a review and potential path
- scientific article; zbMATH DE number 3989103 (Why is no real title available?)
- A new mixed integer programming model for curriculum balancing: application to a Turkish university
- scientific article; zbMATH DE number 1894374 (Why is no real title available?)
- A survey for the quadratic assignment problem
- Heuristic and exact algorithms for the simultaneous assignment problem
- A distributed simplex algorithm for degenerate linear programs and multi-agent assignments
- On a pair of job-machine assignment problems with two stages
- On the Hamming distance in combinatorial optimization problems on hypergraph matchings
- scientific article; zbMATH DE number 221925 (Why is no real title available?)
- Test problem generator for the multidimensional assignment problem
- Nonlinear assignment problems. Algorithms and applications
- Solving LP relaxations of some NP-hard problems is as hard as solving any linear program
- Discrete and geometric branch and bound algorithms for~medical image registration
- A dual approach to multi-dimensional assignment problems
- Tabu search and iterated local search for the cyclic bottleneck assignment problem
- Random assignment problems
- Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the reformulation-linearization technique
- A Relaxed Assignment Algorithm For The Quadratic Assignement Problem
- Assignment Problems
- A Fast ℒp Spike Alignment Metric
- Asymptotic behavior of the expected optimal value of the multidimensional assignment problem
- Perfect matchings and extended polymatroid
- The three-dimensional assignment and partition problems. New lower bounds
- New variable-length data compression scheme for solution representation of meta-heuristics
- Integer programming models for the multidimensional assignment problem with star costs
- On the job rotation problem
- Linear assignment problems in combinatorial optimization
- Uncertain random assignment problem
- Un algoritmo misto per il problema dell'assegnazione pluridimensionale
- scientific article; zbMATH DE number 4001850 (Why is no real title available?)
- scientific article; zbMATH DE number 3972644 (Why is no real title available?)
- Random multi-index matching problems
- scientific article; zbMATH DE number 3922368 (Why is no real title available?)
- A note on the parity assignment problem
- Solving the rectangular assignment problem and applications
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Admissible transformations and assignment problems
- scientific article; zbMATH DE number 3982944 (Why is no real title available?)
- scientific article; zbMATH DE number 714530 (Why is no real title available?)
This page was built for publication: Selected topics on assignment problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697571)
