Linear-time separation algorithms for the three-index assignment polytope (Q1801663): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Linear-time separation algorithms for the three-index assignment polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the three-index assignment polytope / 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: Complexity of a 3-dimensional assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Solving 3-Dimensional Assignment Problems with Application to Scheduling a Teaching Practice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065285 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5643803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—The Multidimensional Assignment Problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:25, 17 May 2024

scientific article
Language Label Description Also known as
English
Linear-time separation algorithms for the three-index assignment polytope
scientific article

    Statements

    Linear-time separation algorithms for the three-index assignment polytope (English)
    0 references
    0 references
    0 references
    17 August 1993
    0 references
    cliques
    0 references
    odd holes
    0 references
    facet inducing inequalities
    0 references
    three-index assignment polytope
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references