Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4398375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Design Using Cut Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for a network loading problem with multiple facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Network Design—Polyhedral Structure and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of GRASP-Part II: Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backbone Network Design Tools with Economic Tradeoffs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for capacitated network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient implementation of an algorithm for findingK shortest simple paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of diversification strategies for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths, single origin‐destination network design, and associated polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The convex hull of two core capacitated network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Two-Facility Capacitated Network Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks synthesis and optimum network design problems: Models, solution methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic diversification and intensification in local search for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On algorithms for finding the k shortest paths in a network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diversification strategies in tabu search algorithms for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive memory programming: a unified view of metaheuristics / rank
 
Normal rank

Revision as of 17:44, 4 June 2024

scientific article
Language Label Description Also known as
English
Diversification strategies in local search for a nonbifurcated network loading problem
scientific article

    Statements

    Diversification strategies in local search for a nonbifurcated network loading problem (English)
    0 references
    0 references
    0 references
    0 references
    20 November 2002
    0 references
    Network loading problem
    0 references
    Metaheuristics
    0 references
    Local search
    0 references
    Diversification
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers