Improved algorithms for joint optimization of facility locations and network connections (Q322548): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an 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.2015.10.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1795617219 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for hard capacitated \(k\)-facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Search Heuristics for <i>k</i>-Median and Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approximation algorithm for the capacitated vehicle routing problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Tree Approximation via Iterative Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Approximation for <i>k</i>-median, and Positive Correlation in Budgeted Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-factor approximation algorithm for the <i>k</i> -median problem (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimum spanning tree algorithm with inverse-Ackermann type complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network design for time‐constrained delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: General network design: a unified view of combined location and network design problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of variants and extensions of the location-routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for a family of matroid intersection problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Uncapacitated Facility Location Problem with Client Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new greedy approach for facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: New approximation algorithms for the Steiner tree problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: VEHICLE SCHEDULING ON A TREE TO MINIMIZE MAXIMUM LATENESS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating k-median via pseudo-approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of recent research on location-routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for the Steiner forest problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Problems Combining Facility Location and Network Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(pn^ 2)\) algorithm for the \(p\)-median and related problems on tree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special cases of traveling salesman and repairman problems with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one‐commodity pickup and delivery travelling salesman problem on a path or a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for the min-max \(k\)-traveling salesmen problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 11/6-approximation algorithm for the network Steiner problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:07, 12 July 2024

scientific article
Language Label Description Also known as
English
Improved algorithms for joint optimization of facility locations and network connections
scientific article

    Statements

    Improved algorithms for joint optimization of facility locations and network connections (English)
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    approximation algorithm
    0 references
    polynomial time algorithm
    0 references
    facility location
    0 references
    network connection
    0 references
    Steiner forest
    0 references
    0 references

    Identifiers