Adaptive image retrieval based on the spatial organization of colors
Computer Vision and Image Understanding
The single-finger keyboard layout problem
Computers and Operations Research
ParkNet: drive-by sensing of road-side parking statistics
Proceedings of the 8th international conference on Mobile systems, applications, and services
Lagrangian heuristic for a class of the generalized assignment problems
Computers & Mathematics with Applications
Minimum-hot-spot query trees for wireless sensor networks
Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Scalable thread scheduling and global power management for heterogeneous many-core architectures
Proceedings of the 19th international conference on Parallel architectures and compilation techniques
LP Solvable Models for Multiagent Fair Allocation Problems
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
On scheduling a single machine with resource dependent release times
Computers and Operations Research
BioNLP '10 Proceedings of the 2010 Workshop on Biomedical Natural Language Processing
ADMI'10 Proceedings of the 6th international conference on Agents and data mining interaction
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Geodesic shape retrieval via optimal mass transport
ECCV'10 Proceedings of the 11th European conference on Computer vision: Part V
Exact and heuristic algorithms for the interval data robust assignment problem
Computers and Operations Research
Keymantic: semantic keyword-based searching in data integration systems
Proceedings of the VLDB Endowment
Keyword search over relational databases: a metadata approach
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Matching samples of multiple views
Data Mining and Knowledge Discovery
Asymptotic Moments of the Bottleneck Assignment Problem
Mathematics of Operations Research
Speeding up graph edit distance computation through fast bipartite matching
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
ACART: an API Compliance and Analysis Report Tool for discovering reference design traceability
Proceedings of the 49th Annual Southeast Regional Conference
Tolerating correlated failures for generalized Cartesian distributions via bipartite matching
Proceedings of the 8th ACM International Conference on Computing Frontiers
Replica placement in peer-assisted clouds: an economic approach
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
An integrated algorithm for 3D-IC TSV assignment
Proceedings of the 48th Design Automation Conference
An intelligent framework to online bin packing in a just-in-time environment
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
Automatic retrieval of parallel collocations
PReMI'11 Proceedings of the 4th international conference on Pattern recognition and machine intelligence
Four-layer framework for combinatorial optimization problems domain
Advances in Engineering Software
Texture segmentation via non-local non-parametric active contours
EMMCVPR'11 Proceedings of the 8th international conference on Energy minimization methods in computer vision and pattern recognition
Transportation Distances on the Circle
Journal of Mathematical Imaging and Vision
An O(n4) Algorithm for the QAP Linearization Problem
Mathematics of Operations Research
Polynomially solvable special cases of the quadratic bottleneck assignment problem
Journal of Combinatorial Optimization
Improved particle filters for multi-target tracking
Journal of Computational Physics
The algorithm APT to classify in concurrence of latency and drift
IDA'11 Proceedings of the 10th international conference on Advances in intelligent data analysis X
Privacy-preserving assessment of location data trustworthiness
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Comparison and retrieval of process models using related cluster pairs
Computers in Industry
A WSDL structure based approach for semantic categorization of web service elements
SETN'10 Proceedings of the 6th Hellenic conference on Artificial Intelligence: theories, models and applications
Towards automated structure-based NMR resonance assignment
RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
Low complexity resource allocation for OFDMA based on coalitional game theory
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Dynamic programming for the quadratic assignment problem on trees
Automation and Remote Control
Wasserstein barycenter and its application to texture mixing
SSVM'11 Proceedings of the Third international conference on Scale Space and Variational Methods in Computer Vision
Datalog relaunched: simulation unification and value invention
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Approximating the multi-level bottleneck assignment problem
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Investigation of data locality and fairness in MapReduce
Proceedings of third international workshop on MapReduce and its Applications Date
The Wiener maximum quadratic assignment problem
Discrete Optimization
An ontology-based mechanism for automatic categorization of web services
Concurrency and Computation: Practice & Experience
Computer Graphics Forum
Three Ideas for the Quadratic Assignment Problem
Operations Research
Supporting sketch-based retrieval from a library of reusable behaviours
Expert Systems with Applications: An International Journal
Gestures as point clouds: a $P recognizer for user interface prototypes
Proceedings of the 14th ACM international conference on Multimodal interaction
The minimum cost perfect matching problem with conflict pair constraints
Computers and Operations Research
Online silk road: nurturing social search through knowledge bartering
Proceedings of the 2013 conference on Computer supported cooperative work
Push-relabel based algorithms for the maximum transversal problem
Computers and Operations Research
Computers and Operations Research
On optimal worst-case matching
Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Toward an optimized arabic keyboard design for single-pointer applications
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
Intelligent photographing interface with on-device aesthetic quality assessment
ACCV'12 Proceedings of the 11th international conference on Computer Vision - Volume 2
Shortlisting top-K assignments
Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Matchings with externalities and attitudes
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Test-assignment: a quadratic coloring problem
Journal of Heuristics
GPU accelerated maximum cardinality matching algorithms for bipartite graphs
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
International Journal of Robotics Research
Throughput-optimal resource allocation in LTE-Advanced with distributed antennas
Computer Networks: The International Journal of Computer and Telecommunications Networking
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis
Computers and Operations Research
A branch-and-bound algorithm for assembly line worker assignment and balancing problems
Computers and Operations Research
A memetic algorithm for the capacitated m-ring-star problem
Applied Intelligence
| Hi-index | 0.01 |
This book provides a comprehensive treatment of assignment problems from their conceptual beginnings in the 1920s through present-day theoretical, algorithmic, and practical developments. The authors have organized the book into 10 self-contained chapters to make it easy for readers to use the specific chapters of interest to them without having to read the book linearly. The topics covered include bipartite matching algorithms, linear assignment problems, quadratic assignment problems, multi-index assignment problems, and many variations of these problems. Exercises in the form of numerical examples provide readers with a method of self-study or students with homework problems, and an associated webpage offers applets that readers can use to execute some of the basic algorithms as well as links to computer codes that are available online. Audience: Assignment Problems is a useful tool for researchers, practitioners, and graduate students. Researchers will benefit from the detailed exposition of theory and algorithms related to assignment problems, including the basic linear sum assignment problem and its many variations. Practitioners will learn about practical applications of the methods, the performance of exact and heuristic algorithms, and software options. This book also can serve as a text for advanced courses in discrete mathematics, integer programming, combinatorial optimization, and algorithmic computer science. Contents: Preface; Chapter 1: Introduction; Chapter 2: Theoretical Foundations; Chapter 3: Bipartite Matching Algorithms; Chapter 4: Linear Sum Assignment Problem; Chapter 5: Further Results on the Linear Sum Assignment Problem; Chapter 6: Other Types of Linear Assignment Problems; Chapter 7: Quadratic Assignment Problems: Formulations and Bounds; Chapter 8: Quadratic Assignment Problems: Algorithms; Chapter 9: Other Types of Quadratic Assignment Problems; Chapter 10: Multi-index Assignment Problems; Bibliography; Author Index; Subject Index