@misc{AliSarkarAlietal., author = {Ali, Irfan and Sarkar, Biswajit and Ali, Syed Mithun and F{\"u}genschuh, Armin}, title = {Editorial: Environmental waste and renewable energy optimization for the sustainable development goals achievement}, series = {Frontiers in Environmental Science}, volume = {11}, journal = {Frontiers in Environmental Science}, issn = {2296-665X}, doi = {10.3389/fenvs.2023.1167835}, language = {en} } @misc{FuegenschuhLorenzPelz, author = {F{\"u}genschuh, Armin and Lorenz, Ulf and Pelz, Peter F.}, title = {OPTE special issue on technical operations research (TOR)}, series = {Optimization and Engineering}, volume = {22}, journal = {Optimization and Engineering}, number = {2}, issn = {1389-4420}, doi = {10.1007/s11081-021-09640-0}, pages = {581 -- 586}, language = {en} } @misc{RahmanShaikhAlietal., author = {Rahman, Md Sadikur and Shaikh, Ali Akbar and Ali, Irfan and Bhunia, Asoke Kumar and F{\"u}genschuh, Armin}, title = {A Theoretical Framework for Optimality Conditions of Nonlinear Type-2 Interval-Valued Unconstrained and Constrained Optimization Problems Using Type-2 Interval Order Relations}, series = {Mathematics}, volume = {9}, journal = {Mathematics}, number = {8}, issn = {2227-7390}, doi = {10.3390/math9080908}, language = {en} } @misc{MaierKuhnBeisegeletal., author = {Maier, Isidor Konrad and Kuhn, Johannes and Beisegel, Jesse and Huber-Liebl, Markus and Wolff, Matthias}, title = {Minimalist Grammar: Construction without Overgeneration}, series = {arXiv}, journal = {arXiv}, doi = {10.48550/arXiv.2311.01820}, pages = {51}, abstract = {In this paper we give instructions on how to write a minimalist grammar (MG). In order to present the instructions as an algorithm, we use a variant of context free grammars (CFG) as an input format. We can exclude overgeneration, if the CFG has no recursion, i.e. no non-terminal can (indirectly) derive to a right-hand side containing itself. The constructed MGs utilize licensors/-ees as a special way of exception handling. A CFG format for a derivation A_eats_B↦∗peter_eats_apples, where A and B generate noun phrases, normally leads to overgeneration, e.\,g., i_eats_apples. In order to avoid overgeneration, a CFG would need many non-terminal symbols and rules, that mainly produce the same word, just to handle exceptions. In our MGs however, we can summarize CFG rules that produce the same word in one item and handle exceptions by a proper distribution of licensees/-ors. The difficulty with this technique is that in most generations the majority of licensees/-ors is not needed, but still has to be triggered somehow. We solve this problem with ϵ-items called \emph{adapters}.}, language = {en} } @phdthesis{Schmidt, author = {Schmidt, Johannes}, title = {The mission and flight planning problem : a physics-based MILP routing approach for an inhomogeneous fleet of unmanned aerial vehicles with collision-free trajectories.}, publisher = {BTU Cottbus-Senftenberg}, doi = {10.26127/BTUOpen-6841}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-68415}, pages = {138}, language = {en} } @techreport{Roman, author = {Roman, Anschel Julio}, title = {K{\"u}nstliche Neurale Netze in biomedizinischen Anwendungen}, doi = {10.26127/BTUOpen-5630}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-56309}, pages = {74}, language = {de} } @techreport{Zhongh, author = {Zhongh, Lingyu}, title = {Set Covering Probleme in der Funknetzplanung}, doi = {10.26127/BTUOpen-6355}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-63556}, pages = {59}, language = {de} } @techreport{TchoutoMbatchou, author = {Tchouto Mbatchou, Thierry}, title = {Training of artificial neuronal networks with nonlinear optimization techniques}, doi = {10.26127/BTUOpen-5404}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-54042}, pages = {65}, language = {en} } @phdthesis{Stieber, author = {Stieber, Anke}, title = {The multiple traveling salesperson problem with moving targets}, doi = {10.26127/BTUOpen-6110}, url = {http://nbn-resolving.de/urn:nbn:de:kobv:co1-opus4-61104}, pages = {107}, language = {en} } @techreport{Zell, author = {Zell, Sascha}, title = {Agentenbasierte Modellierung und Simulation der Rettungskette : eine Fallstudie in der Lausitz}, doi = {10.26127/BTUOpen-5873}, language = {de} } @techreport{Werger, author = {Werger, Tabea}, title = {Instandhaltungsprogramm - NH90 : ein ganzzahliger Ansatz zur Optimierung des Instandhaltungsprogramms eines milit{\"a}rischen Luftfahrzeugs}, doi = {10.26127/BTUOpen-5872}, url = {http://nbn-resolving.de/rn:nbn:de:kobv:co1-opus4-58724}, pages = {96}, language = {de} } @misc{BeisegelRatajczakScheffler, author = {Beisegel, Jesse and Ratajczak, Fabienne and Scheffler, Robert}, title = {Computing hamiltonian paths with partial order restrictions}, series = {ACM Transactions on Computation Theory}, volume = {17}, journal = {ACM Transactions on Computation Theory}, number = {1}, issn = {1942-3454}, doi = {10.1145/3711844}, pages = {1 -- 24}, abstract = {When solving the Hamiltonian path problem it seems natural to be given additional precedence constraints for the order in which the vertices are visited. For example, one could decide whether a Hamiltonian path exists for a fixed starting point, or that some vertices are visited before another vertex. We consider the problem of finding a Hamiltonian path that observes all precedence constraints given in a partial order on the vertex set. We show that this problem is NP-complete even if restricted to complete bipartite graphs and posets of height 2. In contrast, for posets of width k there is a known O(k^2 n^k) algorithm for arbitrary graphs with n vertices. We show that it is unlikely that the running time of this algorithm can be improved significantly, i.e., there is no f(k) n^o(k) time algorithm under the assumption of the Exponential Time Hypothesis. Furthermore, for the class of outerplanar graphs, we give an O(n^2) algorithm for arbitrary posets.}, language = {en} } @misc{Fuegenschuh, author = {F{\"u}genschuh, Armin}, title = {MEDEVAC mission planning and decision making with mixed-integer programming and wargaming}, series = {Proceedings of the 18th NATO Operations Research and Analysis (OR\&A) Conference}, volume = {STO-MP-SAS-192}, journal = {Proceedings of the 18th NATO Operations Research and Analysis (OR\&A) Conference}, publisher = {NATO Science and Technology Organization (STO)}, isbn = {978-92-837-2580-0}, doi = {10.14339/STO-MP-SAS-192-15-PDF}, pages = {1 -- 14}, abstract = {In the highly dynamic environment of military operations, efficient medical evacuation (MEDEVAC) of casualties is a critical strategic challenge. This paper presents a method for planning MEDEVAC missions using mathematical optimization and gamification. By applying Mixed-Integer Programming (MIP), a mathematical optimization technique, to solve a MEDEVAC dispatching and routing problem, a structured approach to decision making in emergency situations is presented. Our MIP model enables the detailed consideration of operational conditions and the mission support with combat helicopters as escorts, and thus improves the strategic planning and efficiency of MEDEVAC operations. When it comes to balance mission safety versus execution speed, we will enter the realm of multicriteria optimization models. As a further aspect, the role of gamification is emphasized by developing a board game that simulates the planning task and thus promotes understanding of the planning software. This approach allows planners to compare the quality of their manual planning with the computer-generated solution, improve their own planning skills and realize the benefits of software support for automated, AI- (Artificial Intelligence-) -assisted planning.}, language = {en} } @misc{BeisegelKlostKnorretal., author = {Beisegel, Jesse and Klost, Katharina and Knorr, Kristin and Ratajczak, Fabienne and Scheffler, Robert}, title = {A graph width perspective on partially ordered Hamiltonian paths and cycles II : vertex and edge deletion numbers}, series = {20th International Symposium on Parameterized and Exact Computation (IPEC 2025)}, journal = {20th International Symposium on Parameterized and Exact Computation (IPEC 2025)}, editor = {Agrawal, Akanksha and van Leeuwen, Erik Jan}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"u}r Informatik}, address = {Wadern}, isbn = {978-3-95977-407-9}, doi = {10.4230/LIPIcs.IPEC.2025.30}, url = {http://nbn-resolving.de/urn:nbn:de:0030-drops-251623}, pages = {30:1 -- 30:19}, abstract = {We consider the problem of finding a Hamiltonian path or cycle with precedence constraints in the form of a partial order on the vertex set. We study the complexity for graph width parameters for which the ordinary problems Hamiltonian Path and Hamiltonian Cycle are in FPT. In particular, we focus on parameters that describe how many vertices and edges have to be deleted to become a member of a certain graph class. We show that the problems are W[1]-hard for such restricted cases as vertex distance to path and vertex distance to clique. We complement these results by showing that the problems can be solved in XP time for vertex distance to outerplanar and vertex distance to block. Furthermore, we present some FPT algorithms, e.g., for edge distance to block. Additionally, we prove para-NP-hardness when considered with the edge clique cover number.}, language = {en} } @techreport{ZellFuegenschuh, author = {Zell, Sascha and F{\"u}genschuh, Armin}, title = {Optimizing autonomous unmanned aircraft system deployment locations for enhanced wildfire detection and monitoring}, publisher = {Brandenburgische Technische Universit{\"a}t Cottbus-Senftenberg}, address = {Cottbus}, issn = {2627-6100}, doi = {10.26127/BTUOpen-6942}, pages = {16}, abstract = {The increase in the frequency and severity of wildfires as a symptom of climate change requires innovative methods of wildfire fighting. For this reason, we propose a framework for an autonomous Unmanned Aircraft System (UAS), consisting of a fleet of Micro Air Vehicles (MAVs) stored in purpose-built hangars. The intention is to deploy the UAS as the first responder to an alarm and have the sensor-equipped MAVs monitor the target area even before other standard firefighting vehicles have arrived. The focus of this paper is primarily on the development and application of a location-allocation optimization Mixed-Integer Linear Programming (MILP) model that selects different MAV and hangar types and locates them, with the objective of approaching the target area as quickly as possible while guaranteeing a certain monitoring time at the scene. The model is applied to a large, sparsely populated, rural operational area, around a third of which consists of forest in the South of Brandenburg, Germany. The spatial demand is measured through an easily reproducible and transferable open data approach. Finally, several instances with different fixed numbers of hangars and MAVs to be set up are solved by the commercial state-of-the-art solver CPLEX and analyzed for their computation time.}, language = {en} } @incollection{SchmidtFuegenschuh, author = {Schmidt, Johannes and F{\"u}genschuh, Armin}, title = {A column generation approach for weighted set packing problems with forbidden pairs}, series = {Operations Research Proceedings 2023 : selected papers of the Annual International Conference of the German Operations Research Society (GOR), Germany, August 29-September 1, 2023}, booktitle = {Operations Research Proceedings 2023 : selected papers of the Annual International Conference of the German Operations Research Society (GOR), Germany, August 29-September 1, 2023}, publisher = {Springer Nature Switzerland}, address = {Cham}, isbn = {978-3-031-58405-3}, issn = {2731-040X}, doi = {10.1007/978-3-031-58405-3_14}, pages = {107 -- 113}, abstract = {The weighted set packing problem (WSPP) is a variant of the well-known set packing problem, assigning a weight to every considered subset of a given finite base set. Its solution is a maximum sum-weight, element-disjoint covering of the base set. Using its formulation as a binary linear program (BLP), every column of the constraint matrix describes one of the given subsets. Thus, column generation (CG) provides a good solution method, generating iteratively only promising subsets as candidates for the covering. We consider an extension of the WSPP, where forbidden pairs are taken into consideration, i.e., there can be pairs of subsets that cannot be chosen at the same time, and adapt CG to derive a new solution algorithm to solve the resulting BLP. At each iteration, the optimal solution obtained with CG is checked for potential conflicts and either they are resolved locally without changing the objective function value or a new linear constraint forbidding the conflicting pair of columns is added. Then the CG procedure starts again. The applicability of this approach is shown for a team orienteering problem involving two unmanned aerial vehicles that must maintain safety distances between them.}, language = {en} } @techreport{SchmidtFuegenschuh, author = {Schmidt, Johannes and F{\"u}genschuh, Armin}, title = {Inter-sample avoidance in trajectory planning via an integer-polytope formulation for mixed-integer optimization}, publisher = {Brandenburgische Technische Universit{\"a}t Cottbus-Senftenberg}, address = {Cottbus}, issn = {2627-6100}, doi = {10.26127/BTUOpen-7169}, pages = {19}, abstract = {Autonomous vehicles such as drones or mobile robots must plan trajectories that avoid static obstacles. Their dynamics are captured by Newton's laws and discretized numerically, so the vehicle's position is tracked only at finitely many sample points. The resulting information gap allows a path to cut through an obstacle while still appearing feasible at all samples, a phenomenon called corner cutting. Finer time grids mitigate but never eliminate this artefact and increase computation time. We propose a new inter-sample avoidance scheme for polyhedral obstacles. The facet-defining half-spaces partition the three-dimensional mission space into sub-domains that we encode with binary sign vectors. Feasible one-step moves correspond to a specific subset of these vectors; we (i) enumerate that set exhaustively and (ii) give an integer-polytope formulation that enforces it without additional state variables or extra time steps. For planar motion with a single triangular no-fly zone we prove that the formulation is tight-the polytope equals the convex hull of its 0/1 points. The method is compared qualitatively with existing inter-sample avoidance techniques and its limitations are discussed. Computational experiments with a mixed-integer linear programming model for UAV mission planning, solved by Gurobi, demonstrate that the new formulation achieves realistic trajectories at competitive, or lower, solution times}, language = {en} } @techreport{SchmidtFuegenschuhBoeschow, author = {Schmidt, Johannes and F{\"u}genschuh, Armin and B{\"o}schow, Moritz}, title = {Sports league scheduling with minitournaments}, publisher = {Brandenburgische Technische Universit{\"a}t Cottbus-Senftenberg}, address = {Cottbus}, issn = {2627-4019}, doi = {10.26127/BTUOpen-7029}, pages = {15}, abstract = {In amateur or youth sports leagues, the teams play all matches during their leisure time. Thus, a schedule with a smaller number of game days is preferred and the teams are willing to partly renounce on the fairness for this by playing minitournaments instead of single matches. In this format, multiple teams meet at one of them and play against each other, reducing the number of necessary game days and required referees at the cost of unevenly distributed home field advantages. The travel times of all teams now depend on their assignment to the respective minitournaments and the choice of the home team. We present a binary linear optimization model to schedule a sports league as a double Round Robin tournament with minitournaments and most evenly distributed home field advantages, yielding a feasible league schedule with minimal total traveling distances for all teams. After adjusting orbital shrinking to break the occurring symmetries in the possible assignments, we discuss the computational efficiency and evaluate an existing schedule for the "Basketball Senioren Landesliga Brandenburg" amateur basketball league in Germany.}, language = {en} }