A dual approach to multi-dimensional assignment problems

DOI10.1007/S10898-020-00988-8zbMATH Open1481.90223OpenAlexW3124539807MaRDI QIDQ2052387FDOQ2052387

Authors: Jingqun Li, Thia Kirubarajan, 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

Recommendations

• A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
• A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
• Local search heuristics for the multidimensional assignment problem
• Solving the multidimensional assignment problem by a cross-entropy method
• Un algoritmo misto per il problema dell'assegnazione pluridimensionale

zbMATH Keywords

dualitytarget trackingmultidimensional assignmentbinary programming

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Boolean programming (90C09) Discrete location and assignment (90B80)

Cites Work

• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Approximation algorithms for multi-dimensional assignment problems with decomposable costs
• Title not available (Why is that?)
• Title not available (Why is that?)
• An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
• Title not available (Why is that?)
• Assignment problems: a golden anniversary survey
• Selected topics on assignment problems
• Branch-and-Bound Methods: A Survey
• Algorithms and codes for dense assignment problems: The state of the art
• A set of greedy randomized adaptive local search procedure (GRASP) implementations for the multidimensional assignment problem
• A new relaxation algorithm and passive sensor data association
• A Lagrangian Relaxation Algorithm for Multidimensional Assignment Problems Arising from Multitarget Tracking
• Local search heuristics for the multidimensional assignment problem
• Signature Methods for the Assignment Problem
• A forward/reverse auction algorithm for asymmetric assignment problems
• Test problem generator for the multidimensional assignment problem
• A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
• Graph partitions for the multidimensional assignment problem
• Some assignment problems arising from multiple target tracking
• Integer programming models for the multidimensional assignment problem with star costs
• A novel convex dual approach to three-dimensional assignment problem: theoretical analysis

Cited In (10)

• A dual approach for solving the combined distribution and assignment problem with link capacity constraints
• An alternate approach to solve two-level priority based assignment problem
• A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
• The multi-story space assignment problem
• A Davidson college multi-objective assignment problem: a case study
• Combining solutions of the axial assignment problem
• The constant objective value property for multidimensional assignment problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: A dual approach to multi-dimensional assignment problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2052387)