Preprocessing and cutting for multiple allocation hub location problems. (Q1427587): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(8 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Mohan Krishnamoorthy / rank
Normal rank
 
Property / author
 
Property / author: Andreas T. Ernst / rank
Normal rank
 
Property / author
 
Property / author: Mohan Krishnamoorthy / rank
 
Normal rank
Property / author
 
Property / author: Andreas T. Ernst / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MINTO / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulation of capacitated facility location problems: How redundant information can help / 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: Solving large single allocation \(p\)-hub problems with two or three hubs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacitated multiple allocation hub location problem: Formulations and algorithms / 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: An Exact Solution Approach Based on Shortest-Paths for <i>p</i>-Hub Median Problems / 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: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: HubLocator: An exact solution method for the multiple allocation hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINTO, a Mixed INTeger Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / 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: Solving Mixed Integer Programming Problems Using Automatic Reformulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight linear programming relaxations of uncapacitated \(p\)-hub median problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(03)00072-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045691061 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:31, 30 July 2024

scientific article
Language Label Description Also known as
English
Preprocessing and cutting for multiple allocation hub location problems.
scientific article

    Statements

    Preprocessing and cutting for multiple allocation hub location problems. (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 March 2004
    0 references
    Location
    0 references
    Integer programming
    0 references
    Hub location
    0 references
    0 references
    0 references
    0 references

    Identifiers