53
Views
18
CrossRef citations to date
0
Altmetric
Part Special Issue

Local search heuristics for multi-index assignment problems with decomposable costs

, &
Pages 694-704 | Received 01 Sep 2002, Accepted 01 Jan 2004, Published online: 21 Dec 2017

References

  • BandeltHJCramaYSpieksmaFCRApproximation algorithms for multidimensional assignment problems with decomposable costsDiscrete Appl Math199449255010.1016/0166-218X(94)90199-6
  • PierskallaWPThe multidimensional assignment problemOpns Res19681642243110.1287/opre.16.2.422
  • SpieksmaFCRMulti index assignment problems: complexity, approximation, applicationsNonlinear Assignment Problems, Algorithms and Applications2000112
  • FortinDTuseraARouting in meshes using linear assignment problemOperations Research ‘931994169171
  • PusztaszeriJFRensingPELieblingTMTracking elementary particles near their primary vertex: a combinatorial approachJ Global Optim19969416410.1007/BF00121750
  • MorefieldCLApplications of 0–1 integer programming to multitarget tracking problemsIEEE Trans Automat Control19772230231210.1109/TAC.1977.1101500
  • PattipatiKRDebSBar-ShalomYWashburnRA new relaxation algorithm and passive sensor data associationIEEE Trans Automat Control19923719721310.1109/9.121621
  • PooreABRijavecNA Lagrangian relaxation algorithm for multi-dimensional assignment problems arising from multitarget trackingSIAM J Optim1993354556310.1137/0803027
  • RobertsonAJA set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problemComput Optim Appl20011914516410.1023/A:1011285402433
  • ChummunMRKirubarajanTPattipatiKRBar-ShalomYFast data association using multidimensional assignment with clusteringIEEE Trans Aerospace Electron Systems20013789891310.1109/7.953245
  • PooreABMultidimensional assignment formulations of data-association problems arising from multitarget and multisensor trackingComput Optim Appl19943275710.1007/BF01299390
  • StormsPSpieksmaFCRAn LP-based algorithm for the data association problem in multitarget trackingComput Opns Res2003301067108510.1016/S0305-0548(02)00057-6
  • VeenmanCJReindersMJTBackerEEstablishing motion correspondence using extended temporal scopeArtif Intell200314522724310.1016/S0004-3702(02)00380-6
  • SpieksmaFCRWoegingerGJGeometric three-dimensional assignment problemsEur J Opl Res19969161161810.1016/0377-2217(95)00003-8
  • BierleinRMehrdimensionale Zuordnungsprobleme: Algorithmen und Anwendungen1993
  • CramaYSpieksmaFCRApproximation algorithms for three-dimensional assignment problems with triangle inequalitiesEur J Opl Res19926027327910.1016/0377-2217(92)90078-N
  • MagosDMourtosIAppaGPolyhedral results for assignment problems2002
  • RüschendorfLOn the multidimensional assignment problemMethods Opns Res198347107113
  • GilbertKCHofstraRBMultidimensional assignment problemsDecision Sci19881930632110.1111/j.1540-5915.1988.tb00269.x
  • AiexRMResendeMGCPardalosPMToraldoGGRASP with path relinking for the three-index assignment problem2000
  • AartsEHLLenstraJKLocal Search in Combinatorial Optimization1997
  • AhujaRKErgunÖOrlinJBPunnenAPA survey of very large-scale neighborhood search techniquesDiscrete Appl Math20021237510210.1016/S0166-218X(01)00338-9
  • JonkerRVolgenantAA shortest augmenting path algorithm for dense and sparse linear assignment problemsComputing19873832534010.1007/BF02278710
  • Dell'AmicoMTothPAlgorithms and codes for dense assignment problems: the state of the artDiscrete Appl Math2000100174810.1016/S0166-218X(99)00172-9
  • FriezeAMYadegarJAn algorithm for solving 3-dimensional assignment problems with application to scheduling a teaching practiceJ Opl Res Soc19813298999510.1057/jors.1981.207

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.