A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
type: Item
instance of: scholarly article
title: A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
zbMATH Open document ID: 1425.90067
author: Jingqun Li
author: R. Tharmarasa
author: Daly Brown
author: Thia Kirubarajan
author: Krishna R. Pattipati
published in: Computational Optimization and Applications
publication date: 2019-11-22T00:00:00Z
Mathematics Subject Classification ID: 90C09
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7135242
zbMATH Keywords: multidimensional assignment
zbMATH Keywords: binary programming
zbMATH Keywords: duality
zbMATH Keywords: convexification
MaRDI profile type: Publication
full work available at URL: s10589-019-00113-w
OpenAlex ID: W2947674464
cites work: Assignment problems: a golden anniversary survey
cites work: A forward/reverse auction algorithm for asymmetric assignment problems
cites work: Q5519710
cites work: Signature Methods for the Assignment Problem
cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems
cites work: Algorithms and codes for dense assignment problems: The state of the art
cites work: Selected topics on assignment problems
cites work: Some assignment problems arising from multiple target tracking
cites work: Q4198056
cites work: Approximation algorithms for multi-dimensional assignment problems with decomposable costs
cites work: Graph partitions for the multidimensional assignment problem
cites work: Integer programming models for the multidimensional assignment problem with star costs
cites work: Local search heuristics for the multidimensional assignment problem
cites work: A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
cites work: An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
cites work: A new relaxation algorithm and passive sensor data association
cites work: A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
cites work: A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
cites work: \(p\)th power Lagrangian method for integer programming
cites work: A reformulation-convexification approach for solving nonconvex quadratic programming problems
cites work: New Kuhn-Tucker sufficiency for global optimality via convexification
cites work: Test problem generator for the multidimensional assignment problem
cites work: Q5187067
cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
cites work: Q4226179
cites work: Q4830373
cites work: Q3050157
Wikidata QID: Q127859109
DOI: 10.1007/S10589-019-00113-W
description: scientific article; zbMATH DE number 7135242