On packing and covering polyhedra in infinite dimensions
Copyright policy )On packing and covering polyhedra in infinite dimensions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Massachusetts Institute of Technology United States
- The Ohio State University at Marion United States
- Georgia Institute of Technology United States
- The Ohio State University United States
Programming in abstract spaces, packing polyhedron, integral extreme point, infinite linear program, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Linear programming, Packing and covering in \(n\) dimensions (aspects of discrete geometry), Semi-infinite programming, complementary slackness, covering polyhedron
Programming in abstract spaces, packing polyhedron, integral extreme point, infinite linear program, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), Linear programming, Packing and covering in \(n\) dimensions (aspects of discrete geometry), Semi-infinite programming, complementary slackness, covering polyhedron
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).1 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!