Branch and bound algorithms for the multidimensional assignment problem

DOI10.1080/10556780410001697695MaRDI QIDQ5312759zbMATH OpenOpenAlexFDO

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

Publication date 25 August 2005

Published in Optimization Methods \& 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)

Recommendations

• Branch and bound solution of the multidimensional assignment problem formulation of data association
• Local search heuristics for the multidimensional assignment problem
• Local search heuristics for the multidimensional assignment problem
• Local neighborhoods for the multidimensional assignment problem
• Un algoritmo misto per il problema dell'assegnazione pluridimensionale

Cites work

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

Cited in

(14)

• A branch-and-bound algorithm for the coupled task problem
• Solution approaches to the three-index assignment problem
• Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking
• Local search heuristics for the multidimensional assignment problem
• Graph partitions for the multidimensional assignment problem
• Resolution search and dynamic branch-and-bound
• BRANCHING TECHNIQUE FOR A BI-OBJECTIVE TWO-STAGE ASSIGNMENT PROBLEM
• Integer programming models for the multidimensional assignment problem with star costs
• Branch-and-bound and objective branching with three or more objectives
• Clique facets of the axial and planar assignment polytopes
• The constant objective value property for multidimensional assignment problems
• Branch and bound solution of the multidimensional assignment problem formulation of data association
• Branch and bound algorithm for multidimensional scaling with city-block metric
• A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM

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

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