An algorithm for the planar three-index assignment problem

DOI10.1016/0377-2217(94)90034-5zbMATH Open0810.90093OpenAlexW2042403544MaRDI QIDQ1333481FDOQ1333481

Authors: V. Pereyra 

Publication date: 15 September 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90034-5

Recommendations

• An Algorithm for the Three-Index Assignment Problem
• Investigation of polynomial algorithms for solving the three-index planar assignment problem
• Tabu search for the planar three-index assignment problem
• An asymptotically exact algorithm for one modification of planar three-index assignment
• Decomposition method for solving a three-index planar assignment problem

zbMATH Keywords

subgradient optimizationbranch-and-boundLagrangean relaxation schemeLatin square structureplanar three-index assignment

Mathematics Subject Classification ID

Boolean programming (90C09) Discrete location and assignment (90B80)

Cites Work

• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• New Methods in Mathematical Programming—The Solid Transportation Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Set Partitioning: A survey
• Complexity of a 3-dimensional assignment problem
• Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
• Title not available (Why is that?)
• An Algorithm for the Three-Index Assignment Problem
• On Latin squares and the facial structure of related polytopes
• The Multi-Index Problem
• Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
• Title not available (Why is that?)
• Title not available (Why is that?)
• The reconstruction of latin squares with applications to school timetabling and to experimental design
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (19)

• Title not available (Why is that?)
• On the orthogonal Latin squares polytope
• A reduction approach to the repeated assignment problem
• New lower bounds for the triplanar assignment problem. Use of the classical model
• Fast local search algorithms for the handicapped persons transportation problem
• Scheduling sports competitions on multiple venues.
• Selected topics on assignment problems
• A hybrid genetic algorithm for the three-index assignment problem
• An asymptotically exact algorithm for one modification of planar three-index assignment
• A survey for the quadratic assignment problem
• Test problem generator for the multidimensional assignment problem
• A Branch & Cut algorithm for a four-index assignment problem
• A new class of facets for the Latin square polytope
• Round robin tournaments and three index assignments
• On multi-index assignment polytopes
• On Asymptotically Optimal Algorithm for One Modification of Planar 3-dimensional Assignment Problem
• Clique facets of the axial and planar assignment polytopes
• A characterization of odd-hole inequalities related to Latin squares
• Efficient algorithms for three‐dimensional axial and planar random assignment problems

This page was built for publication: An algorithm for the planar three-index assignment problem

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