Adapting polyhedral properties from facility to hub location problems (Q705504): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 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.dam.2003.09.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2024503399 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Two-Level Uncapacitated Facility Location Problem / 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: New facets for the set packing polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the facets of the simple plant location packing polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some facets of the simple plant location polytope / 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: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional vertices, cuts and facets of the simple plant location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The simple plant location problem: Survey and synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776481 / 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: On the facial structure of set packing polyhedra / 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: A linear program for the two-hub location problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The single allocation problem in the interacting three-hub network / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:49, 7 June 2024

scientific article
Language Label Description Also known as
English
Adapting polyhedral properties from facility to hub location problems
scientific article

    Statements

    Adapting polyhedral properties from facility to hub location problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    31 January 2005
    0 references
    Integer programming
    0 references
    Hub location
    0 references
    Facility location
    0 references
    Valid inequality
    0 references
    Facet
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers