No label defined (Q4955272)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1453000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1453000 |
Statements
5 February 2002
0 references
location
0 references
extensive facilities
0 references
0.8390050530433655
0 references
0.8375770449638367
0 references
0.8329902291297913
0 references
0.832746148109436
0 references
0.8244059085845947
0 references
The authors deal with generalizations of classical location problems in two directions: First, bi-criteria problems are considered, secondly the new facility is an ``extensive'' one, i.e. a path, subtree or cycle in a given network. Objective functions are of the min cost, max cover and min dist sum type. Existing literature is reviewed, integer programming formulations are proposed and the time complexity of the resulting problems is established. For the entire collection see [Zbl 0933.00021].
0 references
