A tabu search procedure for multicommodity location/allocation with balancing requirements (Q2367013): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models for multimode multicommodity location problems with interdepot balancing requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound method for multicommodity location with balancing requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Ascent Procedures for Multicommodity Location-Allocation Problems with Balancing Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search techniques. A tutorial and an application to neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search Applied to the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic method for the flow shop sequencing problem / rank
 
Normal rank

Revision as of 17:19, 17 May 2024

scientific article
Language Label Description Also known as
English
A tabu search procedure for multicommodity location/allocation with balancing requirements
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references