Selected topics on assignment problems

Authors:
Rainer E. Burkard
Affiliations:
Technische Universität Graz, Institut för Mathematik, Steyrergasse 30, A-8010 Graz, Austria
Venue:
Discrete Applied Mathematics
Year:
2002

Citing 41
Cited 23

Data structures and network algorithms

Data structures and network algorithms
Time-slot assignment for TDMA-systems

Computing
A tight linearization and an algorithm for zero-one quadratic programming problems

Management Science
On linear programs with random costs

Mathematical Programming: Series A and B
Monge sequences and a simple assignment algorithm

Discrete Applied Mathematics
On latin squares and the facial structure of related polytopes

Discrete Mathematics
Matching is as easy as matrix inversion

Combinatorica
Algorithms for two bottleneck optimization problems

Journal of Algorithms
Facets of the three-index assignment polytope

Discrete Applied Mathematics
Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Linearization strategies for a class of zero-one mixed integer programming problems

Operations Research
An algorithm for the three-index assignment problem

Operations Research
Stochastic analysis of the quadratic assignment problem

Mathematics of Operations Research
Computing a maximum cardinality matching in a bipartite graph in time On1.5m/logn

Information Processing Letters
Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem

Mathematical Programming: Series A and B
A new lower bound via projection for the quadratic assignment problem

Mathematics of Operations Research
Linear-time separation algorithms for the three-index assignment polytope

Discrete Applied Mathematics
Massively parallel tabu search for the quadratic assignment problem

Annals of Operations Research - Special issue on Tabu search
Multidimensional assignment formulation of data association problems arising from multitarget and multisensor tracking

Computational Optimization and Applications
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem

Discrete Applied Mathematics
Average case analysis of a heuristic for the assignment problem

Mathematics of Operations Research
Three-dimensional axial assignment problems with decomposable cost coefficients

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Time-tables, polyhedra and the greedy algorithm

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Perspectives of Monge properties in optimization

Discrete Applied Mathematics
A New Lagrangian Relaxation Based Algorithm for a Class ofMultidimensional Assignment Problems

Computational Optimization and Applications
Solution methods and computational investigations for the linear bottleneck assignment problem

Computing
On the Applicability of Lower Bounds for Solving RectilinearQuadratic Assignment Problems in Parallel

Computational Optimization and Applications
P-Complete Approximation Problems

Journal of the ACM (JACM)
Fast Probabilistic Algorithms for Verification of Polynomial Identities

Journal of the ACM (JACM)
A dual framework for lower bounds of the quadratic assignment problem based on linearization

Computing - Special issue on combinatorial optimization
A greedy genetic algorithm for the quadratic assignment problem

Computers and Operations Research
The QAP-polytope and the star transformation

Discrete Applied Mathematics
Assignment and Matching Problems: Solution Methods with FORTRAN-Programs

Assignment and Matching Problems: Solution Methods with FORTRAN-Programs
On the SQAP-Polytope

SIAM Journal on Optimization
QAPLIB – A Quadratic Assignment ProblemLibrary

Journal of Global Optimization
Bounds for the Quadratic Assignment Problems Using Continuous Optimization Techniques

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference
The Quadratic Assignment Problem with a Monotone Anti-Monge and a Symmetric Toeplitz Matrix: Easy and Hard Cases

Proceedings of the 5th International IPCO Conference on Integer Programming and Combinatorial Optimization
Lower Bounds for the Quadratic Assignment Problem Based Upon a Dual Formulation

Operations Research
A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
A dynamic-programming bound for the quadratic assignment problem

COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A solvable case of the quadratic assignment problem11This research has been supported by the Spezialforschungsbereich F 003 ``Optimierung und Kontrolle", Projektbereich Diskrete Optimierung.

Operations Research Letters

Test Problem Generator for the Multidimensional Assignment Problem

Computational Optimization and Applications
On uniform k-partition problems

Discrete Applied Mathematics - Special issue: Max-algebra
Incremental assignment problem

Information Sciences: an International Journal
Tracking in a spaghetti bowl: monitoring transactions using footprints

SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Perfect matchings and extended polymatroid

Cybernetics and Systems Analysis
Computer-supported negotiation of course content

Computers & Education
On a pair of job-machine assignment problems with two stages

Computers and Operations Research
Multirobot Task Assignment in Active Surveillance

EPIA '09 Proceedings of the 14th Portuguese Conference on Artificial Intelligence: Progress in Artificial Intelligence
On uniform k-partition problems

Discrete Applied Mathematics
A fast lp spike alignment metric

Neural Computation
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Computational complexity and solution algorithms for flowshop scheduling problems with the learning effect

Computers and Industrial Engineering
Slotting methodology using correlated improvement for a zone-based carton picking distribution system

Computers and Industrial Engineering
Route-exchange algorithm for combinatorial optimization based on swarm intelligence

ICIC'06 Proceedings of the 2006 international conference on Computational Intelligence and Bioinformatics - Volume Part III
Selecting the roots of a small system of polynomial equations by tolerance based matching

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Using bipartite and multidimensional matching to select the roots of a system of polynomial equations

ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Clique facets of the axial and planar assignment polytopes

Discrete Optimization
On the job rotation problem

Discrete Optimization
A distributed simplex algorithm for degenerate linear programs and multi-agent assignments

Automatica (Journal of IFAC)
Subset quadratic assignment problem

IEA/AIE'12 Proceedings of the 25th international conference on Industrial Engineering and Other Applications of Applied Intelligent Systems: advanced research in applied artificial intelligence
Decentralized multi-robot cooperation with auctioned POMDPs

International Journal of Robotics Research
A negative dual rectangle cancellation algorithm for the linear assignment problem

Computers and Industrial Engineering
Formal approach to guard time optimization for TDMA

Proceedings of the 21st International conference on Real-Time Networks and Systems

Quantified Score

Hi-index	0.05

Visualization

Abstract

We survey recent developments in the fields of bipartite matchings, linear sum assignment and bottleneck assignment problems and applications, multidimensional assignment problems, quadratic assignment problems, in particular lower bounds, special cases and asymptotic results, biquadratic and communication assignment problems.