ZIB

Hits per page

hit 1 - 1 | 1 hit

Sorting

Electronic Resource

Optimal scaling of balls and polyhedra (1982)

Eaves, B. C. ; Freund, R. M.

Springer

Mathematical programming 23 (1982), S. 138-147

add to mindlist on the mindlist

Details

ISSN: 1436-4646

Keywords: Linear Programming ; Quadratic Programming ; Optimal Scaling ; Cells ; Balls ; Polyhedral ; Meet ; Containment

Source: Springer Online Journal Archives 1860-2000

Topics: Computer Science , Mathematics

Notes: Abstract The concern is with solving as linear or convex quadratic programs special cases of the optimal containment and meet problems. The optimal containment or meet problem is that of finding the smallest scale of a set for which some translation contains a set or meets each element in a collection of sets, respectively. These sets are unions or intersections of cells where a cell is either a closed polyhedral convex set or a closed solid ball.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01583784

Permalink

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit