Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems (Q1026110): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.2008.11.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968036138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for classification problems with pairwise relationships / 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: Integer programming formulations of discrete hub location problems / 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: Projecting the flow variables for hub location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for hub location problems with single assignment / 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
Property / cites work
 
Property / cites work: The Hardness of Metric Labeling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic and semidefinite programming relaxations in scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of the quadratic semi-assignment polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dependent randomized rounding algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives of Monge properties in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem / rank
 
Normal rank

Latest revision as of 17:33, 1 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
scientific article

    Statements

    Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems (English)
    0 references
    0 references
    0 references
    0 references
    24 June 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    hub location
    0 references
    metric labeling
    0 references
    approximation algorithm
    0 references
    dependent rounding
    0 references
    0 references