A dual approach to multi-dimensional assignment problems
From MaRDI portal
Publication:2052387
DOI10.1007/s10898-020-00988-8zbMath1481.90223OpenAlexW3124539807MaRDI QIDQ2052387
Thia Kirubarajan, Jingqun Li, R. Tharmarasa, Daly Brown, Krishna R. Pattipati
Publication date: 26 November 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-020-00988-8
Nonconvex programming, global optimization (90C26) Discrete location and assignment (90B80) Boolean programming (90C09)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Local search heuristics for the multidimensional assignment problem
- Selected topics on assignment problems
- Assignment problems: a golden anniversary survey
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Approximation algorithms for multi-dimensional assignment problems with decomposable costs
- A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
- Test problem generator for the multidimensional assignment problem
- A forward/reverse auction algorithm for asymmetric assignment problems
- Algorithms and codes for dense assignment problems: The state of the art
- A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
- Integer programming models for the multidimensional assignment problem with star costs
- Graph partitions for the multidimensional assignment problem
- Some assignment problems arising from multiple target tracking
- A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
- Signature Methods for the Assignment Problem
- An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
- A new relaxation algorithm and passive sensor data association
- Branch-and-Bound Methods: A Survey
- A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
This page was built for publication: A dual approach to multi-dimensional assignment problems
