PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS
From MaRDI portal
Publication:4818570
DOI10.1142/S0218195902000967zbMath1045.05026MaRDI QIDQ4818570
Takeshi Tokuyama, Naoki Katoh, Hisao Tamaki
Publication date: 29 September 2004
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Transportation, logistics and supply chain management (90B06) Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial complexity of geometric structures (52C45)
Cites Work
- Convexity and Steinitz's exchange property
- The number of small semispaces of a finite set of points in the plane
- More on k-sets of finite sets in the plane
- Geometric lower bounds for parametric matroid optimization
- On minimum and maximum spanning trees of linearly moving points
- How to cut pseudoparabolas into segments
- On levels in arrangements of lines, segments, planes, and triangles
- Improved bounds for planar \(k\)-sets and related problems
- Algorithms for projecting points to give the most uniform distribution with applications to hashing
- Taking a Walk in a Planar Arrangement
- Complexity of some parametric integer and network programming problems
- Optimal Flows in Networks with Multiple Sources and Sinks, with Applications to Oil and Gas Lease Investment Programs
- On k-Hulls and Related Problems
- Optimal flows in networks with multiple sources and sinks
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
