Jörg Rambau
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Jörg Rambau has a total of 27 co-authors. Here are the top co-authors by number of shared publications:
- Francisco Santos
Department of Mathematics, Statistics and Computer Science, University of Cantabria, Santander, Spain
9 shared publications - Jesus A. De Loera
Department of Mathematics, University of California, Davis, USA
9 shared publications - Sascha Kurz
Department of Mathematics, University of Bayreuth, Bayreuth, Germany
8 shared publications Cornelius Schwarz
Lehrstuhl Wirtschaftsmathematik, Universität Bayreuth, Bayreuth95440, Germany#TAB
2 shared publications- Konrad Schade
Volkswagen AG
2 shared publications - Miriam Kießling
Universitat Bayreuth 95440 Bayreuth Germany
2 shared publications
Latest Publications
- Open Access
- 12 August 2023
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 70 (3) , 1038-1058
The Visible-Volume Function of a Set of Cameras is Continuous, Piecewise Rational, Locally Lipschitz, and Semi-Algebraic in All Dimensions
The visible-volume function assigns to a configuration of cameras and a flexible environment in a convex room the volume that can be supervised by the cameras. It is of interest to configure the cameras and the environment in such a way that the visible volume is maximized. Some methods of global optimization can take profit from desirable analytic properties of the visible-volume function. Earlier work has only considered this function in dimensions two and three or for static environments implicitly defined by level-set functions. In this paper it is shown, that the visible-volume function for a flexible environment modeled explicitly by a parametrized simplicial complex is continuous, piecewise rational, locally Lipschitz, and semi-algebraic in all dimensions.
- 12 August 2023
- Published by Springer Nature in Discrete & Computational Geometry
- Vol. 70 (3) , 1038-1058
Open AccessThe Visible-Volume Function of a Set of Cameras is Continuous, Piecewise Rational, Locally Lipschitz, and Semi-Algebraic in All Dimensions
The visible-volume function assigns to a configuration of cameras and a flexible environment in a convex room the volume that can be supervised by the cameras. It is of interest to configure the cameras and the environment in such a way that the visible volume is maximized. Some methods of global optimization can take profit from desirable analytic properties of the visible-volume function. Earlier work has only considered this function in dimensions two and three or for static environments implicitly defined by level-set functions. In this paper it is shown, that the visible-volume function for a flexible environment modeled explicitly by a parametrized simplicial complex is continuous, piecewise rational, locally Lipschitz, and semi-algebraic in all dimensions.
- 18 January 2021
- Published by Springer Nature in TOP
- Vol. 29 (3) , 741-780
An exact column-generation approach for the lot-type design problem
- 18 January 2021
- Published by Springer Nature in TOP
- Vol. 29 (3) , 741-780
An exact column-generation approach for the lot-type design problem
- Open Access
An exact column-generation approach for the lot-type design problem
We consider a fashion discounter distributing its many branches with integral multiples from a set of available lot-types. For the problem of approximating the branch and size dependent demand using those lots we propose a tailored exact column generation approach assisted by fast algorithms for intrinsic subproblems, which turns out to be very efficient on our real-world instances as well as on random instances.
Open AccessAn exact column-generation approach for the lot-type design problem
We consider a fashion discounter distributing its many branches with integral multiples from a set of available lot-types. For the problem of approximating the branch and size dependent demand using those lots we propose a tailored exact column generation approach assisted by fast algorithms for intrinsic subproblems, which turns out to be very efficient on our real-world instances as well as on random instances.
- Open Access
- 26 May 2018
- Published by Springer Nature in Operations Research Proceedings
- p. 317-324
Rapid Mathematical Programming for Cooperative Truck Networks
- 26 May 2018
- Published by Springer Nature in Operations Research Proceedings
- p. 317-324
Open AccessRapid Mathematical Programming for Cooperative Truck Networks
- 1 January 2018
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 51 (2) , 284-289
Modeling Demand Propagation in Guaranteed Service Models ⁎ ⁎Project of the Bayreuth research center for modeling and simulation (MODUS).
- 1 January 2018
- Published by Elsevier in IFAC-PapersOnLine
- Vol. 51 (2) , 284-289
Modeling Demand Propagation in Guaranteed Service Models ⁎ ⁎Project of the Bayreuth research center for modeling and simulation (MODUS).
- Open Access
Optimal Opinion Control: The Campaign Problem
Opinion dynamics is nowadays a very common field of research. In this article we formulate and then study a novel, namely strategic perspective on such dynamics: There are the usual normal agents that update their opinions, for instance according the well-known bounded confidence mechanism. But, additionally, there is at least one strategic agent. That agent uses opinions as freely selectable strategies to get control on the dynamics: The strategic agent of our benchmark problem tries, during a campaign of a certain length, to influence the ongoing dynamics among normal agents with strategically placed opinions (one per period) in such a way, that, by the end of the campaign, as much as possible normals end up with opinions in a certain interval of the opinion space. Structurally, such a problem is an optimal control problem. That type of problem is ubiquitous. Resorting to advanced and partly non-standard methods for computing optimal controls, we solve some instances of the campaign problem. But even for a very small number of normal agents, just one strategic agent, and a ten-period campaign length, the problem turns out to be extremely difficult. Explicitly we discuss moral and political concerns that immediately arise, if someone starts to analyze the possibilities of an optimal opinion control.
Open AccessOptimal Opinion Control: The Campaign Problem
Opinion dynamics is nowadays a very common field of research. In this article we formulate and then study a novel, namely strategic perspective on such dynamics: There are the usual normal agents that update their opinions, for instance according the well-known bounded confidence mechanism. But, additionally, there is at least one strategic agent. That agent uses opinions as freely selectable strategies to get control on the dynamics: The strategic agent of our benchmark problem tries, during a campaign of a certain length, to influence the ongoing dynamics among normal agents with strategically placed opinions (one per period) in such a way, that, by the end of the campaign, as much as possible normals end up with opinions in a certain interval of the opinion space. Structurally, such a problem is an optimal control problem. That type of problem is ubiquitous. Resorting to advanced and partly non-standard methods for computing optimal controls, we solve some instances of the campaign problem. But even for a very small number of normal agents, just one strategic agent, and a ten-period campaign length, the problem turns out to be extremely difficult. Explicitly we discuss moral and political concerns that immediately arise, if someone starts to analyze the possibilities of an optimal opinion control.
- Open Access
- 1 January 2015
- Published by Journal of Artificial Societies and Social Simulation in Journal of Artificial Societies and Social Simulation
- Vol. 18 (3)
Optimal Opinion Control: The Campaign Problem
Opinion dynamics is nowadays a very common field of research. In this article we formulate and then study a novel, namely strategic perspective on such dynamics: There are the usual 'normal' agents that update their opinions, for instance according the well-known bounded confidence mechanism. But, additionally, there is at least one strategic agent. That agent uses opinions as freely selectable strategies to get control on the dynamics: The strategic agent of our benchmark problem tries, during a campaign of a certain length, to influence the ongoing dynamics among normal agents with strategically placed opinions (one per period) in such a way, that, by the end of the campaign, as much as possible normals end up with opinions in a certain interval of the opinion space. Structurally, such a problem is an optimal control problem. That type of problem is ubiquitous. Resorting to advanced and partly non-standard methods for computing optimal controls, we solve some instances of the campaign problem. But even for a very small number of normal agents, just one strategic agent, and a ten-period campaign length, the problem turns out to be extremely difficult. Explicitly we discuss moral and political concerns that immediately arise, if someone starts to analyze the possibilities of an optimal opinion control.
- 1 January 2015
- Published by Journal of Artificial Societies and Social Simulation in Journal of Artificial Societies and Social Simulation
- Vol. 18 (3)
Open AccessOptimal Opinion Control: The Campaign Problem
Opinion dynamics is nowadays a very common field of research. In this article we formulate and then study a novel, namely strategic perspective on such dynamics: There are the usual 'normal' agents that update their opinions, for instance according the well-known bounded confidence mechanism. But, additionally, there is at least one strategic agent. That agent uses opinions as freely selectable strategies to get control on the dynamics: The strategic agent of our benchmark problem tries, during a campaign of a certain length, to influence the ongoing dynamics among normal agents with strategically placed opinions (one per period) in such a way, that, by the end of the campaign, as much as possible normals end up with opinions in a certain interval of the opinion space. Structurally, such a problem is an optimal control problem. That type of problem is ubiquitous. Resorting to advanced and partly non-standard methods for computing optimal controls, we solve some instances of the campaign problem. But even for a very small number of normal agents, just one strategic agent, and a ten-period campaign length, the problem turns out to be extremely difficult. Explicitly we discuss moral and political concerns that immediately arise, if someone starts to analyze the possibilities of an optimal opinion control.
- Open Access
- 31 October 2014
- Published by Springer Nature in Annals of Operations Research
- Vol. 229 (1) , 541-563
The Top-Dog Index: a new measurement for the demand consistency of the size distribution in pre-pack orders for a fashion discounter with many small branches
- 31 October 2014
- Published by Springer Nature in Annals of Operations Research
- Vol. 229 (1) , 541-563
Open AccessThe Top-Dog Index: a new measurement for the demand consistency of the size distribution in pre-pack orders for a fashion discounter with many small branches
- 26 July 2014
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 80 (2) , 225-226
Erratum to: The stochastic guaranteed service model with recourse for multi-echelon warehouse management
- 26 July 2014
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 80 (2) , 225-226
Erratum to: The stochastic guaranteed service model with recourse for multi-echelon warehouse management
- 5 February 2014
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 79 (3) , 293-326
The stochastic guaranteed service model with recourse for multi-echelon warehouse management
- 5 February 2014
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 79 (3) , 293-326
The stochastic guaranteed service model with recourse for multi-echelon warehouse management