New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem (Q1926700): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2012.01.042 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023704570 / 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: Preprocessing and cutting for multiple allocation hub location problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Location and allocation for distribution systems with transshipments and transportion economies of scale / 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: Q3147668 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique / rank
 
Normal rank
Property / cites work
 
Property / cites work: New formulations for the uncapacitated multiple allocation hub location problem / 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: Solving large single allocation \(p\)-hub problems with two or three hubs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Solution Approach Based on Shortest-Paths for <i>p</i>-Hub Median Problems / 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: Adapting polyhedral properties from facility to hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the uncapacitated hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub network design with single and multiple allocation: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New facets and a branch-and-cut algorithm for the weighted clique problem. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:27, 6 July 2024

scientific article
Language Label Description Also known as
English
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
scientific article

    Statements

    New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem (English)
    0 references
    0 references
    0 references
    0 references
    29 December 2012
    0 references
    hub location
    0 references
    discrete location
    0 references
    integer programming
    0 references

    Identifiers