Keyword

assignment problem

Description: The assignment problem is a combinatorial optimization problem that allocates tasks to agents at minimum cost or maximum benefit, typically in operations research.

Primary topic: Optimization and Mathematical Programming (24%)

Wikidata ID: wiki/Q620614

OpenAlex ID: keywords/assignment-problem

The Hungarian method for the assignment problem

1955 · H. W. Kuhn · Naval Research Logistics Quarterly · 13,069

Reducibility among Combinatorial Problems

1972 · Richard M. Karp · Springer eBooks · 11,503

Shape matching and object recognition using shape contexts

2002 · S. Belongie, J. Malik, et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence · 6,302

Algorithms for the Assignment and Transportation Problems

1957 · James Munkres · Journal of the Society for Industrial and Applied Mathematics · 3,993

Introduction to Operations Research

1968 · Ferdinand F. Leimkuhler, F. S. Hillier, et al. · Technometrics · 3,405

Ant Colony Optimization

2004 · Marco Dorigo, Thomas Stützle · The MIT Press eBooks · 3,332

Fibonacci heaps and their uses in improved network optimization algorithms

1987 · Michael L. Fredman, Robert Endre Tarjan · Journal of the ACM · 2,657

PDF

Assignment Problems and the Location of Economic Activities

1957 · Tjalling C. Koopmans, Martin Beckmann · Econometrica · 2,308

The Lagrangian Relaxation Method for Solving Integer Programming Problems

1981 · Marshall L. Fisher · Management Science · 2,111

Linear Programming and Network Flows

1978 · C. R. Sergeant, Mokhtar S. Bazaraa, et al. · Journal of the Operational Research Society · 1,973

The assignment game I: The core

1971 · L. S. Shapley, M. Shubik · International Journal of Game Theory · 1,714

Operations Research: Applications and Algorithms

1988 · Eric R. Ziegel, Wayne Winston · Technometrics · 1,692

Assignment Problems

2009 · Rainer Burkard, Mauro Dell'Amico, et al. · Society for Industrial and Applied Mathematics eBooks · 1,408

The Hungarian method for the assignment problem

2004 · H. W. Kuhn · Naval Research Logistics (NRL) · 1,262

An Algorithm for the Traveling Salesman Problem

1963 · John D. C. Little, Katta G. Murty, et al. · Operations Research · 1,060

Operation of a Multiagent System for Microgrid Control

2005 · A.L. Dimeas, N.D. Hatziargyriou · IEEE Transactions on Power Systems · 1,033

A Comprehensive Review on NSGA-II for Multi-Objective Combinatorial Optimization Problems

2021 · Shanu Verma, Millie Pant, et al. · IEEE Access · 982

PDF

The Lagrangian Relaxation Method for Solving Integer Programming Problems

2004 · Marshall L. Fisher · Management Science · 808

Operations research : applications and algorithms

1994 · Wayne L. Winston · 635

The auction algorithm: A distributed relaxation method for the assignment problem

1988 · D. P. Bertsekas · Annals of Operations Research · 635

PDF

Open Set Domain Adaptation

2017 · Pau Panareda Busto, Juergen Gall · IEEE International Conference on Computer Vision (ICCV) · 582

Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost

1968 · Katta G. Murty · Operations Research · 552

Assignment problems: A golden anniversary survey

2005 · David W. Pentico · European Journal of Operational Research · 513

Inverse Optimization

2001 · Ravindra K. Ahuja, James B. Orlin · Operations Research · 503

An extension of the Munkres algorithm for the assignment problem to rectangular matrices

1971 · François Bourgeois, Jean-Claude Lassalle · Communications of the ACM · 501

PDF

Works count: 6,431

Citation count: 123,400