Branch and bound algorithms for the multidimensional assignment problem

DOI10.1080/10556780410001697695zbMath1087.90041OpenAlexW2076564017MaRDI QIDQ5312759

Leonidas S. Pitsoulis, Eduardo L. Pasiliao, Panos M. Pardalos

Publication date: 25 August 2005

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780410001697695

zbMATH Keywords

combinatorial optimizationcomputational resultsmultidimensional assignment problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (5)

Branch and bound solution of the multidimensional assignment problem formulation of data association ⋮ Graph partitions for the multidimensional assignment problem ⋮ Integer programming models for the multidimensional assignment problem with star costs ⋮ Local search heuristics for the multidimensional assignment problem ⋮ Clique facets of the axial and planar assignment polytopes

Cites Work

• A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
• Tracking elementary particles near their primary vertex: A combinatorial approach
• Solving the multisensor data association problem.
• An Algorithm for the Three-Index Assignment Problem
• A new relaxation algorithm and passive sensor data association
• GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
• Letter to the Editor—The Multidimensional Assignment Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Branch and bound algorithms for the multidimensional assignment problem