Linear Optimization and Extensions

TL;DR: If a target location and stimulation orientation can be defined by the clinician, then the proposed technique is superior in terms of both focality and intensity as compared to previous solutions and is thus expected to translate into improved patient safety and increased clinical efficacy.

TL;DR: The computational complexity and algorithms of the core are studied to answer important questions about the cores of various games on graphs, such as maximum flow, connectivity, maximum matching, minimum vertex cover, minimum edge cover, maximum independent set, and minimum coloring.

TL;DR: This paper provides a review of numerical methods for the solution of smooth semi-infinite programming problems and presents fundamental and partly new results on level sets, discretization, and local reduction.

TL;DR: A new formulation of the discrete berth allocation problem is proposed, which is shown to be more compact and stronger than another one from the literature; a Lagrangean heuristic algorithm is developed; and computational results are presented.