An algorithm for the planar three-index assignment problem (Q1333481): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)90034-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042403544 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Three-Index Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3880581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Latin squares and the facial structure of related polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of a 3-dimensional assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Methods in Mathematical Programming—The Solid Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multi-Index Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3912314 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reconstruction of latin squares with applications to school timetabling and to experimental design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank

Latest revision as of 16:50, 22 May 2024

scientific article
Language Label Description Also known as
English
An algorithm for the planar three-index assignment problem
scientific article

    Statements

    An algorithm for the planar three-index assignment problem (English)
    0 references
    0 references
    15 September 1994
    0 references
    branch-and-bound
    0 references
    planar three-index assignment
    0 references
    Latin square structure
    0 references
    Lagrangean relaxation scheme
    0 references
    subgradient optimization
    0 references

    Identifiers