Branch and bound algorithms for the multidimensional assignment problem (Q5312759): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Tracking elementary particles near their primary vertex: A combinatorial approach / 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: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—The Multidimensional Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the multisensor data association problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new relaxation algorithm and passive sensor data association / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangian relaxation based algorithm for a class of multidimensional assignment problems / rank
 
Normal rank

Latest revision as of 15:40, 10 June 2024

scientific article; zbMATH DE number 2198848
Language Label Description Also known as
English
Branch and bound algorithms for the multidimensional assignment problem
scientific article; zbMATH DE number 2198848

    Statements

    Branch and bound algorithms for the multidimensional assignment problem (English)
    0 references
    0 references
    0 references
    0 references
    25 August 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    multidimensional assignment problem
    0 references
    combinatorial optimization
    0 references
    computational results
    0 references
    0 references