Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,495,940 papers from all fields of science
Search
Sign In
Create Free Account
Assignment problem
Known as:
Assignment
, Linear assignment problem
The assignment problem is one of the fundamental combinatorial optimization problems in the branch of optimization or operations research in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
29 relations
Adjacency matrix
Algorithm
Auction algorithm
DNA computing
Expand
Broader (2)
Combinatorial optimization
Linear programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet
Steven S. W. Lee
,
P. Tseng
,
Alice Chen
Future generations computer systems
2012
Corpus ID: 30029875
Highly Cited
2009
Highly Cited
2009
The multi-facility location-allocation problem with polyhedral barriers
M. Bischoff
,
T. Fleischmann
,
K. Klamroth
Computers & Operations Research
2009
Corpus ID: 15540493
2008
2008
Scheduling algorithms for unpredictably heterogeneous CMP architectures
Jonathan A. Winter
,
D. Albonesi
Dependable Systems and Networks
2008
Corpus ID: 18285920
In future large-scale multi-core microprocessors, hard errors and process variations will create dynamic heterogeneity, causing…
Expand
Highly Cited
2007
Highly Cited
2007
Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems
P. Chang
,
Shih-Hsin Chen
,
Chen-Hao Liu
Expert systems with applications
2007
Corpus ID: 1195130
2006
2006
Layered light-field rendering with focus measurement
Keita Takahashi
,
T. Naemura
Signal processing. Image communication
2006
Corpus ID: 11131636
Highly Cited
2005
Highly Cited
2005
Ant colony optimization of clustering models
T. Runkler
International Journal of Intelligent Systems
2005
Corpus ID: 2365375
The original ant system algorithm is simplified leading to a generalized ant colony optimization algorithm that can be used to…
Expand
Highly Cited
2002
Highly Cited
2002
A tabu search approach for assigning cells to switches in cellular mobile networks
S. Pierre
,
F. Houéto
Computer Communications
2002
Corpus ID: 205934289
Highly Cited
2002
Highly Cited
2002
A decentralized two-level transportation problem in a housing material manufacturer: Interactive fuzzy programming approach
M. Sakawa
,
I. Nishizaki
,
Y. Uemura
European Journal of Operational Research
2002
Corpus ID: 35053573
Highly Cited
2001
Highly Cited
2001
Bicriteria sequencing methods for the mixed-model assembly line in just-in-time production systems
Tugrul Korkmazel
,
S. Meral
European Journal of Operational Research
2001
Corpus ID: 30474558
1986
1986
On latin squares and the facial structure of related polytopes
R. Euler
,
R. Burkard
,
R. Grommes
Discrete Mathematics
1986
Corpus ID: 3201700
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE