A simple proof of a general duality theorem of convex programming. - Balder Von Hohenbalken (Unternehmensforschung, 1969)

Efficient and optimal portfolios by homogeneous programming. - Paul van Moeseke; Balder Von Hohenbalken (Z. Oper. Research, 1974)

A finite algorithm to maximize certain pseudoconcave functions on polytopes. - Balder Von Hohenbalken (Math. Program., 1975)

Simplicial decomposition in nonlinear programming algorithms. - Balder Von Hohenbalken (Math. Program., 1977)

Least distance methods for the scheme of polytopes. - Balder Von Hohenbalken (Math. Program., 1978)

Book review: "Calculating the frame of homogeneous equation systems". - Balder Von Hohenbalken (ACM SIGAPL APL Quote Quad, 1979)

Uniform sampling on simplices and spheres. - Balder Von Hohenbalken (ACM SIGAPL APL Quote Quad, 1980)

Finding simplicial subdivisions of polytopes. - Balder Von Hohenbalken (Math. Program., 1981)

The discrete p-Maxian location problem. - Erhan Erkut; Thomas Baptie; Balder Von Hohenbalken (Comput. Oper. Res., 1990)

Appollonius Revisited: Supporting Spheres for Sundered Systems. - Victor Klee; T. Lewis; Balder Von Hohenbalken (Discret. Comput. Geom., 1997)