Pages that link to "Item:Q1149372"

From MaRDI portal

← Weighted min-max location problems: Polynomially bounded algorithms (Q1149372)

Jump to:navigation, search

What links here

⧼whatlinkshere-whatlinkshere-target⧽

Page:

⧼whatlinkshere-whatlinkshere-ns⧽

Namespace:

Invert selection

⧼whatlinkshere-whatlinkshere-filter⧽

Hide transclusions

Hide links

Hide redirects

The following pages link to Weighted min-max location problems: Polynomially bounded algorithms (Q1149372):

Displaying 4 items.

A recursive algorithm for finding the minimum covering sphere of a polytope and the minimum covering concentric spheres of several polytopes (Q689920) (← links)
Solving general continuous single facility location problems by cutting planes (Q1086129) (← links)
The weighted Euclidean 1-center problem (Q1165764) (← links)
(Q5287180) (← links)

Retrieved from "https://portal.mardi4nfdi.de/wiki/Special:WhatLinksHere/Item:Q1149372"