Pages that link to "Item:Q1403283"
From MaRDI portal
The following pages link to Approximation schemes for NP-hard geometric optimization problems: a survey (Q1403283):
Displaying 26 items.
- Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
- Polynomial-time approximation schemes for subset-connectivity problems in bounded-genus graphs (Q476424) (← links)
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
- On the minimum corridor connection problem and other generalized geometric problems (Q833722) (← links)
- Subsets of rectifiable curves in Hilbert space-the analyst's TSP (Q926387) (← links)
- On single courier problem (Q941049) (← links)
- Degree-bounded minimum spanning trees (Q1028423) (← links)
- Steiner intervals, geodesic intervals, and betweenness (Q1045107) (← links)
- Location, pricing and the problem of Apollonius (Q1686568) (← links)
- Approximating the generalized minimum Manhattan network problem (Q1751089) (← links)
- Heuristic optimization for multi-depot vehicle routing problem in ATM network model (Q2087124) (← links)
- A convex approach to the Gilbert-Steiner problem (Q2194559) (← links)
- Approximating minimum Manhattan networks in higher dimensions (Q2258071) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- A Quasi-polynomial Time Approximation Scheme for Euclidean CVRPTW (Q2942382) (← links)
- Approximating minimum Steiner point trees in Minkowski planes (Q3064040) (← links)
- A $$(1+{\varepsilon })$$ ( 1 + ε ) -Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q3448808) (← links)
- Continuous reformulations and heuristics for the Euclidean travelling salesperson problem (Q3643507) (← links)
- Variational Approximation of Functionals Defined on 1-dimensional Connected Sets: The Planar Case (Q4562017) (← links)
- On the Computation of Kantorovich--Wasserstein Distances Between Two-Dimensional Histograms by Uncapacitated Minimum Cost Flows (Q5124004) (← links)
- A $(1+\varepsilon)$-Embedding of Low Highway Dimension Graphs into Bounded Treewidth Graphs (Q5376438) (← links)
- Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems (Q5860477) (← links)
- Dynamic programming approach to the generalized minimum Manhattan network problem (Q5918463) (← links)
- Literature reviews in operations research: a new taxonomy and a meta review (Q6106580) (← links)
- Optimal transport methods for combinatorial optimization over two random point sets (Q6193775) (← links)
- Quasi-polynomial time approximation schemes for assortment optimization under Mallows-based rankings (Q6634523) (← links)
