×
Target groups Quicklinks
Publication series Cottbus Mathematical Preprints
Berechnung der Trajektorien für die Entwicklung von optimalen Routen Author(s) M. Fawad Zazai Type doctoralthesis Year of completion 2020 Kürzeste Wege; Trajektorienplanung; Optimale Routen; Multikriterielle Optimierung (Pareto-Front); Geoinformationssysteme; Shortest paths; Trajectory planning; Optimal routes; Multi-criteria optimization (Pareto frontier); Geographic information system URN urn:nbn:de:kobv:co1-opus4-52286 DOI https://doi.org/10.26127/BTUOpen-5228 Stochastic mixed-integer programming for a spare parts inventory management problem Author(s) Leonie M. Johannsmann, Emily M. Craparo, Thor L. Dieken, Armin Fügenschuh, Björn O. Seitner Type workingpaper Year of completion 2020 Logisitcs; Scenario generation; Uncertainty; Warehouse management; Operations research; Two-stage stochastic optimization; Mixed-integer programming; Logistik; Szenario-Erzeugung; Unsicherheit; Lagermanagement; Gemischt-ganzzahlige Optimierung; Unternehmensforschung; Zweistufige stochastische Optimierung URN urn:nbn:de:kobv:co1-opus4-50802 DOI https://doi.org/10.26127/BTUOpen-5080 A new mathematical model for a 3D container packing problem Author(s) Valentina E. Ocloo, Armin Fügenschuh, Olivier M. Pamen Type workingpaper Year of completion 2020 Container packing problem; Mixed-integer programming; Box orientation; Non-overlapping; Center of gravity deviation URN urn:nbn:de:kobv:co1-opus4-50880 DOI https://doi.org/10.26127/BTUOpen-5088 Branch-and-refine for solving time-dependent problems Author(s) Fabian Gnegel, Armin Fügenschuh Type workingpaper Year of completion 2020 Graphenverfeinerung; Branch-and-Bound; Kürzeste Wege Problem mit Zeitfenstern; Problem des Handlungsreisenden mit Zeitfenstern; Graph refinement; Branch-and-bound; Shortest path problem with time-windows; Travelling salesman problem with time-windows URN urn:nbn:de:kobv:co1-opus4-51995 DOI https://doi.org/10.26127/BTUOpen-5199 Eine Anwendung der ganzzahligen Optimierung auf die Stundenplanerstellung einer Unteroffiziersschule der Bundeswehr Author(s) Tabea Werger Type bachelorthesis Year of completion 2019 Mixed-integer programming; Operational research; School time table planning URN urn:nbn:de:kobv:co1-opus4-48036 DOI https://doi.org/10.26127/BTUOpen-4803 An iterative graph expansion approach for the scheduling and routing of airplanes Author(s) Fabian Gnegel, Armin Fügenschuh Type report Year of completion 2019 Mixed Integer Linear Programming; Operational Research; Vehicle Routing Problem; Time-Dependent Airplane Routing; Dynamic Graph Expansion URN urn:nbn:de:kobv:co1-opus4-48069 DOI https://doi.org/10.26127/BTUOpen-4806 Dealing with time in the multiple traveling salesmen problem with moving targets Author(s) Anke Stieber, Armin Fügenschuh Type report Year of completion 2019 Dynamic traveling salesmen problem; Moving targets; Time-relaxation; Integer linear programming; Second-order cone programming URN urn:nbn:de:kobv:co1-opus4-48245 DOI https://doi.org/10.26127/BTUOpen-4824 A new heuristic and an exact approach for a production planning problem Author(s) Peter Auer, György Dósa, Tibor Dulai, Armin Fügenschuh, Peggy Näser, Ronald Ortner, Ágnes Werner-Stark Type report Year of completion 2019 Production planning; Mixed-integer programming; Heuristics; Simulation URN urn:nbn:de:kobv:co1-opus4-48278 DOI https://doi.org/10.26127/BTUOpen-4827 A solution framework for linear PDE-constrained mixed-integer problems Author(s) Fabian Gnegel, Armin Fügenschuh, Michael Hagel, Sven Leyffer, Marcus Stiemer Type report Year of completion 2019 Mixed-integer linear programming; Partial differential equations; Finite-element methods; Convection-diffusion equation; Global optimal control; Gemischt-ganzzahlige lineare Programmierung; Globale Optimalsteuerung; Konvektions-Diffusions-Gleichung; Finite-Elemente-Methode; Partielle Differentialgleichungen URN urn:nbn:de:kobv:co1-opus4-50453 DOI https://doi.org/10.26127/BTUOpen-5045 Mission planning for unmanned aerial vehicles Author(s) Armin Fügenschuh, Daniel Müllenstedt, Johannes Schmidt Type report Year of completion 2019 Mixed-integer nonlinear programming; Trajectory planning; Unmanned aerial vehicles; Linear approximation URN urn:nbn:de:kobv:co1-opus4-48285 DOI https://doi.org/10.26127/BTUOpen-4828
This website uses cookies. There are two types of cookies: The first type supports the basic functionality of our website. The second allows us to improve our content for you by saving and analyzing pseudonymised user data. Since this second type is technically not required to run the website, you can withdraw your consent to those cookies at any time. For more information please visit our pages on data protection .
Settings
Accept mandatory Cookies
Accept all cookies
Save settings
×
