Solution approaches to the three-index assignment problem

DOI10.1051/RO/2024140MaRDI QIDQ6980429zbMATH OpenFDO

Authors Mohamed Mehbali

Publication date 22 May 2025

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2024140

zbMATH Keywords

combinatorial optimizationheuristicsHungarian methodmulti-index assignment problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems
• A novel convex dual approach to three-dimensional assignment problem: theoretical analysis
• Algorithms for the Assignment and Transportation Problems
• An adaptive algorithm for solving the axial three-index assignment problem
• An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice
• An Algorithm for the Three-Index Assignment Problem
• An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors
• An assignment problem and its application in education domain: a review and potential path
• Approximation algorithms for three-dimensional assignment problems with triangle inequalities
• Branch and bound algorithms for the multidimensional assignment problem
• Combinatorial properties of noninteger vertices of a polytope in a three-index axial assignment problem
• Combining solutions of the axial assignment problem
• Description of the types of maximum noninteger vertices of the polyhedron in the three-index axial assignment problem
• Establishing motion correspondence using extended temporal scope
• Facets of the axial three-index assignment polytope
• Facets of the three-index assignment polytope
• Geometric three-dimensional assignment problems
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1202983 (Why is no real title available?)
• scientific article; zbMATH DE number 1894374 (Why is no real title available?)
• scientific article; zbMATH DE number 1894375 (Why is no real title available?)
• scientific article; zbMATH DE number 1894378 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• scientific article; zbMATH DE number 3240945 (Why is no real title available?)
• scientific article; zbMATH DE number 2238172 (Why is no real title available?)
• scientific article; zbMATH DE number 4187451 (Why is no real title available?)
• Letter to the Editor—The Multidimensional Assignment Problem
• Linear-time separation algorithms for the three-index assignment polytope
• Local search heuristics for the multidimensional assignment problem
• Multi-dimensional vector assignment problems
• On multi-index assignment polytopes
• Polyhedral approaches
• Reducibility among combinatorial problems
• Some assignment problems arising from multiple target tracking
• Three-dimensional axial assignment problems with decomposable cost coefficients
• Traffic assignment in communication satellites
• Two-edge connected spanning subgraphs and polyhedra
• Very large-scale neighborhood search for the multidimensional assignment problem

This page was built for publication: Solution approaches to the three-index assignment problem

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