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

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

instance of

scholarly article

0 references

title

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

author

Deeparnab Chakrabarty

0 references

Chaitanya Swamy

0 references

published in

Integer Programming and Combinatoral Optimization

0 references

Mathematics of Operations Research

0 references

publication date

24 June 2011

0 references

10 August 2016

0 references

full work available at URL

https://arxiv.org/abs/1009.2452

0 references

https://semanticscholar.org/paper/60e75893e4b3ff8f0f4c4f371933809fa6fe1584

0 references

describes a project that uses

VRP

0 references

MaRDI profile type

MaRDI publication profile

0 references

zbMATH Keywords

facilty location

0 references

latency problems

0 references

approximation algorithms

0 references

linear programming relaxations

0 references

cites work

A Faster, Better Approximation Algorithm for the Minimum Latency Problem

0 references

The minimum latency problem

0 references

An Optimal Bifactor Approximation Algorithm for the Metric Uncapacitated Facility Location Problem

0 references

Facility Location with Client Latencies: Linear Programming Based Techniques for Minimum Latency Problems

0 references

Q4542528

0 references

Q4471355

0 references

A tight bound on approximating arbitrary metrics by tree metrics

0 references

Approximating min sum set cover

0 references

A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem

0 references

Survivable networks, linear programming relaxations and the parsimonious property

0 references

Q4875179

0 references

Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems

0 references

Polylogarithmic inapproximability

0 references

Q3993417

0 references

Q4526991

0 references

Analyzing the Held-Karp TSP bound: A monotonicity property with application

0 references

The Vehicle Routing Problem

0 references

Heuristic analysis, linear programming and branch and bound

0 references

Multiple intents re-ranking

0 references

Preserving and Increasing Local Edge-Connectivity in Mixed Graphs

0 references

Q5417729

0 references

A note on the prize collecting traveling salesman problem

0 references

Q3579451

0 references

Q3579459

0 references

Provisioning a virtual private network

0 references

A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem

0 references

Q4471308

0 references

Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract)

0 references

Q4938770

0 references

Q5501373

0 references

Primal-dual algorithms for connected facility location problems

0 references

Identifiers

zbMATH Open document ID

1339.90193

0 references

1371.90074

0 references

DOI

10.1007/978-3-642-20807-2_8

0 references

10.1287/moor.2015.0758

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3009753

@@ Property / cites work @@
+Multiple intents re-ranking
@@ Property / cites work: Multiple intents re-ranking / rank @@
+Normal rank
@@ Property / cites work @@
+Preserving and Increasing Local Edge-Connectivity in Mixed Graphs
+Normal rank
@@ Property / cites work @@
+Q5417729
@@ Property / cites work: Q5417729 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on the prize collecting traveling salesman problem
+Normal rank
@@ Property / cites work @@
+Q3579451
@@ Property / cites work: Q3579451 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3579459
@@ Property / cites work: Q3579459 / rank @@
+Normal rank
@@ Property / cites work @@
+Provisioning a virtual private network
@@ Property / cites work: Provisioning a virtual private network / rank @@
+Normal rank
@@ Property / cites work @@
+A 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
+Normal rank
@@ Property / cites work @@
+Q4471308
@@ Property / cites work: Q4471308 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+Q4938770
@@ Property / cites work: Q4938770 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5501373
@@ Property / cites work: Q5501373 / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual algorithms for connected facility location problems
+Normal rank