Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (Q3009753): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
aliases / en / 0aliases / en / 0
 
Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems
description / endescription / en
scientific article
scientific article; zbMATH DE number 6610523
Property / title
 
Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems (English)
Property / title: Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1371.90074 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/moor.2015.0758 / rank
 
Normal rank
Property / published in
 
Property / published in: Mathematics of Operations Research / rank
 
Normal rank
Property / publication date
 
10 August 2016
Timestamp+2016-08-10T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 10 August 2016 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://semanticscholar.org/paper/60e75893e4b3ff8f0f4c4f371933809fa6fe1584 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6610523 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2325833190 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1009.2452 / rank
 
Normal rank
Property / zbMATH Keywords
 
facilty location
Property / zbMATH Keywords: facilty location / rank
 
Normal rank
Property / zbMATH Keywords
 
latency problems
Property / zbMATH Keywords: latency problems / rank
 
Normal rank
Property / zbMATH Keywords
 
approximation algorithms
Property / zbMATH Keywords: approximation algorithms / rank
 
Normal rank
Property / zbMATH Keywords
 
linear programming relaxations
Property / zbMATH Keywords: linear programming relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster, Better Approximation Algorithm for the Minimum Latency Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542528 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating min sum set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survivable networks, linear programming relaxations and the parsimonious property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing the Held-Karp TSP bound: A monotonicity property with application / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic analysis, linear programming and branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple intents re-ranking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preserving and Increasing Local Edge-Connectivity in Mixed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the prize collecting traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579459 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Provisioning a virtual private network / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471308 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938770 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual algorithms for connected facility location problems / rank
 
Normal rank

Latest revision as of 09:04, 12 July 2024

scientific article; zbMATH DE number 6610523
  • Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems
Language Label Description Also known as
English
Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems
scientific article; zbMATH DE number 6610523
  • Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems

Statements

Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems (English)
0 references
Facility Location with Client Latencies: LP-Based Techniques for Minimum-Latency Problems (English)
0 references
0 references
0 references
24 June 2011
0 references
10 August 2016
0 references
facilty location
0 references
latency problems
0 references
approximation algorithms
0 references
linear programming relaxations
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references