Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solution approaches to hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network hub location problems: The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical bilevel optimization. Algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and cutting for multiple allocation hub location problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu-search based heuristic for the hub covering problem over incomplete hub networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulations of discrete hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Location and the <i>p</i>-Hub Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benders Decomposition for Large-Scale Uncapacitated Hub Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of bilevel programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A leader-follower model for discrete competitive facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conditional \(p\)-hub location problem with attraction functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the uncapacitated single allocation p-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution algorithms for the capacitated single allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing-based heuristic for the single allocation maximal covering hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential competitive location on networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A leader-follower game in competitive facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: A competitive hub location and pricing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub location under competition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location of hubs in a competitive environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equation of State Calculations by Fast Computing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: A quadratic integer program for the location of interacting hub facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: HUB NETWORK DESIGN MODEL IN A COMPETITIVE ENVIRONMENT WITH FLOW THRESHOLD / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stackelberg hub arc location model for a competitive environment / rank
 
Normal rank
Property / cites work
 
Property / cites work: STACKELBERG HUB LOCATION PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: New simple and efficient heuristics for the uncapacitated single allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search heuristic for the uncapacitated single allocation \(p\)-hub maximal covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tabu search for the location of interacting hub facilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hub covering model for cargo delivery systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the uncapacitated hub location problem using genetic algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on ``Location of hubs in a competitive environment'' / rank
 
Normal rank

Latest revision as of 02:15, 16 July 2024

scientific article
Language Label Description Also known as
English
Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems
scientific article

    Statements

    Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 July 2018
    0 references
    hub location
    0 references
    market competition
    0 references
    mathematical formulation
    0 references
    simulated annealing
    0 references

    Identifiers