A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
From MaRDI portal
Publication:2007830
DOI10.1007/s10589-019-00113-wzbMath1425.90067OpenAlexW2947674464MaRDI QIDQ2007830
Krishna R. Pattipati, Thia Kirubarajan, Daly Brown, Jingqun Li, R. Tharmarasa
Publication date: 22 November 2019
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-019-00113-w
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- New Kuhn-Tucker sufficiency for global optimality via convexification
- 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
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Algorithms and codes for dense assignment problems: The state of the art
- 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
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- \(p\)th power Lagrangian method for integer programming
- A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
This page was built for publication: A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
