Refine
Year of publication
Document Type
- Article (2148)
- ZIB-Report (1758)
- In Proceedings (1308)
- Master's Thesis (283)
- Book chapter (166)
- Doctoral Thesis (163)
- Other (97)
- Bachelor's Thesis (68)
- In Collection (66)
- Book (65)
Keywords
- integer programming (36)
- mixed integer programming (34)
- KOBV (33)
- optimal control (32)
- Annual Report (28)
- Kooperativer Bibliotheksverbund Berlin-Brandenburg (24)
- Mixed Integer Programming (21)
- Bibliotheksverbund (20)
- mixed-integer programming (19)
- Integer Programming (18)
- Jahresbericht (16)
- column generation (16)
- metastability (15)
- combinatorial optimization (14)
- line planning (14)
- constraint integer programming (13)
- Mixed-Integer Programming (12)
- branch-and-bound (12)
- Optimierung (11)
- Periodic Timetabling (11)
- finite element method (11)
- molecular dynamics (11)
- branch-and-cut (10)
- cluster analysis (10)
- finite elements (10)
- linear programming (10)
- polyhedral combinatorics (10)
- Online Optimization (9)
- network design (9)
- online optimization (9)
- state constraints (9)
- Ganzzahlige Programmierung (8)
- MINLP (8)
- Mixed-Integer Nonlinear Programming (8)
- Optimization (8)
- Periodic Event Scheduling Problem (8)
- Routing (8)
- constraint programming (8)
- interior point methods in function space (8)
- perfect graphs (8)
- Digitale Bibliothek (7)
- Helmholtz equation (7)
- KOBV-Suchmaschine (7)
- MIP (7)
- Open Access (7)
- competitive analysis (7)
- computational complexity (7)
- domain decomposition (7)
- domain propagation (7)
- routing (7)
- systems biology (7)
- treewidth (7)
- visualization (7)
- Constraint Programming (6)
- Markov State Models (6)
- Network Design (6)
- Online-Optimierung (6)
- Periodic timetabling (6)
- Portal (6)
- branching rule (6)
- computer algebra (6)
- cumulative constraint (6)
- hyperthermia (6)
- primal heuristic (6)
- primal heuristics (6)
- rare events (6)
- scheduling (6)
- stable set polytope (6)
- triangulation (6)
- Competitive Analysis (5)
- Cutting Planes (5)
- IP (5)
- Informationsportal (5)
- Markov chain (5)
- Maxwell's equations (5)
- Perron cluster analysis (5)
- QCD (5)
- Rosenbrock methods (5)
- Scheduling (5)
- UMTS (5)
- XML (5)
- adaptive finite elements (5)
- conflict analysis (5)
- conservation laws (5)
- cutting planes (5)
- dust formation (5)
- duty scheduling (5)
- extrapolation methods (5)
- interior point methods (5)
- kombinatorische Optimierung (5)
- large neighborhood search (5)
- lower bounds (5)
- online algorithms (5)
- ordinary differential equations (5)
- parallelization (5)
- preprocessing (5)
- presolving (5)
- public transport (5)
- real-time (5)
- sensitivity analysis (5)
- sojourn time (5)
- statistical shape and intensity models (5)
- symmetry (5)
- trajectory storage (5)
- transparent boundary conditions (5)
- vehicle dispatching (5)
- ADAC (4)
- Classification (4)
- Column Generation (4)
- DHT (4)
- Heuristics (4)
- Large Neighborhood Search (4)
- Linienplanung (4)
- Machine Learning (4)
- Markov chains (4)
- Math-Net (4)
- Molecular Dynamics (4)
- Monte Carlo (4)
- Online-Fernleihe (4)
- Paxos (4)
- Pooling Problem (4)
- Primal Heuristic (4)
- Public transport (4)
- Railway Timetabling (4)
- Railway Track Allocation (4)
- Relaxations (4)
- SAT (4)
- Self-Organizing Maps (4)
- Steiner tree (4)
- Steiner tree packing (4)
- System Dynamics (4)
- Telecommunications (4)
- Ubiquity Generator Framework (4)
- Visualisierung (4)
- adaptivity (4)
- almost invariant sets (4)
- branch and bound (4)
- branch-and-price (4)
- clustering (4)
- dynamical systems (4)
- global optimization (4)
- image segmentation (4)
- lossy compression (4)
- minimal triangulations (4)
- mixed-integer nonlinear programming (4)
- network aggregation (4)
- nonconvex (4)
- online (4)
- optical networks (4)
- optimization software (4)
- parallel tempering (4)
- rapid branching (4)
- reduced basis method (4)
- semidefinite programming (4)
- set partitioning (4)
- shortest path (4)
- soft time windows (4)
- state-dependent processor sharing (4)
- Algorithmen (3)
- Automatic Differentiation (3)
- BBAW (3)
- Bibliotheken (3)
- Column generation (3)
- Combinatorial Optimization (3)
- Conformation Dynamics (3)
- Cumulative Scheduling (3)
- Dienstplanung (3)
- Digibib (3)
- Dublin Core (3)
- Game Theory (3)
- Generalized Baues Problem (3)
- Graphen (3)
- Grid (3)
- Harvest (3)
- KOBV-Fernleihe (3)
- KOBV-Projekt (3)
- Kombinatorische Optimierung (3)
- Lagrangian Relaxation (3)
- Laplace transform (3)
- Linear Programming (3)
- Linear programming (3)
- MIQCP (3)
- MPI (3)
- MSM (3)
- Markov operator (3)
- Markov process (3)
- Mathematical Programming (3)
- Metadaten (3)
- Mixed-integer linear programming (3)
- NESS (3)
- Nahverkehr (3)
- Non-reversible Markov Processes (3)
- Operations Research (3)
- Optimal Experimental Design (3)
- PDE (3)
- Passenger routing (3)
- Peer-to-Peer (3)
- Pseudo-Boolean (3)
- Public Transport (3)
- Resource Allocation (3)
- Robust Optimization (3)
- SCIP (3)
- SDP (3)
- Schrödinger equation (3)
- Schule (3)
- Schur decomposition (3)
- Shortest Path Routing (3)
- Simulation (3)
- Stackelberg Equilibrium (3)
- Statistical shape analysis (3)
- Telecommunication (3)
- Transparent boundary conditions (3)
- Unterricht (3)
- Verbundübergreifende Fernleihe (3)
- Volume Rendering (3)
- Z39.50 (3)
- abs-normal form (3)
- adaptive grid refinement (3)
- adaptive mesh refinement (3)
- adaptive time integration (3)
- approximation (3)
- approximation algorithm (3)
- bio-heat equation (3)
- block structure (3)
- canonical ensemble (3)
- chip verification (3)
- circuit (3)
- conformation (3)
- conformation dynamics (3)
- conformational dynamics (3)
- contraction degeneracy (3)
- counting (3)
- critical edges (3)
- cycle decomposition (3)
- differential equations (3)
- digital preservation (3)
- discrete equations (3)
- discrete optimization (3)
- discretization error (3)
- distributed systems (3)
- dynamic programming (3)
- elevator (3)
- elevator control (3)
- energy system models (3)
- flight planning (3)
- free flight (3)
- frequency assignment (3)
- gemischt-ganzzahlige Programmierung (3)
- heuristics (3)
- high performance computing (3)
- human mandible (3)
- image processing (3)
- integrable systems (3)
- interior-point method (3)
- large polynomial systems (3)
- maximum-weight connected subgraph (3)
- mixed integer nonlinear programming (3)
- mixed-integer linear programming (3)
- mixed-integer semidefinite programming (3)
- model reduction (3)
- model-based inversion (3)
- neural networks (3)
- operative planning (3)
- optical metrology (3)
- parameter estimation (3)
- parameter identification (3)
- partial differential equations (3)
- path-following (3)
- perfectly matched layer (3)
- pole condition (3)
- polyhedra and polytopes (3)
- polynomial inequalities (3)
- preconditioned conjugate gradient methods (3)
- pricing (3)
- probabilistic analysis (3)
- propagation (3)
- railway track allocation (3)
- reaction coordinate (3)
- reaction-diffusion equations (3)
- reproduction (3)
- rigorous optical modeling (3)
- robust optimization (3)
- segmentation (3)
- shellability (3)
- shortest path routing (3)
- stability (3)
- statistical shape model (3)
- strong branching (3)
- survivable network design (3)
- symmetry breaking (3)
- topological charge (3)
- transfers (3)
- transition rates (3)
- transparent boundary condition (3)
- triangulated manifolds (3)
- triangulated surfaces (3)
- uncertainty quantification (3)
- vehicle routing (3)
- vehicle scheduling (3)
- volume rendering (3)
- waiting time (3)
- wavelength assignment (3)
- $n$-pentane molecule (2)
- (non-)rank facet (2)
- 3D reconstruction (2)
- 3D texture mapping (2)
- 3d-reconstruction from 2d X-rays (2)
- 3d-reconstruction from 2d Xrays (2)
- 4062127-3 (2)
- Abstracts (2)
- Algebraic multigrid (2)
- Amira (2)
- Aoki phase (2)
- Approximation Algorithms (2)
- Approximationsalgorithmen (2)
- Archivierung (2)
- Articulated Models, Statistical Shape And Intensity Models, 2D/3D Anatomy Reconstruction, Pelvic Parameters Measurement, Total Hip Arthroplasty (2)
- Aufzugssteuerung (2)
- Autorisierung (2)
- Bayesian inference (2)
- Bibliographisches Datenformat (2)
- Bistellar Operations (2)
- Branch-And-Cut (2)
- Branch-and-Bound (2)
- Branch-and-cut (2)
- Branch-and-price (2)
- Chip-Verifikation (2)
- Clustering (2)
- Computational Diagnosis (2)
- Computer Go (2)
- Computer algebra (2)
- Consensus (2)
- Constraint Programmierung (2)
- Constraint integer programming (2)
- Convex Optimization (2)
- Crack (2)
- Cyclic Polytopes (2)
- DS-MLE (2)
- DVR (2)
- Data Mining (2)
- Dateisystem (2)
- Datenbank (2)
- Digitalisierung (2)
- Dimension Reduction (2)
- Discrete optimization (2)
- Dublettenbehandlung (2)
- Dynamical contact problems (2)
- EM algorithm (2)
- Echtzeit-Optimierung (2)
- Energetic Reasoning (2)
- FGM (2)
- Factors (2)
- Fahrplanung (2)
- Fallstudie (2)
- Fernleihe (2)
- Finite Element Method (2)
- Finite-element method (2)
- Fire Dynamics Simulator (FDS) (2)
- Flammenstrukturen (2)
- Flow Visualization (2)
- Flows in graphs (2)
- GPGPU (2)
- Gas Network Planning (2)
- Gemischt-Ganzzahlige Programmierung (2)
- Girsanov (2)
- Graph Partitioning (2)
- Grid computing (2)
- Groebner bases (2)
- HR-pQCT measurement (2)
- Hamilton systems (2)
- Hamiltonian dynamics (2)
- Hamiltonian system (2)
- Heuristic (2)
- Hilbert's projective metric (2)
- Induced Subdivisions (2)
- Information Retrieval (2)
- Information System (2)
- Informationssysteme (2)
- Integrability (2)
- Integration (2)
- Internet services (2)
- Jeffreys prior (2)
- KKT recursion (2)
- KOBV-Informationsportal (2)
- KOBV-Portal (2)
- Knee Osteoarthritis (2)
- Kniegelenk (2)
- Langzeitverfügbarkeit (2)
- Lattice problem (2)
- Lattice-based cryptography (2)
- Lie groups (2)
- Linienplan (2)
- Lipschitz Continuity (2)
- M/GI/m-PS (2)
- MIPLIB (2)
- MPLE (2)
- Manifold valued statistics (2)
- Markov decision problem (2)
- Markov state model (2)
- Math-Net-Links (2)
- Mathematical modeling (2)
- Medizinische Planung (2)
- Meshfree (2)
- Metadata-Sharing (2)
- Metadaten-Austausch (2)
- Metastabilität (2)
- Metasuchmaschine (2)
- Mixed Integer Nonlinear Programming (2)
- Mixed-integer nonlinear programming (2)
- Mixed-integer semidefinite programming (2)
- Model Selection, (2)
- Modelling (2)
- Molecular Kinetics (2)
- Monte Carlo methods (2)
- Multistage Stochastic Programs (2)
- NP-completeness (2)
- NP-hardness (2)
- NPMLE (2)
- Nachbarschaftssuche (2)
- Nebenläufigkeitskontrolle (2)
- Network Flows (2)
- Network Performance (2)
- Network Planning (2)
- Network design (2)
- Networks (2)
- Netzwerkaggregation (2)
- Newmark method (2)
- Newton-CG (2)
- Nonconvexity (2)
- Nonlinear Programming (2)
- Nonsmooth (2)
- OBBT (2)
- Online Algorithms (2)
- Online Optimierung (2)
- OpenURL (2)
- Operation Research (2)
- Optimierungssoftware (2)
- Optimization solver (2)
- Osteoarthrose (2)
- PDE constrained optimization (2)
- PML (2)
- Packing (2)
- ParaSCIP (2)
- Parallel algorithms (2)
- Parallelization (2)
- Piecewise Linearization (2)
- Polyhedral Combinatorics (2)
- Polyhedral Subdivisions (2)
- Portale (2)
- Poset (2)
- Predictive Maintenance (2)
- Preisplanung (2)
- Primalheuristik (2)
- Primalheuristiken (2)
- Quadratic Programming (2)
- RDF (2)
- REDUCE (2)
- Railway Slot Allocation (2)
- Real-time cell analyzer (2)
- Reduce (2)
- Relaxation (2)
- Reversible Markov Chain (2)
- Robin boundary conditions (2)
- Robust Perron Cluster Analysis (2)
- Rolling Stock Rotation Planning (2)
- Rothe method (2)
- Routing and Wavelength Allocation (2)
- Runge-Kutta methods (2)
- SOCP (2)
- Semantic Web (2)
- Semidefinite Programming (2)
- Shortest vector problem (2)
- Signorini condition (2)
- Sommerfeld radiation condition (2)
- Spaltenerzeugung (2)
- Sparse Geometry Reconstruction (2)
- Spherical (2)
- Standard Quadratic Programming (2)
- Statistical Shape Models (2)
- Steiner Tree Problem (2)
- Steiner tree optimization (2)
- Steiner tree problem (2)
- Steiner tree problems (2)
- Steiner trees (2)
- Stochastic Block Model (2)
- Stochastische Dominanz (2)
- Strukturierte Overlay-Netzwerke (2)
- Suchmaschine (2)
- Suchmaschinen (2)
- Suchmaschinentechnologie (2)
- Sudoku (2)
- System Dynamics; Mixed-Integer Nonlinear Optimization (2)
- TSP (2)
- TVD (2)
- Timetabling (2)
- Toxicity (2)
- Train Routing (2)
- Train Timetabling (2)
- Train Timetabling Problem (2)
- Transportation (2)
- Trapezoidal Rule (2)
- Umlaufplanung (2)
- Uncertainty (2)
- Variational Bayes EM (2)
- Vehicle Routing Problem (2)
- Verbundkooperation (2)
- Verbundportal (2)
- Verteilte Systeme (2)
- Verteilte Transaktionen (2)
- Verteilter Dokumentenserver (2)
- Visualization (2)
- Wide-angle approximation (2)
- Wilson fermions (2)
- Wireless ad hoc networks (2)
- Zählen (2)
- a posteriori error estimates (2)
- acyclic orientations (2)
- adaptive Newton (2)
- adaptive Rothe method (2)
- adaptive methods (2)
- adjoint gradient computation (2)
- algorithmic differentiation (2)
- anomalous diffusion (2)
- approximation algorithms (2)
- assignment (2)
- asymptotic analysis (2)
- atmospheric moist convection (2)
- bed rest (2)
- biochemical conformations (2)
- bipolar orientations (2)
- blood oxygen saturation (2)
- bone structure (2)
- bound tightening (2)
- branch and cut (2)
- branch-and-bound parallelization (2)
- branch-and-cut algorithm (2)
- bridge sampling (2)
- bundle method (2)
- busy period (2)
- case study (2)
- change of measure (2)
- chemical master equation (2)
- chirotope (2)
- classification (2)
- cluster algorithms (2)
- coarse graining (2)
- cocircuit (2)
- column generation framework (2)
- complementarity functions (2)
- complexity (2)
- compressed sparse row format (2)
- compression (2)
- compressive stiffness (2)
- computational (2)
- computations (2)
- concurrency control (2)
- consistency (2)
- convex relaxation (2)
- cow (2)
- critically perfect graphs (2)
- cross-entropy method (2)
- cut selection (2)
- cutting plane selection (2)
- cyclic polytope (2)
- data management (2)
- de-duplication method (2)
- deep convection (2)
- demand function (2)
- demand-wise shared protection (2)
- differential-algebraic systems (2)
- direct connection (2)
- directed networks (2)
- discontinuous solution (2)
- discrete choice model (2)
- discrete dynamical systems (2)
- discrete dynamics (2)
- discrete-continuous algorithm (2)
- distributed library system (2)
- distributed transactions (2)
- drug design (2)
- dual degeneracy (2)
- duty templates (2)
- edge elements (2)
- effective dynamics (2)
- electromagnetic field solver (2)
- electron tomography (2)
- elektronisches Publizieren (2)
- elevator group control (2)
- elliptic partial differential equations (2)
- embedded interface (2)
- energy efficiency (2)
- error estimation (2)
- essential degrees of freedom (2)
- eulerian multigraphs (2)
- exact computation (2)
- extremal combinatorics (2)
- facets (2)
- factorial moments (2)
- fare planning (2)
- feature extraction (2)
- feature lines (2)
- finite volume methods (2)
- finite-element analysis (2)
- fire safety engineering (2)
- flame structures (2)
- flamelet generated manifolds (2)
- flux limiter (2)
- fracture fixation of the distal femur (2)
- free energy (2)
- freed carried traffic (2)
- gas dynamics systems (2)
- gas networks (2)
- generic programming (2)
- graph theory (2)
- graph transformation (2)
- grid (2)
- grid generation (2)
- heat equation (2)
- heat transfer (2)
- hierarchical annealing (2)
- hierarchical basis (2)
- homogenization (2)
- hormone patterns (2)
- hybrid Monte Carlo (2)
- hyperassignment (2)
- hypergraph (2)
- hyperparameter (2)
- hyperprior (2)
- hyperthermia treatment planning (2)
- image registration (2)
- impatient customers (2)
- imperfection ratio (2)
- importance sampling (2)
- inexact Newton methods (2)
- information costs (2)
- information retrieval (2)
- integer optimization (2)
- integrated scheduling (2)
- interior point method (2)
- inverse problem (2)
- inverse problems (2)
- kompetitive Analyse (2)
- kontextsensitives Linking (2)
- kürzeste-Wege Routing (2)
- large-scale integer programming (2)
- linear eddy model (2)
- lognormal duration (2)
- machine learning (2)
- mass action kinetics (2)
- mathematical modelling (2)
- mathematical optimization (2)
- max-cut (2)
- maximum cardinality search (2)
- maximum-weight connected subgraph problem (2)
- mesh coarsening (2)
- metadynamics (2)
- metastable sets (2)
- metric inequalities (2)
- microtubules (2)
- mixed finite elements (2)
- mixed-integer quadratically constrained programming (2)
- model (2)
- molecular conformations (2)
- moments (2)
- multi-layer network design (2)
- multigrid (2)
- multigrid methods (2)
- multilevel finite elements (2)
- multilevel methods (2)
- nasal breathing (2)
- non-equilibrium molecular dynamics (2)
- non-reversible (2)
- nonconvex optimization (2)
- nondestructive testing (2)
- nonequilibrium molecular dynamics (2)
- nonlinear programming (2)
- occupancy distribution (2)
- optical network design (2)
- optimality conditions (2)
- optimality-based bound tightening (2)
- optimization (2)
- optimization solver (2)
- optimization-based bound tightening (2)
- optional activities (2)
- orbitopes (2)
- oriented matroid (2)
- osteosynthesis follow-up (2)
- overflow traffic (2)
- parallelization framework (2)
- parity-flavor symmetry (2)
- peakedness (2)
- peer-to-peer (2)
- perfect graph (2)
- periodic timetabling (2)
- permanent customers (2)
- phase diagram (2)
- piecewise linear tangent approximation (2)
- piecewise smooth (2)
- point configuration (2)
- polyhedral realizations (2)
- polyhedron (2)
- polynomial-time approximation algorithms (2)
- pose estimation (2)
- potential-driven network flows (2)
- precipitating clouds (2)
- precipitation (2)
- prediction (2)
- principle of maximum entropy (2)
- prize-collecting Steiner tree problem (2)
- probabilistic networks (2)
- projection method (2)
- public transit (2)
- quadratic Hamiltonians (2)
- quantitative photoacoustic imaging (2)
- quantum-classical molecular dynamics (2)
- range queries (2)
- rank-perfect graph (2)
- rare event simulation (2)
- real world data (2)
- real-world problems (2)
- reference prior (2)
- reoptimization (2)
- replication (2)
- resource management (2)
- resource-constrained project scheduling (2)
- restricted singular values (2)
- scip (2)
- search engine (2)
- search strategy (2)
- secondary polytope (2)
- semi-algebraic sets (2)
- semidefinite relaxations (2)
- set covering (2)
- set packing (2)
- software (2)
- spectral bundle method (2)
- spectral unmixing (2)
- stability index (2)
- stable multi-sets (2)
- stacker-crane problem (2)
- static evaluation (2)
- stochastic control (2)
- stochastic dominance (2)
- stochastic matrices (2)
- stochastic optimal control (2)
- structured overlay networks (2)
- submission agreement (2)
- supercomputing (2)
- symmetries (2)
- telecommunications (2)
- therapy planning (2)
- transfer operator (2)
- transition manifold (2)
- traveling salesman problem (2)
- tree-sparse QP (2)
- treewidth lower bounds (2)
- turbulence (2)
- turbulence modelling (2)
- turbulent premixed combustion (2)
- two-moment method (2)
- unsplittable flow (2)
- unsupervised classification (2)
- variable selection (2)
- vehicle positioning (2)
- web (2)
- öffentlicher Verkehr (2)
- $M(n)/M(n)/s+GI (1)
- (IIS) maximum feasible subsystem problem (1)
- (visco-)elasticity (1)
- 0-1 Program (1)
- 1/2}-Chvatal-Gomory cuts (1)
- 2-D (1)
- 2-dim Cutting Stock Problem (1)
- 2-photon microscopy (1)
- 2D distance map (1)
- 2d-3d shape reconstruction (1)
- 3-dimensional geometries (1)
- 3-manifolds (1)
- 3D Correspondence Problem (1)
- 3D morphable face model (1)
- 3D neural network (1)
- 4002859-8 (1)
- 4006439-6 (1)
- 4006568-6 (1)
- 4008570-3 (1)
- 4011134-9 (1)
- 4013134-8 (1)
- 4033560-4 (1)
- 4040795-0 (1)
- 4045245-1 (1)
- 4045895-7 (1)
- 4067510-5 (1)
- 4120677-0 (1)
- 4123065-6 (1)
- 4123592-7 (1)
- 4129060-4 (1)
- 4136812-5 (1)
- 4142968-0 (1)
- 4233427-5 (1)
- 4522856-5 (1)
- 4D-CT (1)
- 67p (1)
- 7659230-3 (1)
- ADOL-C (1)
- ALOHA (1)
- AMR (1)
- AMR hierarchies (1)
- AMR tree (1)
- ANFIS (1)
- ANN (1)
- ASTS orientations (1)
- ATSP (1)
- Abtastung (1)
- Access Management (1)
- Active message (1)
- Adaptive Finite Elements (1)
- Adaptive Importance Sampling (1)
- Adaptive Mesh Refinement Data (1)
- Adaptive Stabilized Finite Element (1)
- Adaptive multilevel finite elements (1)
- Adjoint Equations (1)
- Affine invariant Newton methods (1)
- Airline Applications (1)
- Airline Crew Scheduling (1)
- Akustik (1)
- Alanine dipeptide (1)
- Algebraic Modelling Languages (1)
- Algebraic variety decomposition (1)
- Algorithm Analysis (1)
- Algorithmengeschichte (1)
- Algorithmic Differentiation (1)
- Algorithmic Game Theory (1)
- Algorithmische Spieltheorie. (1)
- Algorithms (1)
- Algorithmus (1)
- Aliev-Panfilov model (1)
- Ancient sundials (1)
- Anisotrope Prismen (1)
- Ant Colony Optimization (1)
- Applied Mathematics (1)
- Approximation (1)
- Approximation Hierarchies (1)
- Approximation hierarchies (1)
- Architektur der Suchmaschine (1)
- Archiv (1)
- Artificial Intelligence (1)
- Asymmetric Travelling Salesman Problem (1)
- Asymptotic Analysis (1)
- Asymptotische Analysis (1)
- Atomistic to Continuum (1)
- Aufzugsgruppensteuerung (1)
- Aufzugsteuerung (1)
- Aufzüge (1)
- Ausfallsichere Telekommunikationsnetzwerke (1)
- Ausgabegerätesteuerung (1)
- Ausubel Milgrom Proxy Auction Mechanism (1)
- Authentifizierung (1)
- Authentisierung (1)
- Automatic Storage System (1)
- Automatic differentiation (1)
- Automatisierte Fernleihe Bibliotheksverbund (1)
- BMC (1)
- Balanced Cuts (1)
- Balanced Hypergraphs (1)
- Bandbreite (1)
- Bandwidth allocation (1)
- Base Station Cooperation (1)
- Bayesian hierarchical modeling (1)
- Bayesian hierarchical modelling (1)
- Bayesian inverse problem (1)
- Bayesian inverse problems (1)
- Benchmark (1)
- Benchmark Solutions (1)
- Benders Decomposition (1)
- Benders decomposition (1)
- Benders' decomposition (1)
- Benutzertreffen (1)
- Bereichsabfragen (1)
- Besov- and BV Image Restoration (1)
- Bessel-Rekursion (1)
- Bestandsnachweis (1)
- Beton (1)
- Bi-invariant statistics (1)
- Bi-linear algebraic systems (1)
- Bibliothek der Zukunft (1)
- Bibliothekskatalog (1)
- Bicriteria Optimization (1)
- Bildauflösung (1)
- Bilddatenanalyse (1)
- Bildformat (1)
- Bildsignal (1)
- Bildverarbeitung (1)
- Bio-Heat-Transer-Equation (1)
- Biobjective Optimization (1)
- Biochemical conformations (1)
- Bioinformatics (1)
- Biomechanics (1)
- Biot's model (1)
- Bipartite matching (1)
- Bitrate (1)
- Blocking Probability (1)
- Bohne-Dress Theorem (1)
- Boolean Satisfiability Problem (1)
- Boolean networks (1)
- Boolean vector function (1)
- Bounded-Model-Checking (1)
- Bounds Strengthening (1)
- Brain connectomes (1)
- Branch and Bound (1)
- Branch and Cut (1)
- Branch and Generate (1)
- Branch and bound method (1)
- Branch&Cut-Algorithm (1)
- Branch-and-Bound, Mixed-Integer Programming (1)
- Branch-and-Cut (1)
- Branch-and-cut-and-price (1)
- Branching Rules (1)
- Branchwidth (1)
- Bron-Kerbosch algorithm (1)
- Brownian motion on a triangle (1)
- Broyden's method (1)
- Buchungsvalidierung (1)
- Bundesliga (1)
- Bundle Method (1)
- Burgers' equation (1)
- Bézier splines (1)
- C++ (1)
- C-H...O interaction (1)
- C-stationarity (1)
- CAS (1)
- CCTK (1)
- CEIC (1)
- CGI (1)
- CO2 Transport (1)
- COVID-19 (1)
- CP (1)
- CPAIOR (1)
- CT segmentation (1)
- Cache-Simulator (1)
- Cactus (1)
- Call Admission (1)
- Capacitated Network Design (1)
- Cardinality Constraints (1)
- Cardinality Forcing Inequalities (1)
- Cardinality constraints (1)
- Carvingwidth (1)
- Catalog (1)
- Cayley Trick (1)
- Cellular Automata (1)
- Cellular Radio Telephone Systems (1)
- Chain Rule (1)
- Change-cycle inequality (1)
- Chemical Master Equations (1)
- Chemical Processes (1)
- Chip Verification (1)
- Chipverifikation (1)
- Circuit Switching (1)
- Citation-Ranking (1)
- Client-Server-Anwendungen (1)
- Clinch number (1)
- Cluster Analysis (1)
- Coarse (1)
- Coarse graining (1)
- Coarse-to-Fine (1)
- Codec (1)
- Collection-level (1)
- Colorability (1)
- Combinatorial Auction Problem (1)
- Combinatorial Auctions (1)
- Combinatorial Optimization, Robust Optimization, Multiband Robustness, Network Design (1)
- Combinatorial optimization (1)
- Compact MIP (1)
- Comparative Analysis (1)
- Complex networks (1)
- Computation error (1)
- Computational Complexity (1)
- Computational Cost (1)
- Computational Geometry (1)
- Computational Theory and Mathematics (1)
- Computational graph (1)
- Computations (1)
- Computertomografie (1)
- Concurrent Kernel Execution (1)
- Conformation Analysis (1)
- Conformation dynamics (1)
- Conformations (1)
- Congestion Game (1)
- Conic Programming (1)
- Connected Component Labeling (1)
- Connected Facility Location (1)
- Connected Facility Location, Branch-and-Cut, FTTx Deployment (1)
- Connectivity (1)
- Connectivity Encoding (1)
- Constraint Integer Programming (1)
- Constraint Shortest Paths Problem (1)
- Constraintprogrammierung (1)
- Container <Informatik> (1)
- Container Terminal (1)
- Content Management Systeme (1)
- Context Fil (1)
- Context-based Entropy Coding (1)
- Control of Stacker Cranes (1)
- Controls in transportation networks (1)
- Convex Functions (1)
- Convex envelopes (1)
- Convex program (1)
- Copositive Programming (1)
- Copositive programming (1)
- Copyright (1)
- Covering (1)
- Crew Planning (1)
- Cross-validation (1)
- Cultural Heritage (1)
- Currents (1)
- Cut Selection (1)
- Cutting plane algorithm (1)
- Cutting planes (1)
- Cycle Bases (1)
- Cycle inequality (1)
- Cycles in Matroids (1)
- D-optimality (1)
- DIMACS Challenge (1)
- DINI-Zertifikat (1)
- DNA (1)
- Data Grid (1)
- Data Library (1)
- Data Uncertainty (1)
- Data Visualization (1)
- Datenanalyse (1)
- Datenanreicherung (1)
- Datenformat (1)
- Datenkompression (1)
- Datenmanagement (1)
- Datenmanagementsystem (1)
- Decomposition (1)
- Deduplication (1)
- Deep Learning (1)
- Deep learning (1)
- DeepGreen (1)
- Degree Property (1)
- Dense Output (1)
- Dense connectome (1)
- Dental Imaging (1)
- Depot Planning (1)
- Design efficiency (1)
- Dial-a-Ride problem (1)
- Dial-a-Ride problem on trees (1)
- Dial-a-Ride-Problem (1)
- Diffeomorphic Registration (1)
- Differential Equation (1)
- Differential Geometry (1)
- Diffusion Filtering (1)
- Digital Particle (1)
- Digital Preservation (1)
- Digital Rights Management (1)
- Digitale Bibliot (1)
- Digitally Reconstructed Radiograph (DRR), Anatomy Reconstruction, Statistical Shape and Intensity Model (SSIM), GPU acceleration (1)
- Dimensionierung (1)
- Direct pressure effect (1)
- Dirichlet-to-Neumann map (1)
- Discrete Geometry (1)
- Discrete Mathematics (1)
- Disease severity (1)
- Disjunctive Programming (1)
- Diskrete Mathematik (1)
- Diskrete Optimierung (1)
- Diskretisierungsfehler (1)
- Dispatching von Fahrzeugen (1)
- Distributed Energy Resources (1)
- Distributed Hash Table (DHT) (1)
- Distributed Memory (1)
- Distributed System (1)
- Dokumentenserver (1)
- Dokumentenspeicherung (1)
- Domain Decomposition (1)
- Donsker-Varadhan principle (1)
- Drei-Term-Rekursionen (1)
- Dreiecksqualität (1)
- Drift Minimization (1)
- Drinking water supply (1)
- Druckeffekt (1)
- Dual Ascent (1)
- Duality (1)
- Dubletten (1)
- Duty Roster Planning (1)
- Duty Rostering (1)
- Duty Scheduling (1)
- Dynamic Network Configuration (1)
- Dynamic Programming (1)
- Dynamic Traffic (1)
- Dynamisches Verlinken (1)
- E-Learning (1)
- Echzeitoptimierung (1)
- Eigenschaftsprüfer (1)
- Eigenvalue optimization (1)
- Electric Vehicle Scheduling (1)
- Electric field (1)
- Electricity Market Simulation (1)
- Elimination number (1)
- Elliptic equations (1)
- Elliptic optimal control problem (1)
- Emacs (1)
- Energiewende (1)
- Energy (1)
- Energy Preservation (1)
- Energy supply systems (1)
- Entry-Exit Model (1)
- Epidemiology (1)
- Equivalence theorem (1)
- Ergodic diffusion (1)
- Erschließung (1)
- Euclid's algorithm (1)
- Euler discretization (1)
- Eulerian Cycle (1)
- Exact Designs (1)
- Exact Large Neighborhood Search (1)
- Exact linear programming (1)
- Exakte Reoptimierung (1)
- Expansion Planning (1)
- Expansion planning of energy networks (1)
- Extensible Bin Packing (1)
- Extreme Points (1)
- FORM (1)
- FRBR (1)
- FRT (1)
- FRT-Chord (1)
- FTTx, FTTH, FTTB, FTTC, FTTN, telecommunications, access networks, passive optical networks, network design, routing, energy efficiency (1)
- Faceted Browsing (1)
- Facets (1)
- Facetten (1)
- Facility Location (1)
- Fahrplan (1)
- Fair division (1)
- Fakten (1)
- Fault-tolerance (1)
- Feasibility Pump (1)
- Fibre Network (1)
- Fini (1)
- Finite Element Method (FEM) (1)
- Finite Elemente Methode (1)
- Finite Elements (1)
- Finite Volumen (1)
- Flammenantwort (1)
- Flight Planning Problem (1)
- Flip Defici (1)
- Floquet theory (1)
- Flow Visualization, Time-dependent Vector Fields (1)
- Flugzeug-Umlaufplanung (1)
- Flugzeugumlaufplanung (1)
- Fokker--Planck equation (1)
- Form (1)
- Forschungsdatenmanagement (1)
- Fourier Modal Method (FMM) (1)
- Fourth order q-difference equation (1)
- Fremddaten (1)
- Fremddatennutzung (1)
- Frequency Assignment Problem (1)
- Frequenzplanung (1)
- Fresnel equation (1)
- Frobenius Perron operator (1)
- Functional Requierements for Bibliographic Records (1)
- Functional autoregressive (1)
- G/D/1 (1)
- G/G/1 (1)
- G/GI/1 (1)
- G/M/1 (1)
- GFRT-Chord (1)
- GI/M/C/0 system (1)
- GLAM (1)
- GMRES (1)
- GPU acceleration (1)
- GPU-Accelerated Collision Detection (1)
- GSM-Funknetze (1)
- Gale diagram (1)
- Galerkin method (1)
- Gardner's deformations (1)
- Gas Distribution Networks (1)
- Gas Market Liberalization (1)
- Gas Network Access Regulation (1)
- Gas Network Applications (1)
- Gas network (1)
- Gas network optimization (1)
- Gas networks (1)
- Gasnetzplanung (1)
- Gaussian Process (1)
- Gaussian Processes (1)
- Gaussian mixture model (1)
- Gemeinsamer Index (1)
- Gemischt-ganzzahlige Optimierung (1)
- GenPCCA (1)
- General Agricultural and Biological Sciences (1)
- General Biochemistry, Genetics and Molecular Biology (1)
- General Immunology and Microbiology (1)
- General Public (1)
- General Relativity (1)
- Generalization (1)
- Generalized Eigenvalue Problem (1)
- Generalized Hermite interpolation (1)
- Geometric Distortion (1)
- Geometric statistics (1)
- Geometrieerzeugung (1)
- Geometry processing (1)
- George Dantzig (1)
- German Copyright Law (1)
- Girsanov Theorem (1)
- Girsanov transformation (1)
- Gittergenerierung (1)
- Gitterlose Methoden (1)
- Glasfasernetz (1)
- Global Optimal Control (1)
- Globus (1)
- GnRH analogues (1)
- Gossiping (1)
- Gradients (1)
- Graph Algorithms (1)
- Graph Covering (1)
- Graph Separators (1)
- Graphenalgorithmen (1)
- Graphenisomorphie (1)
- Graphs (1)
- Green's functions (1)
- Grid Computing (1)
- Grid Point (1)
- Grid-Computing (1)
- Gruppenweise Registrierung (1)
- Gurobi (1)
- HAM (1)
- HCCI (1)
- HCI (1)
- HDF5 (1)
- HDFS (1)
- HLRN (1)
- Ha (1)
- Hackathon (1)
- Hadoop (1)
- Hadron masses (1)
- Hall condition (1)
- Hall's Theorem (1)
- Hardware Configuration (1)
- Harvest Scheduling (1)
- Hauptspeicher (1)
- Hessians (1)
- Heterogeneous Wireless Networks, Biobjective Optimization, Mixed Integer Linear Programming, Simulation (1)
- Hierarchical (1)
- Hierarchical KKT Sparsity (1)
- Hierarchical Networks (1)
- Hierarchical approach (1)
- Hierarchische Struktur (1)
- Hilbert basis (1)
- Hirsch conjecture (1)
- Hochregallagerbediengeräte (1)
- Hochschulbibliotheken (1)
- Hom complexes (1)
- Homogenization (1)
- Hybrid (1)
- Hybrid Monte Carlo (1)
- Hybrid Symbolic-Numeric Computation (1)
- Hybrid model (1)
- Hydrogen Infrastructure (1)
- Hydrogen Transport (1)
- Hyper-Q (1)
- Hypergraph (1)
- Hyperthermie-Therapieplanung (1)
- Hypervolume (1)
- Höchstleistungsrechner Nord (1)
- Höhere Bruhat-Ordnung (1)
- I/O-effiziente Algorithmen (1)
- IC_{50} (1)
- IDA* heuristic search sampling random walks (1)
- IGNORE strategy (1)
- ILDM (1)
- IMU (1)
- IP Routing (1)
- IP traffic (1)
- IP-Verkehr (1)
- IP-over-WDM (1)
- IST-20 (1)
- Identifizierung (1)
- Image Reformatting (1)
- Implementation (1)
- Importance Sampling (1)
- Importance sampling (1)
- Incompressible Flow (1)
- Incompressible variable density flows (1)
- Indexierung (1)
- Indizierung (1)
- Infeasibility Detection (1)
- Infectious Diseases (1)
- Information Systems (1)
- Information-Retrieval (1)
- Informationsinfrastruktur (1)
- Informationsversorgung (1)
- Innere-Punkte-Methoden (1)
- Instances (1)
- Integer Linear Programming (1)
- Integer Programs (1)
- Integer linear program (1)
- Integer programming (1)
- Integrable super-systems (1)
- Integral pointed cones (1)
- Integrated Passenger Routing (1)
- Integrierte Umlauf- und Dienstplanung (1)
- Intel Xeon Phi (1)
- Interaction Techniques (1)
- Intermediate Storage Area (1)
- Internet routing (1)
- Internet-Suchmaschinen (1)
- Intersection cuts (1)
- Interval Data (1)
- Inverse Problems (1)
- Inverse Shortest Paths (1)
- Investment planning (1)
- Ising Model (1)
- Isoflächen (1)
- Iterative algorithm (1)
- Iterative refinement (1)
- Java (1)
- KARDOS (1)
- KKT system (1)
- KKT system factorization (1)
- KMA-Parser (1)
- KOB (1)
- KOBV-Dienste (1)
- KOBV-Standard (1)
- Kalman Filter (1)
- Kanonische Gesamtheit (1)
- Kantorovich Theorem (1)
- Kardinalitätsbeschränkung (1)
- Karhunen–Loève expansion (1)
- Katalogisierung (1)
- Kaup-Boussinesq equation (1)
- Kendall (1)
- Kiefer's p-criterion (1)
- Killing vectors (1)
- Kiosk application (1)
- Klassifikation (1)
- Knee Arthroplasty (1)
- Knotendichte (1)
- Knowledge Management (1)
- Kollaboration (1)
- Kommissioniermobile (1)
- Kompetitive Analyse (1)
- Komplexit{ä}t (1)
- Komplexität (1)
- Komplexitätstheorie (1)
- Konfliktanalyse (1)
- Konformationsdynamik (1)
- Konsistenz (1)
- Kooperativer B (1)
- Kooperativer Bibliotheksverbund Berlin-Brandenburg (KOBV) (1)
- Koopman operator (1)
- Kopplung (1)
- Korrosionserkennung (1)
- Korteweg-de Vries equation (1)
- Kostenaufteilungsprobleme (1)
- Kostenmodell (1)
- Kowalevski type Hamiltonians (1)
- Kulturgut (1)
- Kulturinstitutionen (1)
- König's Theorem (1)
- Kürzeste Wege (1)
- L1-error estimates (1)
- LAN to LAN linking (1)
- LAN-to-LAN-Kopplung (1)
- LEO (1)
- LP (1)
- LP solver (1)
- LP, MIP, CIP, MINLP, modeling, optimization, SCIP, SoPlex, Zimpl (1)
- LRU (1)
- Lagrangean Relaxation (1)
- Lagrangian Coherent Structures (LCS) (1)
- Lagrangian relaxation (1)
- Landside operation (1)
- Landweber Iteration (1)
- Langfristige Datenhaltung (1)
- Langzeitarchivierung (1)
- Large Deformation (1)
- Large Eddy Simulation (1)
- Laserschweißen (1)
- Lastverteilung (1)
- Late Breaking Abstracts (1)
- Latency (1)
- Latenzzeiten (1)
- Lavrentiev regularization (1)
- Library (1)
- Licence Agreement (1)
- Lie-Poisson brackets (1)
- Life Cycle Sustainability Assessment (1)
- Line Planning (1)
- Line Planning, Extended Formulation, Public Transport (1)
- Linear Eddy Model (1)
- Linear Inverse Problems (1)
- Linear Poisson brackets on e(3) (1)
- Linear and Integer Programming (1)
- Linear complementarity problem (1)
- Linear-Eddy Model (1)
- Linear-Eddy Modell (1)
- Linearly Implicit Time Discretization (1)
- Lipschitz continuity (1)
- Literaturverwaltungsprogramm (1)
- Lithography (1)
- Lizenzvertrag (1)
- Load Balancing (1)
- Location Planning in Telecommunications (1)
- Logistics (1)
- Logistik (1)
- Longitudinal (1)
- Low-rank solutions (1)
- Lower Bound (1)
- M(n)/M(n)/s+GI system (1)
- M/D/2-PS (1)
- M/M/m-PS (1)
- MAB (1)
- MACI (1)
- MIC (1)
- MINLP model (1)
- MINLP solver (1)
- MINLP, global optimization, operative planning, water supply networks (1)
- MINLPs (1)
- MIP solver (1)
- MIP-Solver (1)
- MIPLIB2003 (1)
- MKG-Chirurgie (1)
- MODIS (1)
- MOMENTUM (1)
- MR thermometry (1)
- MR-Thermometrie (1)
- MST-heuristic (1)
- Magnetband (1)
- Management Science and Operations Research (1)
- Many Integrated Core Coprocessor (MIC) (1)
- Markov Chain (1)
- Markov Chains (1)
- Markov decision process (1)
- Markov o (1)
- Markov state models (1)
- Markov states model (1)
- Markov-Ketten (1)
- Markow State Methods (1)
- Master Surgery Scheduling (1)
- Match- und Merge-Verfahren (1)
- Matching (1)
- Matchings (1)
- Matchings in hypergraphs (1)
- Math-Net Semantic Webdata schemas (1)
- MathML (1)
- Mathematica (1)
- Mathematical Optimization (1)
- Mathematical Programming Testdata Library (1)
- Mathematics in Industry (1)
- Mathematik als Entscheidungshilfe (1)
- Mathematikunterricht in Schulen (1)
- Mathematische Programmierung (1)
- Matrix rank (1)
- Matroid Polytope (1)
- Matroid-Polytop (1)
- Matroids (1)
- Maximum Coverage (1)
- Maximum Diversity Problem (1)
- Maxwell equations (1)
- Measurable state space (1)
- Medical image segmentation (1)
- Mehrfachausfälle (1)
- Mehrgueterflussprobleme (1)
- Mehrskalen-Modellierung (1)
- Mengenüberdeckung (1)
- Mengerian Hypergraphs (1)
- Merkmalslinien (1)
- Mesh Compression (1)
- Mesh interpolation (1)
- Meshfree Methods (1)
- Meshless Methods (1)
- Meta-Suche (1)
- MetaLib (1)
- Metacomputer Management (1)
- Metacomputing (1)
- Metadata (1)
- Metadynamics (1)
- Metaheuristic (1)
- Metastability (1)
- Metropolis Monte Carlo (1)
- Microbenchmarks (1)
- Microbiology (1)
- Minimum-Cost Flow Problems (1)
- Minkowski sum (1)
- Mixed Integer Programming, Parallel processing, Node merging, Racing, ParaSCIP, Ubiquity Generator Framework, MIPLIB (1)
- Mixed integer programming, Exact computation, Rational arithmetic, Cutting Planes, Symbolic Computations, Certificate of correctness (1)
- Mixed-Integer Quadratically Constrained Programming (1)
- Mixed-Integer Quadratically Constrained Programming (1)
- Mixed-Integer Linear Programming (1)
- Mixed-Integer Nonlinear Nonconvex Stochastic Optimization (1)
- Mixed-Integer Nonlinear Optimization (1)
- Mixed-Integer Programming solvers (1)
- Mixed-Intger Programming (1)
- Mixed-integer programming (1)
- Mixed-integer-programming (1)
- MmB (1)
- MmB schemes (1)
- Mobilfunk (1)
- Model-Based Segmentation (1)
- Model-based optimal design (1)
- Modeling (1)
- Modeling and Simulation (1)
- Modelling Language (1)
- Modelling Languages (1)
- Modelling language (1)
- Module identification and classification (1)
- Molecular Simulation (1)
- Moleküldynamik (1)
- Molekülkinetik (1)
- Monte Carlo methods for light transport (1)
- Monte Carlo quadrature (1)
- Monte Carlo simulation (1)
- Monte-Carlo methods (1)
- Monte-Carlo-Quadratur (1)
- Moore recurrences (1)
- Morse matching (1)
- Moving Block (1)
- Multi-Criteria Optimisation (1)
- Multi-View Reconstruction (1)
- Multi-energy systems (1)
- Multi-layer-Netzen Ausfallsicherheit (1)
- Multiband Robust Optimization (1)
- Multiband Robustness (1)
- Multicommodity Flow (1)
- Multigrid Methods (1)
- Multiobjective Approximation Algorithms (1)
- Multiobjective Shortest Path Problem (1)
- Multiobjective Shortest Paths (1)
- Multiperiod Design (1)
- Multiperiod Network Design, Traffic Uncertainty, Robust Optimization, Multiband Robustness, Hybrid Heuristics (1)
- Multiresponse experiments (1)
- Multiscale (1)
- Multiscale-Modelling (1)
- Multistage (1)
- Multistage Stochastic Programming (1)
- Multistage stochastic programs (1)
- Multivariante rational interpolation (1)
- Mund-Kiefer-Gesichtschirurgie (1)
- NBLAST (1)
- N\'{e}d\'{e}lec spaces (1)
- Nachfragefunktion (1)
- Nano-optics (1)
- Nash Equilibrium (1)
- Nash equilibria (1)
- Natural gas flow forecasting (1)
- Natural resourses (1)
- Navigation (1)
- Near (1)
- Neighbourhood Search (1)
- Netlib (1)
- Network (1)
- Network Capacity Planning (1)
- Network Design, Demand Uncertainty, Robust Optimization, Telecommunications (1)
- Network Evolution (1)
- Network Models (1)
- Network Optimization (1)
- Network aggregation (1)
- Network expansion (1)
- Network measurements (1)
- Network planning (1)
- Netzplanung (1)
- Neural Network Verification (1)
- Neural network (1)
- Newton barrier method (1)
- Newton method (1)
- Newton methods in function space (1)
- Newton's method (1)
- Node merging (1)
- Noise (1)
- Nominierungsvalidierung (1)
- Non Equilibrium Sampling (1)
- Non-Cooperative Two-Person Games; Mixed-Integer Nonlinear Optimization (1)
- Non-Linear Charging (1)
- Non-equilibrium (1)
- Non-reversible (1)
- Nonconvex Optimization (1)
- Nonlinear Global Optimization (1)
- Nonlinear Network Design Applications (1)
- Nonlinear Network Flow (1)
- Nonlinear Optimization (1)
- Nonlinear dynamical systems (1)
- Nonlinear programming (1)
- Nonlinear time-dependent PDEs (1)
- Nonlocal Correlation (1)
- Nonsmooth Taylor polynomial/series (1)
- Normal Hypergraphs (1)
- Normal hypergraphs (1)
- Numerical Analysis (1)
- Numerical Simulations (1)
- Numerical problems in dynamical systems (1)
- ODE boundary value problems (1)
- OR in energy (1)
- OSPF Routing (1)
- Offloading (1)
- Online Algorithmen (1)
- Online Public Access Catalog (1)
- Online Target Date Assignment Problem (1)
- Online optimization (1)
- Online-Algorithm (1)
- Online-Algorithmen (1)
- Online-Algorithms (1)
- Online-Katalog (1)
- Online-Kataloge (1)
- Onlinealgorithmen (1)
- Onlineoptimierung (1)
- Opacity (1)
- Open Access Catalog (1)
- Open Access, Maßnahmen, Empfehlungen (1)
- Open Archive Initiative (1)
- Open-Access-Transformation (1)
- Open-Linking (1)
- OpenMath (1)
- Opioid, Ligand-Receptor Interaction, Binding Kinetics, Molecular Dynamics, Metadynamics, SQRA (1)
- Optical Networks (1)
- Optical access networks (1)
- Optimal Control (1)
- Optimal Design (1)
- Optimal Design of Experiments (1)
- Optimal control (1)
- Optimal design (1)
- Optimal design of computer experiments (1)
- Optimal design of experiments (1)
- Optimal operation (1)
- Optische Zugangsnetze (1)
- Opus-Publikationssoftware (1)
- Orbitope (1)
- Osteoarthritis (1)
- Osteotomie (1)
- Output-Sensitive Multiobjective Combinatorial Problems (1)
- Overloading (1)
- Oversubscription (1)
- P2P (1)
- P=NP (1)
- PCB Design (1)
- PCCA+ (1)
- PDE-constrained optimization (1)
- PESP (1)
- PESPlib (1)
- PFASST (1)
- PIPS-SBB, UG, Parallel Branch and Bound (1)
- Packing problems (1)
- Pad/'e split step approximation (1)
- Paging (1)
- Parallel (1)
- Parallel Branch-and-Bound (1)
- Parallel Computing (1)
- Parallel processing (1)
- Parallelization, Branch-and-bound, Mixed Integer Programming, UG, ParaSCIP, FiberSCIP, ParaXpress, FiberXpress, SCIP-Jack (1)
- Parameter estimation (1)
- Parameterized complexity (1)
- Parasitology (1)
- Partial Differential Equations (1)
- Partition Inequalities (1)
- Partition of Unity (1)
- Paths (1)
- Pattern (1)
- Pelvic heating (1)
- Perfect graphs (1)
- Performance and usage measurement (1)
- Performanceanalyse (1)
- Periodic Event Scheduling (1)
- Perro (1)
- Perron Frobenius Generalization (1)
- Perron cluster (1)
- Perron cluster an (1)
- Perron root (1)
- Perron- (1)
- Perron-Cluster Cluster Analysis (1)
- Perron-Cluster-Analyse (1)
- Photo-Consistency Optimization (1)
- Picking (1)
- Picture/Image Generation, Display algorithms, Three-Dimensional Graphics and Realism, Raytracing (1)
- Piecewise Linear Approximation (1)
- Pipe merging (1)
- Pipeline Sizing (1)
- Poisson arrivals (1)
- Poisson equation (1)
- Pole condition (1)
- Polygonal Meshes (1)
- Polyhedral subdivision (1)
- Polymatrix game (1)
- Polynomial Time Approximability (1)
- Poroelasticity (1)
- Portals (1)
- Portalsysteme (1)
- Praxisstudie (1)
- Pre Kernel (1)
- Predictive maintenance (1)
- Preprocessing Shortest Path Problems (1)
- Price of Anarchy (1)
- Primal Heuristics, MIP, mixed integer programming, ZI Round, Shift-and-Propagate, optimization (1)
- Primal-Dual Approximation (1)
- Principal geodesic analysis (1)
- Probabilistic Constraints (1)
- Probabilistic Numerics (1)
- Probabilistische Analyse (1)
- Problem Instances (1)
- Problembibliothek (1)
- Process Control (1)
- Process control (1)
- Process placement (1)
- Procrustes analysis (1)
- Produktionsfaktor Mathematik (1)
- Profilbeschreibung (1)
- Programming (1)
- Progress measures (1)
- Projektarbeit (1)
- Propagation Algorithm (1)
- Protein Folding (1)
- Protein Structure Prediction (1)
- Proteins, Conformation Space, Meshfree Methods (1)
- Protokoll (1)
- Proximale Bündelmethode (1)
- Pseudo-Marginal MCMC (1)
- Pseudocost Branching (1)
- Pseudocost-Branching (1)
- Public Health, Environmental and Occupational Health (1)
- Public Transit (1)
- Publikations- und Kommunikationstechniken (1)
- QAP (1)
- QCMD (1)
- QCQPs (1)
- QSSA (1)
- Quadratic Optimization (1)
- Quadratic-free sets (1)
- Quality Functions (1)
- Questionnaire (1)
- Quota (1)
- RNA (1)
- RSWK (1)
- Racing ParaSCIP (1)
- Radio Network Planning (1)
- Railway Optimization (1)
- Railway Scheduling (1)
- Railway Track Assignment (1)
- Ramachandramurthi parameter (1)
- Random Access Channel (1)
- Randomisierte Algorithmen (1)
- Randschicht (1)
- Range Queries (1)
- Rapid Branching (1)
- Rapid-Branching-Heuristik (1)
- Rayleigh-Ritz and Galerkin Methods (1)
- Real Quantifier Elimination (1)
- Real options (1)
- Real-Time Optimization (1)
- Realistic Data (1)
- Realtime Optimization (1)
- Rebinding (1)
- Rechnender Raum (1)
- Rechtebeschreibung (1)
- Rechtebeschreibungssprache (1)
- Recommender Systems (1)
- Reconstruction (1)
- Redaktion (1)
- Reference-Linking (1)
- Regionalverkehr (1)
- Regression in Riemannian manifolds (1)
- Reliability-Branching (1)
- Repositorien (1)
- Rescheduling (1)
- Research Netzwork (1)
- Research Software (1)
- Reservierung (1)
- Resource Management System (1)
- Resource-Constrained Project Scheduling (1)
- Ressourcen-Verwaltung (1)
- Restart (1)
- Restaurierung (1)
- Retrieval (1)
- Reverse Accumulation (1)
- Reversible Markov chain (1)
- Reweighting (1)
- Riemann problem (1)
- Riemannian manifolds (1)
- Rights Description (1)
- Rights Description Language (1)
- Rigorous Coupled Wave Analysis (RCWA) (1)
- Robust Optimization, Multiband Uncertainty, Compact Robust Counterpart, Cutting Planes, Probabilistic Bound (1)
- Robust Optimization, Uncertainty Set, Multiband Robustness, Network Design (1)
- Robust Perron cluster analysis (1)
- Robust minmax designs (1)
- Robuste Perron Cluster Analyse (1)
- Rolling Stock Planning, Hypergraph Modeling, Integer Programming, Column Generation, Rapid Branching (1)
- Rolling Stock Rostering (1)
- Rolling stock rotation planning (1)
- Romberg Quadratur (1)
- Rostering (1)
- Round-robin tournament (1)
- Rundreisen (1)
- Rundungsfehler (1)
- Runge-Kutta-FVM (1)
- SARS-CoV-2 (1)
- SCIF (1)
- SCIP, MIP, MINLP, CIP, LP, modeling, optimization (1)
- SCIP, Mathematical optimization, Python, Modeling (1)
- SCIP-Jack (1)
- SMP-System (1)
- SNDlib (1)
- SOCP Representability (1)
- STL (1)
- STP (1)
- SVR (1)
- SWD (1)
- Sammelprofil (1)
- Scalar field visualization (1)
- Scalaris (1)
- Scenario Decomposition (1)
- Scenario Technique; System Dynamics (1)
- Scheduling, Extended Formulations, Network Migration, WDM Networks (1)
- Schnittebenenverfahren (1)
- Schroedinger Equation (1)
- Schroedinger equation (1)
- Second Order Cone Programming (1)
- Security Game (1)
- Security Games (1)
- Seifert manifolds (1)
- Selbstzündung (1)
- Self Organizing Networks (SONs) (1)
- Self-Avoiding Path (1)
- Semiconductor devices (1)
- Semidefinite Packing Problem (1)
- Semidefinite programming (1)
- Separation Algorithm (1)
- Separation algorithm (1)
- Separationsalgorithmus (1)
- Service-Einrichtung (1)
- Service-Einrichtung KOBV (1)
- Set Partitioning (1)
- Shape Space (1)
- Shape analysis (1)
- Shortest Routes in Public Transport (1)
- Shortest path routing (1)
- Sicherstellung der Lesbarkeit des Bandmaterials (1)
- Signaling network (1)
- Similarity (1)
- Simplex (1)
- Simplifizierung (1)
- Simplon Korridor (1)
- Simplon corridor (1)
- Simulated annealing (1)
- Simulation mit der Methode der finiten Elemente (1)
- Singular (1)
- Skelettberechnung (1)
- Smoluchowski dynamics (1)
- Smoluchowski equation (1)
- Snapshot-Reads (1)
- Software-Spezifikation (1)
- Spaltengenerierung (1)
- Sparse kernels (1)
- Spectral clustering (1)
- Spectral deferred correction, initial value problems, error propagation, adaptive control of tolerances (1)
- Speicherhierarchie (1)
- Speichersysteme (1)
- Spherical Shell (1)
- Spieltheorie (1)
- Spinal Kinematics (1)
- Spine Modeling (1)
- Spline Interpolation (1)
- Split Closure (1)
- Sport (1)
- Sports league (1)
- Stackelberg game (1)
- State-expanded graph model (1)
- Statistical Shape Model (1)
- Steiner Connectivity Problem (1)
- Steiner Tree (1)
- Steiner Tree Generalization (1)
- Steiner Tree Packing in Graphs (1)
- Steiner Tree Problem Variants (1)
- Steiner Trees (1)
- Steiner connectivity (1)
- Steiner tree solver (1)
- Steiner tree variants (1)
- Stochastic Differential Equation (1)
- Stochastic Programming (1)
- Stochastic Scheduling (1)
- Storage (1)
- Storage Systems (1)
- Storage space allocation (1)
- Stratocumulus Wolken (1)
- Streckungseffekte (1)
- Strong-Branching (1)
- Strömungssimulation (1)
- Supercomputer (1)
- Surface Distance (1)
- Surface Reconstruction (1)
- Surfaces (1)
- Survey (1)
- Surviva (1)
- Survivable Network Design (1)
- Survivable Networks (1)
- Sustainability Indicator (1)
- Sustainability Indicators (1)
- Sustainable Software Development (1)
- Sweep Line (1)
- Sweep Line Algorithm (1)
- Swendsen-Wang Multi-Cluster Algorithm (1)
- Symmetrie-Brechung (1)
- Symmetrie-Erkennung (1)
- System integration (1)
- System management (1)
- Systembiologie (1)
- T3E (1)
- TOPCOM (1)
- Tail Assignment (1)
- Tail assignment (1)
- Taktfahrplan (1)
- Taktfahrplanung (1)
- Tangent principal component analysis (1)
- Taylor Coefficients (1)
- Taylor-FVM (1)
- TeX (1)
- Teaching (1)
- Teamplanung (1)
- Teams (1)
- Technische Kapazitäten (1)
- Telecommunication Network Design (1)
- Telekommunikation (1)
- Telekommunikationsnetze (1)
- Telota (1)
- Telota-Projekt (1)
- Tensorfelder (1)
- Test Library (1)
- Therapieplanung (1)
- Ticket prices (1)
- Tiebreaking criteria (1)
- Tight Cuts (1)
- Time Dependent Shortest Paths (1)
- Time Series (1)
- Time Windows (1)
- Time series (1)
- Toll Control (1)
- Toll Enforcement (1)
- Tonsignal (1)
- Tooth Classification (1)
- Topologie (1)
- Topologieplanung (1)
- Topology Optimization (1)
- Topology Planning (1)
- Total Knee Arthoplasty (1)
- Total Unimodularity (1)
- Track Allocation (1)
- Track Allocation Problem (1)
- Traffic Uncertainty (1)
- Traffic enineering (1)
- Train Dispatching (1)
- Transaktionen (1)
- Transfer Operator (1)
- Transfer operator (1)
- Transient gas flow transport (1)
- Transition Rates (1)
- Transparent Optical Networks (1)
- Transparenzen (1)
- Transportation Network (1)
- Transportation Systems (1)
- Trassenallokation (1)
- Trassenallokationsproblem (1)
- Traveling Repairman (1)
- Traveling Salesman Problem (1)
- Traveling-Salesman-Problem (1)
- Travelling-Salesman-Problem (1)
- Treewidth (1)
- Triangulierung (1)
- Trinkwasserversorgung (1)
- Tropical Geometry (1)
- Tuberculosis (1)
- Tuberculosis, parameter identification, sensitivity analysis, Gauss-Newton method, Nonlinear dynamical systems. (1)
- Turbulente Brenngeschwindigkeit (1)
- Turbulente Verbrennung (1)
- Turbulenz (1)
- Turnarounds (1)
- Two-phase flow (1)
- Umsteigen (1)
- Unbounded domains (1)
- Uncertainty quantification, Gaussian random fields, ridge, feature detection (1)
- Union of Polytopes (1)
- Unit commitment (1)
- Unterrichtsmethoden (1)
- Urheberrecht (1)
- Utility proportional fairness (1)
- VFD (1)
- VLSI-Design (1)
- Valid Inequalities (1)
- Value Creation Process (1)
- Variable selection (1)
- Variable-Depth Neighborhood Search (1)
- Variance Reduction (1)
- Variational inequalities (1)
- Vector Field Visualization, Trajectory Visualization (1)
- Vehicle Routing (1)
- Vehicle scheduling (1)
- Verallgemeinertes Baues-Problem (1)
- Verbrennung (1)
- Verbund-Dien (1)
- Verbund-Dienstleistu (1)
- Verbund-Fernleihe (1)
- Verbundorganisation (1)
- Verbundsysteme (1)
- Verbünde (1)
- Verification and Validation (1)
- Verlage (1)
- Vernetzung (1)
- Vernetzung von Portalen (1)
- Verspätungspropagation (1)
- Verteilte Hashtabelle (DHT) (1)
- Verteilte Suche (1)
- Verteilter Zeitschriftenserver (1)
- Verteiltes Dateisystem (1)
- Vertrauenswürdigkeit des Langzeitspeichers (1)
- Vickrey Auction (1)
- Vickrey Auktion (1)
- Virology (1)
- Virtu (1)
- Virtuelle Supercomputer (1)
- Volltextindizierung (1)
- Volltextrecherche (1)
- Volltextserver (1)
- Volterra integral equation (1)
- Volterra integral equations (1)
- Volume Algorithm (1)
- Voronoi (1)
- Voronoi tessellation (1)
- W-methods (1)
- WAP (1)
- Wahlverfahren und Mathematik (1)
- Water network (1)
- Water supply (1)
- Web 2.0 (1)
- Web-Link (1)
- Wegeprobleme (1)
- Weichgewebeprädiktion (1)
- Wide angle one-way equation (1)
- Wiener-Hopf techniques (1)
- Wigner functions (1)
- Wigner transform (1)
- Wikis (1)
- Willkür (1)
- Windkessel model (1)
- Wireless Communications (1)
- Wissenschaftsnetz (1)
- Wissenschaftsrat (1)
- Workforce (1)
- World Digital Mathematics Library (1)
- XMLFS (1)
- Xeon Phi (1)
- Xeon Phi cluster (1)
- XtreemFS (1)
- Yard crane scheduling (1)
- Z-acyclic complexes (1)
- Z39.50-Protokoll (1)
- ZF (1)
- ZFL-Server (1)
- ZIBDMS (1)
- Zero-Mach number (1)
- Ziegenproblem (1)
- Zielorientierte Planung (1)
- Zielrufsteuerung (1)
- Zimpl (1)
- Zufall (1)
- Zugriffskontrolle (1)
- Zweistufiges Problem (1)
- Zweitveröffentlichung (1)
- Zyklisches Polytop (1)
- abandon probability (1)
- abs-linear form (1)
- absolute convergence (1)
- accessment of mathematical skills (1)
- accuracy matching (1)
- acetabular orientation (1)
- acoustics (1)
- active thermography (1)
- activity network (1)
- adaptive (1)
- adaptive Runge-Kutta method (1)
- adaptive discrete Galerkin methods (1)
- adaptive grid orientation (1)
- adaptive grids (1)
- adaptive resolution (1)
- adaptive sampling (1)
- adaptive search behavior (1)
- adaptive trust region methods (1)
- adaptivity in time and space (1)
- additive manufacturing (1)
- adenovirus (1)
- adhesive categories (1)
- adiabatic limit (1)
- aerosols (1)
- affine adjustable robust counterparts (1)
- affine conjugate Newton methods (1)
- affine covariant (1)
- affine invariance (1)
- affine invariant Gauss-Newton algorithm (1)
- affine invariant norms (1)
- affine routing (1)
- aggregation/disaggregation (1)
- algorithm (1)
- algorithm selection (1)
- algorithmic invariant theory (1)
- algorithmic piecewise differentiation (AD and APD) (1)
- alignment (1)
- almost invariant aggregates (1)
- almost invariant set (1)
- alternating linear scheme (1)
- amalgamated graph transformation (1)
- analytic center (1)
- anastomosis (1)
- anatomical atlas (1)
- animation (1)
- anisotrope Elastizität (1)
- anisotropic Laplace (1)
- anisotropic mean curvature (1)
- anisotropic sampling (1)
- anisotropic sampling of tensor fields (1)
- anisotropic smoothing (1)
- anisotropy (1)
- anlalytic center (1)
- anthropometry (1)
- anti holes (1)
- anticritical edges (1)
- anticritically perfect graphs (1)
- antivirals (1)
- antiwebs (1)
- aperiodic (1)
- application in statistical physics (1)
- applications in industry (1)
- applications of integer programming (1)
- applications to manufacturing (1)
- applicator design (1)
- approximate convex decomposition (1)
- approximate system (1)
- approximations (1)
- ariable and discontinuous coefficients (1)
- articulated shape and intensity models (1)
- asymptotic (1)
- asymptotic expansion (1)
- asymptotically periodic (1)
- asymptotically stable (1)
- asymptotics (1)
- atmosphere (1)
- atomic radii (1)
- attractors (1)
- attribution (1)
- authentischer Mathematikunterricht (1)
- autoignition (1)
- automated test generation (1)
- automatische Test Generierung (1)
- availability (1)
- average case analysis (1)
- average optimality (1)
- b (1)
- backtracking algorithm (1)
- balance equations (1)
- balanced hypergraph (1)
- barrier methods (1)
- basis pursuit (1)
- batch arrivals (1)
- bellmann equation (1)
- benchmarking (1)
- bi-Hamilltonian hierarchies (1)
- bicriteria optimization (1)
- bilevel optimization (1)
- bilinear terms (1)
- binding affinity (1)
- binpacking with side constraints (1)
- biochemical conformation (1)
- biological tilings (1)
- biomolecular conformations (1)
- bioorganic chemistry (1)
- bipartite (1)
- bipartite graphs (1)
- bisection (1)
- bisubmodular function (1)
- bisubmodular polyhedron (1)
- bivariate functions (1)
- black rings (1)
- block (1)
- blocking- (1)
- blue-noise (1)
- bone anchored hearing implant (1)
- bone healing (1)
- bony organ simulation (1)
- boundary conditions (1)
- boundary layer (1)
- boundary parametrization (1)
- bounds (1)
- brain wiring (1)
- brambles (1)
- branch and bound technique (1)
- branch-and-cut-and-price (1)
- branch-cut-and-price framework (1)
- branchwidth (1)
- brown dwarfs (1)
- brushing & linking (1)
- budgeted maximum coverage (1)
- c.elegans (1)
- cake cutting (1)
- canonical discretization schemes (1)
- capacitated network design (1)
- capacity optimization (1)
- cardiac Bidomain and Monodomain models (1)
- cardinality homogeneous set systems (1)
- cardioelectric excitation (1)
- cardiovascular parameters (1)
- carried arrival process (1)
- cartilage (1)
- cartilage morphometry (1)
- catalytic reactor models (1)
- cavity analysis (1)
- cell type (1)
- centrally symmetric polytopes (1)
- chains (1)
- chemical potential (1)
- chromophore concentration (1)
- circuit switching network (1)
- circulants (1)
- city modelling (1)
- civil engineering (1)
- classical Liouville equation (1)
- classifiaction (1)
- climate change impact (1)
- clinical trials (1)
- clique detection (1)
- clique polytope (1)
- cliques (1)
- cloth simulation (1)
- clouds (1)
- cluster architecture (1)
- cluster method (1)
- coarse-to-fine approach (1)
- cocoon (1)
- coefficient of determination (1)
- coherent set, (1)
- collocation method (1)
- collocation methods (1)
- coloring (1)
- combinatorial manifolds (1)
- combinatorial packing (1)
- combinatorial properties (1)
- comet (1)
- communication (1)
- compact formulation (1)
- competitiveness (1)
- completeness (1)
- composite step methods (1)
- compressor station (1)
- computational cardiovascular model (1)
- computational geometry (1)
- computational lithography (1)
- computational metrology (1)
- computed tomography (1)
- computer assisted surgery (1)
- computer graphics (1)
- concrete (1)
- configuration (1)
- configuration models (1)
- conflict learning (1)
- conformation kinetics (1)
- conformational ensemble (1)
- conformational-analysis in-silico-screening drug-design (1)
- conformations (1)
- congestion control (1)
- conical diffraction (1)
- conn (1)
- connectivity (1)
- connectome (1)
- constant batch size (1)
- constrictive (1)
- constructibility (1)
- contact mechanics (1)
- contact problem (1)
- contact--stabilized Newmark method (1)
- contact-stabilized Newmark method (1)
- content management systems (1)
- continuity of Nemyckii Operators (1)
- continuous time model (1)
- contractivity of ordinary differential equations (1)
- control constraints (1)
- convection diffusion equation (1)
- convergence (1)
- convergence enhancement (1)
- convergence of the central path (1)
- convex envelope (1)
- convex hull reformulation (1)
- convex optimization (1)
- convolution (1)
- convolution quadrature (1)
- coordinate search (1)
- correctness, verification, proof, certificate, optimality, infeasibility, mixed-integer linear programming (1)
- correctors (1)
- correctos (1)
- correlation analysis (1)
- correspondence problem (1)
- corrosiondetection (1)
- cost allocation game (1)
- countable (1)
- cow, potassium, model, ode (1)
- cplex (1)
- cranio-maxillofacial surgery (1)
- crew rostering (1)
- crew scheduling (1)
- critical pair analysis (1)
- cross entropy (1)
- cross-correlation (1)
- crosspolytope (1)
- cubic regularization (1)
- cultural heritage (1)
- cumulant generating function (1)
- cumulative constraints (1)
- curse of dimension (1)
- curvature smoothing flow (1)
- curve fairing (1)
- curve smoothing (1)
- customized user interfaces (1)
- cut-based inequalities (1)
- cutset inequalities (1)
- cutset-polyhedra (1)
- cutting plane algorithm (1)
- cycle embedding problem (1)
- cycles (1)
- d (1)
- dairy cows (1)
- data analysis (1)
- data assimilation (1)
- data compression (1)
- data enhancement (1)
- data grid (1)
- data library (1)
- data preprocessing (1)
- data sets (1)
- data workflows (1)
- data-driven (1)
- database (1)
- deep convective clouds (1)
- defibrillation (1)
- degeneration of accuracy (1)
- delay propagation (1)
- density functional theory (1)
- descrete choice (1)
- destination call system (1)
- detailed balance (1)
- determination of time of death (1)
- deterministic parallelism (1)
- dht (1)
- diANA (1)
- diagnostic frequency (1)
- dial-a-ride-problem (1)
- difference (1)
- difference scheme (1)
- differential algebraic equations (1)
- differential equations: (1)
- differential-algebraic equation (1)
- diffusion tensor images (1)
- digiS (1)
- digital library (1)
- digitale Bibliothek (1)
- digitale Information (1)
- digitale Informationstechnologie (1)
- digitale Informationsversorgung (1)
- digitale Langzeitarchivierung (1)
- digitally reconstructed radiographs (1)
- dimension reduction (1)
- direct volume rendering (1)
- directed hypergraphs (1)
- directed networks, modules, cycle decomposition, measure of node communication (1)
- directed refinement (1)
- discontinuous finite element (1)
- discrete Chebyshev polynomials (1)
- discrete Morse function (1)
- discrete convex function (1)
- discrete convolution (1)
- discrete decisions (1)
- discrete mathematics (1)
- discrete-time optimal control multistage stochastic program (1)
- disjoint paths (1)
- disjunctive set (1)
- diskontinuierliche Lösung (1)
- diskrete Entscheidungen (1)
- diskrete Mathematik (1)
- diskrete Optimierung (1)
- dislocation, diffraction contrast, scanning transmission electron microscopy, stereoscopy, visualization (1)
- distributed catalog (1)
- distributed library (1)
- distributed storage systems (1)
- distribution network (1)
- diversification (1)
- docking (1)
- downside risk (1)
- drift (1)
- drift diffusion equation (1)
- driver satisfaction (1)
- drug discovery (1)
- dual proof analysis (1)
- dual reductions (1)
- dual wedge (1)
- duality (1)
- duplication (1)
- dust (1)
- duty rostering (1)
- dynamic analysis (1)
- dynamic optimization (1)
- dynamic reconfiguration (1)
- dynamical contact problems (1)
- dynamical contact problems, contact-stabilized Newmark method, consistency error (1)
- dynamische Lastverteilung und Prozessorzahl (1)
- e-learning (1)
- effective core potential (1)
- eigenvalue optimization (1)
- eigenvalue problem (1)
- eigenvectors (1)
- eingebettete Ränder (1)
- elasticity (1)
- electro-magnetic scattering (1)
- electrocardiology (1)
- electromagnetic scattering (1)
- electronic learning (1)
- elektrische Herzanregung (1)
- elektronische Dokumente (1)
- elektronische Publikation (1)
- elektronische Ressourcen (1)
- elektronische Zeitschriften (1)
- elektronisches Lehren und Lernen (1)
- elevator control, online optimization, reoptimization algorithms, column generation (1)
- elevator system (1)
- elliptische Gleichungen (1)
- elusive graph property (1)
- embedding (1)
- energetic reasoning (1)
- energy networks (1)
- energy optimization, non-linear optimization, smart grid (1)
- energy systems analysis and optimization (1)
- energy-momentum method (1)
- energy:Unit commitment under uncertainty (1)
- entry-exit model (1)
- enumeration (1)
- enumeration algorithm (1)
- equation-free (1)
- equicut (1)
- equivariant dynamics (1)
- ergodic (1)
- error estimates (1)
- essential dimensions (1)
- essential molecular dynamics (1)
- evaluation procedures (1)
- evolution equations (1)
- exact (1)
- exact rational integer programming (1)
- exact rational mixed integer programming (1)
- exact reoptimation (1)
- expectation values (1)
- experimental psychology (1)
- exploratory visualization (1)
- exponential algorithms (1)
- exponential service times (1)
- external memory algorithms (1)
- extrapolation (1)
- extremal combinatorics, extremal set theory, cutting plane, exact integer programming (1)
- f (1)
- f-factors in hypergraphs (1)
- facet (1)
- facet classification (1)
- facettierte Navigation (1)
- facial analysis (1)
- facial modeling (1)
- facts (1)
- family of induced subgraphs (1)
- fares (1)
- feasibility pump (1)
- feature detection (1)
- feeding study (1)
- fiber polytope (1)
- filesystem (1)
- filopodia (1)
- filtrations (1)
- finance (1)
- fingerprints (1)
- finite buffer (1)
- finite element analysis (1)
- finite element meshes (1)
- finite element methods: (1)
- finite element model (1)
- finite element modelling (1)
- finite temperature (1)
- finite- element methods (1)
- finite-time Lyapunov exponents (FTLE) (1)
- first come first served (1)
- first exit time (1)
- first integrals (1)
- fix-and-propagate (1)
- flag complexes (1)
- flame response (1)
- flavonol (1)
- floating point compression (1)
- flow field visualization (1)
- flow orientations (1)
- flow patterns (1)
- flow-cutset inequalities (1)
- forecasting (1)
- forensic medicine (1)
- formal chip verification (1)
- formale Chip Verifikation (1)
- forward mode propagation (1)
- fractional order visco (1)
- free convection (1)
- free turbulent flows (1)
- freely allocable capacity (1)
- freie Konvektion (1)
- freie Ressourcen (1)
- freight train routing (1)
- function parameter analysis (1)
- function parameter sizes (1)
- function space (1)
- fuzzy sets (1)
- ganzzahlige Programme (1)
- ganzzahlige Programmierung (1)
- gas compressor modeling (1)
- gas compressor modeling, polyhedral model, accuracy, z factor (1)
- gas network (1)
- gas network optimization (1)
- gas transport optimization (1)
- gaussian mixture model (1)
- gemischt-ganzzahlige Optimierung (1)
- gene expression (1)
- general flow-cutset inequalities (1)
- general input (1)
- general nonanticipativity (1)
- general relativity (1)
- generalized Taylor expansion (1)
- generalized coloring (1)
- generalized flow formula (1)
- generalized hermite interpolation (1)
- generalized processor sharing (1)
- generalized singular values (1)
- generation (1)
- generic column generation (1)
- genus of a graph (1)
- geodesic finite elements (1)
- geodesy (1)
- geometric morphometrics (1)
- geometric statistics (1)
- geometrization conjecture (1)
- geometry (1)
- geometry generation (1)
- geometry identification (1)
- geometry reconstruction (1)
- gitterfreie Methoden (1)
- global Newton methods (1)
- gradient constrained optimization (1)
- graph algorithms (1)
- graph coloring (1)
- graph coloring complexes (1)
- graph coloring manifolds (1)
- graph ismorphism (1)
- graph minors (1)
- graph of all triangulations (1)
- graph segmentation (1)
- graphical model (1)
- graphical user interface (1)
- gravity field models (1)
- gravity-waves (1)
- greedy algorithm (1)
- grid computing (1)
- grid graphs (1)
- grid user communities (1)
- grooming (1)
- group theory (1)
- growth cone dynamics (1)
- guanine (1)
- half time perio (1)
- hamiltonian (1)
- hardware configuration (1)
- hdf5 (1)
- head of the line processor sharing (1)
- heat transfer equation (1)
- heavy-tailed distribution (1)
- heterogeneous catalysis (1)
- heterogeneous multiscale method (1)
- heterogeneous nucleation (1)
- heterogeneous systems (1)
- heuristic search (1)
- hidden state (1)
- hierarchical space partitioning (1)
- hierarchical watershed (1)
- hierarchisch (1)
- hierarchy (1)
- high load (1)
- high-performance computing (1)
- higher Bruhat order (1)
- higher order finite elements (1)
- highly oscillatory phase (1)
- hip-knee-ankle angle (1)
- hitting times (1)
- holes (1)
- hop constraints (1)
- hop limits (1)
- human menstrual cycle (1)
- human metapneumovirus (1)
- human rhinovirus (1)
- hybrid (1)
- hybrid parareal (1)
- hydrogen bond (1)
- hyper determinants (1)
- hyperassignments (1)
- hypergeometric function (1)
- hypergraphs (1)
- hyperthermia therapy planning (1)
- iPad (1)
- ideal matrices (1)
- identification (1)
- identification of active sites (1)
- ill-posed systems (1)
- image analysis (1)
- image and geometry alignment (1)
- image data analysis (1)
- image retrieval (1)
- image-based analysis (1)
- imaging biomarker (1)
- immersed interface method (1)
- impatience (1)
- impatience rates (1)
- imperfection index (1)
- implant design (1)
- implicativity (1)
- implicit Kogbetliantz technique (1)
- implicit generation of splines (1)
- important sampling (1)
- incident osteoarthritis (1)
- incoherent layers (1)
- incoherent light-trapping (1)
- incomplete factorization (1)
- incompressible (1)
- incompressible flow (1)
- incompressible flows (1)
- induction heating (1)
- industrial mathematics (1)
- inequality (1)
- inertia (1)
- inexact Newton Lagrange (1)
- inexact Newton-Lagrange (1)
- inf-sup-Bedingung (1)
- inf-sup-Condition (1)
- inf-sup-condition (1)
- infeasible linear inequality system (1)
- inferior turbinate (1)
- infinite dimensional (1)
- infinite-server (1)
- influenza (1)
- influenza-like illness (1)
- information and communication system for mathematics (1)
- information constraints (1)
- information theory (1)
- inhomogeneous exterior domains (1)
- initial boundary value problem (1)
- inkompressibel (1)
- innerer Aufbau des Knochens (1)
- integer characterizations (1)
- integer linear programming (1)
- integrability, Lax pairs, noncommutative ODE, Laurent ODE (1)
- integrable quadratic Hamiltonians (1)
- integral Carathéodory property (1)
- integration (1)
- interaction (1)
- interactive editing (1)
- interactive rendering (1)
- interior point algorithm (1)
- interior-point algorithm (1)
- interior-point methods (1)
- internal and boundary layers (1)
- interventional MRI (1)
- invariant sets (1)
- inverse solution (1)
- iron transport (1)
- irreducible infeasible subsystem (1)
- isosurfaces (1)
- isotropic linear elasticity (1)
- isthmus nasi (1)
- iterative Fahrplanung (1)
- iterative closest point (1)
- iterative timetabling (1)
- jump system (1)
- kannel (1)
- kinetic Monte Carlo (1)
- knapsack with integer capacity (1)
- knee model (1)
- knots in 3-balls and 3-spheres (1)
- kobv (1)
- kostenminimale Betriebsplanung (1)
- landmark detection (1)
- lar (1)
- large files (1)
- large scale integration (1)
- large scale methods (1)
- large scale optimization (1)
- large scale problems (1)
- large-scale mixed-integer nonlinear programming (1)
- large-scale nonlinear program (1)
- large-scale nonlinear programming (1)
- large-scale optimization (1)
- large-scale problems (1)
- laser pulse control (1)
- length bounded paths (1)
- level of detail (1)
- level set (1)
- lexicographic representatives (1)
- library catalogue (1)
- lifting subdivision (1)
- limited waiting times (1)
- line integral convolution (1)
- line planning, transfers,Steiner connectivity problem (1)
- line search (1)
- linear ODEs (1)
- linear Optimization (1)
- linear algebraic systems, integrability, Lax pairs, noncommutative ODE, Laurent ODE (1)
- linear elasticity (1)
- linear optimal control (1)
- linear programming bounds (1)
- linear reaction networks (1)
- linear relaxation (1)
- linear representations (1)
- linear response (1)
- linear time algorithm (1)
- linear underestimator (1)
- lineare Optimierung (1)
- linearization (1)
- linearly implicit (1)
- linearly implicit Euler discretization (1)
- link and path restoration (1)
- liquid chromatography (1)
- load-balancing (1)
- local grid refinement (1)
- local projection (1)
- local refinement (1)
- locality of reference (1)
- locally exponential service time (1)
- logistics (1)
- lognormal distribution (1)
- lokaler Speicher (1)
- long term preservation, digital audiovisual material, METS, EBUCore, PID, handle (1)
- long timescales (1)
- loop decomposition (1)
- lot-sizing (1)
- lumbar spine (1)
- macroscopic railway modeling (1)
- main memory (1)
- makroskopische Bahnmodellierung (1)
- mandible (1)
- many queues (1)
- many server (1)
- many servers (1)
- many-server (1)
- marked point p (1)
- mass lumping (1)
- massive parallization (1)
- master equation (1)
- masticatory muscles (1)
- matching (1)
- matching tree (1)
- mathematical model (1)
- mathematical programming (1)
- matrix decompositions (1)
- matrix geometric mean (1)
- matrix triplets (1)
- maximal cliques (1)
- maximum feasible subsystem problem (1)
- maxwell equation (1)
- mean curvature flow (1)
- mean-variance analysis (1)
- measure right hand sides (1)
- medical t (1)
- medical therapy planning (1)
- memory footprint (1)
- mengerian hypergraph (1)
- meniscus (1)
- menschlicher Unterkiefer (1)
- mesh (1)
- mesh compression (1)
- mesh control (1)
- mesh deformation (1)
- mesh independence (1)
- mesh quality optimization (1)
- mesh refinement (1)
- mesh smoothing (1)
- mesh-free methods (1)
- meshbased (1)
- meshed optical networks (1)
- meshfree (1)
- meshfree basis (1)
- meshfree methods (1)
- meshing (1)
- mesoscale spreading process (1)
- mesoscale spreading process, network inference, time-evolving network, romanization spreading, scarce data (1)
- metabolism (1)
- metadatenbasiert (1)
- metal ion (1)
- metastable conformations (1)
- method of characteristics (1)
- method of lines (1)
- metric (1)
- micro chip (1)
- micro-CT (1)
- microCT (1)
- microRNA Smith-Waterman RNA folding (1)
- minimum IIS-cover (1)
- minimum converter wavelength assignment (1)
- minimum cost operative planning (1)
- minimum discrimination information (1)
- missing values (1)
- mixed control-state constraints (1)
- mixed integer model (1)
- mixed integer programming; primal heuristics; conflict analysis; branch-and-bound (1)
- mixed integer quadratically constrained programming (1)
- mixed integer rounding (1)
- mixed precision (1)
- mixed quantum-classical models (1)
- mixed subdivision (1)
- mixed symbolic-numeric algorithm (1)
- mixed-integer linear and nonlinear programming (1)
- mixed-integer prgramming (1)
- mixed-integer programming, branch-and-bound, branching rule, strong branching (1)
- mixed-integer programming, large neighborhood search, primal heuristics, domain propagation (1)
- mixed-integer programs (1)
- mixed-integer quadratically constrained programs (1)
- mixed-integer-programming (1)
- mixture estimation (1)
- mobile phone (1)
- model reformulation (1)
- model validation (1)
- model-based shape reconstruction (1)
- modeling (1)
- moisture (1)
- molecular comparison (1)
- molecular kinetics (1)
- molecular modeling (1)
- molecular modelling (1)
- molecular quantum dynamics (1)
- molecular simulation (1)
- molecular structure (1)
- molecular surface alignment (1)
- molecular transition networks (1)
- moleculare dynamics (1)
- moment problems (1)
- monodomain model (1)
- monotone interpolation (1)
- morphing (1)
- multi armed bandit (1)
- multi armed bandit problem (1)
- multi grid (1)
- multi-commodity flow problem (1)
- multi-commodity flows (1)
- multi-criteria optimization (1)
- multi-grid algorithms (1)
- multi-hour (1)
- multi-junction solar cells (1)
- multi-layer (1)
- multi-layer approach (1)
- multi-layer networks (1)
- multi-modal, intergrated data analysis, topology (1)
- multi-period (1)
- multi-period model (1)
- multi-resolution techniques (1)
- multi-scale problem (1)
- multi-way compressor station (1)
- multicast network design (1)
- multidimensional data sets (1)
- multilev (1)
- multilevel (1)
- multilevel FEM (1)
- multilevel incomplete factorization (1)
- multimodal circular distribution (1)
- multiobjective optimization (1)
- multiperiod optimal power flow, distribution network planning, battery storage (1)
- multiple alignment (1)
- multiple knapsack problem with color constraints (1)
- multiple sources and sinks (1)
- multiple superposition (1)
- multiplier methods (1)
- multiresolution volume rendering (1)
- multiscale (1)
- multistage stochastic program (1)
- multistage stochastic programs (1)
- multistep methods (1)
- nano-photonics (1)
- nanolithography (1)
- nanooptics (1)
- nasal airflow (1)
- nasal airflow simulation (1)
- nasal cavity (1)
- nasal obstruction (1)
- natural language (1)
- natural scene (1)
- natürlichsprachlich (1)
- nearly completely decomposable (1)
- nearly reducible (1)
- nearly uncoupled Markov chain (1)
- necessary optimality conditions (1)
- network availability (1)
- network detection (1)
- network flow (1)
- network inference (1)
- network interdiction (1)
- network models (1)
- network optimization (1)
- network planning (1)
- network reduction (1)
- neural network (1)
- neuroinformatics (1)
- neuron similarity (1)
- neuron tracing (1)
- neurotransmission (1)
- neutron transport equation (1)
- nichtlineare Optimierung (1)
- no-good learning (1)
- node density (1)
- non-PL spheres (1)
- non-adiabatic processes (1)
- non-conforming hexahedral grids (1)
- non-linear dynamics (1)
- non-linear objects (1)
- non-manifold (1)
- non-reflecting boundary condition (1)
- non-reversible Markov chain (1)
- non-stationary forcing (1)
- non-symmetric linear systems (1)
- nonadiabatic effects (1)
- nonconvex constrained optimization (1)
- nonconvex minimization (1)
- nonidentical machines (1)
- nonlinear Schroedinger equation (1)
- nonlinear elasticity (1)
- nonlinear elastomechnics (1)
- nonlinear elliptic (1)
- nonlinear heat transfer (1)
- nonlinear model (1)
- nonlinear parabolic systems (1)
- nonlinear partial differential equa (1)
- nonlinear partial differential equations (1)
- nonlinear programming m (1)
- nonlinear reaction-drift-diffusion equations (1)
- nonlinear scaling (1)
- nonlinear stabilities (1)
- nonlinear systems (1)
- nonlinear time series (1)
- nonlocal boundary conditions (1)
- nonreversible Markov processes (1)
- nonsmooth integration of differential algebraic equations (DAE and ODE) (1)
- nonsymmetric linear systems (1)
- nonuniform meshes (1)
- normal graphs (1)
- normalization of strings (1)
- nuisance trend (1)
- numerical integration (1)
- numerical inverse Laplace transform (1)
- numerical inversion (1)
- numerical library (1)
- numerical methods for exit time problems (1)
- numerischer Algorithmus (1)
- object persistence (1)
- octree (1)
- online algorithm (1)
- online algorithms, stochastic dominance, algorithm analysis, Markov chains (1)
- online library catalog (1)
- open data (1)
- operations research (1)
- operations research in energy (1)
- operator discretization (1)
- optical chip design (1)
- optical critical dimension metrology (1)
- optical simulations (1)
- optimal convergence rates (1)
- optimal design of experiments (1)
- optimal experimental designs (1)
- optimal pathways (1)
- optimal therapeutic policies (1)
- optimale Tour (1)
- optimality gap (1)
- optimality prediction (1)
- optimization in function space (1)
- optimization in public transport (1)
- optimization with PDEs (1)
- optional resources (1)
- orbit integration (1)
- orbit space reduction (1)
- ordinary (1)
- orthogonal matching pursuit (1)
- oscillating functions (1)
- osteotomy (1)
- overlapping Schwarz smoother (1)
- oxygen saturation (1)
- paging (1)
- parabolic (1)
- parabolic equation (1)
- parallel (1)
- parallel Suche (1)
- parallel branch-and-bound (1)
- parallel computing (1)
- parallel independence (1)
- parallel-in-time integration (1)
- parallel-in-time methods (1)
- parallele Suche (1)
- paralleler adaptiver Algorithmus (1)
- parallelizable (1)
- parameter dependent (1)
- parameter scans (1)
- parametric city modeling (1)
- parametric sensitivity (1)
- partial (1)
- partial differential equation (1)
- partial observability (1)
- particle methods (1)
- passenger routing (1)
- path (1)
- path problems (1)
- pathfollowing (1)
- pattern databases (1)
- pattern detection (1)
- pattern-database 15-puzzle 24-puzzle ida* heuristic-search pdb-catalogue zpdb (1)
- peer-to-peer, machine learning, approximate, clustering, quantile, linear regression (1)
- peptide aggregation dynamics (1)
- perfect edge orders (1)
- perfect f-matchings in hypergraphs (1)
- perfect hypergraph (1)
- perfect matchings (1)
- perfect power control (1)
- perfectly matched layers (1)
- performance guarantees (1)
- performance measure (1)
- periodic event scheduling (1)
- periodic timetable (1)
- periodic timetabling, modulo network simplex, passenger routing (1)
- perspective cuts, mixed-integer nonlinear programming, nonconvex optimization, computational study (1)
- pharmaceutical drug design (1)
- phased array optimization (1)
- photoacoustic imaging (1)
- photoassociation (1)
- photonic crystal (1)
- photonic crystals (1)
- picking (1)
- picture memory (1)
- placement (1)
- planar graphs (1)
- planning (1)
- point correspondence (1)
- point matching (1)
- point set optimization (1)
- point sets (1)
- point-based approximation (1)
- pointing (1)
- pointwise state constraints (1)
- policy (1)
- polyconvex elasticity (1)
- polyedrische Unterteilung (1)
- polyhedral manifolds (1)
- polyhedral model (1)
- polyhedral relaxations (1)
- polyhedral structure (1)
- polyhedral subdivision (1)
- polynomial integrals (1)
- polynomial systems (1)
- polynomial-time algorithm (1)
- polyreaction kinetics (1)
- polytope (1)
- polytopes (1)
- portfolio solvers (1)
- positive semidefinite matrices (1)
- positive solutions (1)
- posterior consistency (1)
- potential energy surface (1)
- power consumption (1)
- pre-processing (1)
- preconditioning (1)
- preemptive resume (1)
- preprint (1)
- prescribed mean curvature (1)
- pressure drop equation (1)
- pressure-solver (1)
- principal curvature (1)
- principal curvatures (1)
- printability (1)
- prize-collecting Steiner tree (1)
- probabilistic competitive analysis (1)
- probabilistic numerics (1)
- probability (1)
- probability flow (1)
- process synchronization (1)
- processor sharing (1)
- product induced singular values (1)
- products of spheres (1)
- programming models and systems for manycores (1)
- projection (1)
- propagation algorithms (1)
- property checking (1)
- pseudo--transient continuation (1)
- public transport optimization (1)
- public transportation (1)
- pulse thermography (1)
- python (1)
- q-Orthogonal polynomials (1)
- quadrati (1)
- quadratic 0-1 programming (1)
- quadratic 0/1 optimization (1)
- quadratic complexity (1)
- quadratic programming (1)
- quadrature (1)
- quantitative photoacoustic tomography (1)
- quantitative reconstruction (1)
- quantum adiabati (1)
- quantum dynamics (1)
- quantum mechanics (1)
- quantum populations (1)
- quantum-classical Liouville equation (1)
- quasi-compact operator (1)
- radio interface (1)
- radiomics (1)
- railway (1)
- railway capacity (1)
- railway models (1)
- railway models, railway capacity, track allocation framework (1)
- railway operations (1)
- railway planning (1)
- railway rolling stock optimization (1)
- railway timetables (1)
- railway vehicle rotation scheduling (1)
- railways (1)
- random disturbance (1)
- random environment (1)
- random likelihood (1)
- random walk (1)
- randomised misfit (1)
- randomized algorithm (1)
- randomized algorithms (1)
- rank 1-solution (1)
- rank-1 update (1)
- rank-perfect graphs (1)
- rare event sampling, smoothing, membership functions, perturbed potential (1)
- rate matrix (1)
- ratio of no (1)
- ratio of normalizing co (1)
- rational arithmetic (1)
- ray casting (1)
- ray tracing (1)
- re (1)
- re-optimization (1)
- reaction field (1)
- reaction kinetics (1)
- reaction-diffusion (1)
- reactive trajectories (1)
- real time optimation (1)
- real-time applications (1)
- receptor ligand (1)
- reconstruction (1)
- recourse (1)
- recurrence quantification analysis (1)
- recursions (1)
- recursive factorization (1)
- reduced basis method; model reduction; electromagnetics; photonics; solar cells; nanooptics; Maxwells equations; incoherence (1)
- reduced model (1)
- reduced order models (1)
- reducibility (1)
- reduction techniques (1)
- reference management software (1)
- regular (1)
- regularization (1)
- reinforcement learning (1)
- relational database (1)
- relatively complete recourse (1)
- relaxation (1)
- relaxations (1)
- relaxations of perfect graphs (1)
- reliability (1)
- reliability branching (1)
- remeshing (1)
- remote data access (1)
- remote visualization (1)
- rendering (1)
- renewables integration (1)
- representation learning (1)
- representative (1)
- reservation (1)
- resilience (1)
- resource allocation (1)
- resource-constrained project Scheduling (1)
- resource-poor (1)
- resource-rich (1)
- respiratory syncytial virus (1)
- restoration (1)
- retention time (1)
- reversible differential equations (1)
- reweighting (1)
- rhinorespiratory homeostasis (1)
- ribonucleic acids (1)
- rigid body dynamics (1)
- robust network design (1)
- robust optimization, rolling stock planning (1)
- robuste Optimierung (1)
- robustness (1)
- rolling stock rotation problem (1)
- rolling-stock-planning (1)
- romanization spreading (1)
- rostering (1)
- rough potential energy function (1)
- rounding (1)
- routing in VLSI-design (1)
- safe separators (1)
- sample path (1)
- sampling (1)
- satisfiability (1)
- scalar field visualization (1)
- scalaris (1)
- scarce data (1)
- scattering (1)
- scenarios (1)
- scheduling metrics (1)
- scientific file formats (1)
- scoring (1)
- search engine technology (1)
- search engines (1)
- seasonality (1)
- secant method (1)
- second order sufficient conditions (1)
- secondary & tertiary structures (1)
- secondary structure (1)
- sector coupling (1)
- segment adjacency graph (1)
- segmentation, contour tree, watershed, distance map (1)
- semantic file system (1)
- semantisch (1)
- semantische Technologien (1)
- semi-discrete schemes (1)
- semi-flexible alignment (1)
- semi-linear parabolic PDEs (1)
- semialgebraic sets (1)
- semidefinite Programming (1)
- semidefinite cone (1)
- semidefinite duality (1)
- semidefinite representability (1)
- semigroup of Markov operators (1)
- semilinear heat equation, similarity reduction, exact solutions, group foliation, symmetry (1)
- semilinear heat equation, similarity reduction, exact solutions, group foliation, symmetry (1)
- semilinear parabolic PDEs (1)
- sensitivity evaluation (1)
- sensitivity i.r.t. geometric resolution (1)
- sensitivity i.r.t. thermal parameters (1)
- separation (1)
- separation algorithm (1)
- separation algorithms (1)
- sequential coarse-first-fine-second planning approach (1)
- serial sectioning (1)
- server reservation (1)
- shallow convection (1)
- shallow water equations (1)
- shape analysis (1)
- shape operator (1)
- shape space, shape trajectories, geodesic regression, longitudinal analysis, osteoarthritis (1)
- shape transition (1)
- shared protection (1)
- shell elements (1)
- shortest paths (1)
- siderophore (1)
- sigma-fields (1)
- significant dihedrals (1)
- similarity measures (1)
- simplex (1)
- simplex method (1)
- simplicial balls and spheres (1)
- simulation (1)
- simulation and planning under uncertainty (1)
- simulation studies (1)
- singular values (1)
- skeletonization (1)
- slow dynamics (1)
- small noise (1)
- smoothed analysis (1)
- snapshot-read (1)
- soft tissue prediction (1)
- soft tissue simulation (1)
- software architecture (1)
- software information, software citation, mathematical research data (1)
- sojourn t (1)
- sojourn times (1)
- solar cells (1)
- solution learning (1)
- solvability (1)
- solvation (1)
- solver software (1)
- spar (1)
- sparse factorization (1)
- sparse matrix techniques (1)
- sparse polynomial systems (1)
- sparse projection method (1)
- sparse representations (1)
- sparse secant method (1)
- special polytopes (1)
- spectral clustering (1)
- spectral deferred correction (1)
- spectral graph theory (1)
- spectral order (1)
- spiral (1)
- splatting (1)
- split step methods (1)
- splitting (1)
- sport ranking (1)
- stable distribution (1)
- static analysis (1)
- stationary distribution (1)
- statistical shape analysis (1)
- steel mill slab design problem (1)
- steel mill slab problem (1)
- stiff ODEs (1)
- stiff integration (1)
- stiff integration for PDEs (1)
- stingray (1)
- stochastic approximation (1)
- stochastic boundaries (1)
- stochastic chemical kinetics (1)
- stochastic demand (1)
- stochastic programs (1)
- stochastic reactions kinetics (1)
- stochastic shortest path problem (1)
- stochastic:Scenario Decomposition if mixed-integer programs (1)
- stochastisches Turbulenzmodell (1)
- strain effects (1)
- stratocumulus (1)
- stream surfaces (1)
- strenge Konsistenz (1)
- stress/strain analysis (1)
- strong consistency (1)
- structural and dynamical similarity (1)
- structure (1)
- structured data (1)
- structured overlays (1)
- subgradient method (1)
- substellar atmosphere (1)
- substellar atmospheres (1)
- successive refinement (1)
- supergravity (1)
- superlinear convergence (1)
- supersymmetry (1)
- supply chain management, supply network optimization, mixed-integer linear programming, primal heuristics, numerical stability, large-scale optimization (1)
- surface hopping (1)
- surface matching (1)
- surface parametrization (1)
- surface simplification (1)
- surgery planning (1)
- surrogate model (1)
- surrogate relaxation (1)
- survey (1)
- survivable multi-layer network design (1)
- suspension (1)
- symbolic computation (1)
- symbolic integration (1)
- symmetric Gauss-Seidel (1)
- symmetry detection (1)
- system management (1)
- system of two coupled Stefan equations (1)
- systems biology; modelling; differential equations; metabolism; nutrition; bovine; fertility; reproduction; hormones; follicles; Dexamethasone; PK-PD (1)
- systems of nonlinear equations (1)
- syzygies (1)
- tail assignment (1)
- teamplanning (1)
- teams (1)
- techniques of publishing and communication (1)
- telecommunication (1)
- telecommunication network (1)
- telecommunication network design (1)
- telecommunication networks (1)
- temperature based death time estimation (1)
- template library (1)
- template matching (1)
- tensor decompositions (1)
- tensor field visualization (1)
- tensor train format (1)
- tensors of second order (1)
- tesserae (1)
- thermal explosion (1)
- thermodynamic free energy (1)
- thermography (1)
- thin client (1)
- thin-film silicon solar cells (1)
- thread pools (1)
- threading (1)
- threshold (1)
- tight cuts (1)
- time dependent Schrödinger equation (1)
- time integration (1)
- time lines (1)
- time of death estimation (1)
- time series analysis (1)
- time transformation (1)
- time-dependent vector fields (1)
- time-evolving network (1)
- time-varying data (1)
- timestep control (1)
- timetabling (1)
- toll billing (1)
- tool flow (1)
- topological index criteria (1)
- topological type (1)
- topology (1)
- topology-based techniques (1)
- toric variety (1)
- torus bundles (1)
- total knee replacement (1)
- trabecular structures (1)
- track allocation framework (1)
- trans (1)
- transactions (1)
- transfer operations (1)
- transi (1)
- transition matrix (1)
- transition operator (1)
- transition path theory (1)
- transition probabilities (1)
- transition prohability (1)
- transition state theory (1)
- transition states (1)
- transparent boundary consitions (1)
- transportation planning (1)
- trap spaces (1)
- travelling waves (1)
- treating absolute values (abs, max and min) (1)
- tree (1)
- tree-size estimates (1)
- tree-sparse NLP (1)
- tree-sparse programs (1)
- triangle quality (1)
- triangulating manifolds (1)
- triangulations of oriented matroids (1)
- trip timetable (1)
- tropical geometry (1)
- trunk reservation (1)
- turbuelnce (1)
- turbulent flame speed tabulation (1)
- turbulent flame speeds (1)
- turbulente Brenngeschwindigkeiten (1)
- turbulente Strömungen (1)
- two queues (1)
- two timescale master equation (1)
- two-class priority M/M/1 system (1)
- two-moment ap (1)
- two-phase flow (1)
- two-stage problem (1)
- ultrasonics (1)
- unbounded domain (1)
- underdetermined polynomial systems, rational solutions, computer algebra, recreational mathematics (1)
- underdetermined systems (1)
- unfolding, papyri, computed tomography (1)
- uniform hypergraphs (1)
- unimodal demand (1)
- unitary transformations (1)
- uracil (1)
- user interface (1)
- variable and discontinuous coefficients (1)
- variable fixing (1)
- variable locks (1)
- variable und diskontinuierliche Koeffizienten (1)
- variational inequalities (1)
- vascoda (1)
- vehicle (1)
- vehicle rotation planning (1)
- verification (1)
- verteilte Anwendung (1)
- verteiltes Bibliothekssystem (1)
- vertex properties (1)
- vertex-decomposability (1)
- vertex-transitive triangulations (1)
- views (1)
- virtual anatomy (1)
- virtual waiting times (1)
- viscoelasticity (1)
- visualization of tissue quality (1)
- visualization pipeline (1)
- volume assessment (1)
- volume visualization (1)
- waiting time dependent service (1)
- waiting time distribution (1)
- wave equation (1)
- waveguide (1)
- wavelength conversion (1)
- weakly rank-perfect graphs (1)
- weanling pigs (1)
- web interface (1)
- web portals (1)
- web server (1)
- weighted treewidth (1)
- well-posedness (1)
- wikis (1)
- wireless (1)
- wissenschaftliche Informationsversorgung (1)
- workflow generation (1)
- workload (1)
- wreath product (1)
- zonotopal tilings (1)
- zählen (1)
- {0 (1)
- ÖPNV (1)
- Öffentlicher Personennahverkehr (1)
- Öffentlicher Personenverkehr (1)
- Öffentlicher Verkehr (1)
- Übergangsraten (1)
Institute
- Numerical Mathematics (1483)
- Mathematical Optimization (1271)
- Visual and Data-centric Computing (1129)
- Visual Data Analysis (1017)
- ZIB Allgemein (951)
- Computational Nano Optics (491)
- Distributed Algorithms and Supercomputing (487)
- Modeling and Simulation of Complex Processes (380)
- Visual Data Analysis in Science and Engineering (378)
- Therapy Planning (315)
Any sports competition needs a timetable, specifying when and where teams meet each other. The recent International Timetabling Competition (ITC2021) on sports timetabling showed that, although it is possible to develop general algorithms, the performance of each algorithm varies considerably over the problem instances. This paper provides a problem type analysis for sports timetabling, resulting in powerful insights into the strengths and weaknesses of eight state-of-the-art algorithms. Based on machine learning techniques, we propose an algorithm selection system that predicts which algorithm is likely to perform best based on the type of competition and constraints being used (i.e., the problem type) in a given sports timetabling problem instance. Furthermore, we visualize how the problem type relates to algorithm performance, providing insights and possibilities to further enhance several algorithms. Finally, we assess the empirical hardness of the instances. Our results are based on large computational experiments involving about 50 years of CPU time on more than 500 newly generated problem instances.
The Jacobi set of a bivariate scalar field is the set of points where the gradients of the two constituent scalar fields align with each other. It captures the regions of topological changes in the bivariate field. The Jacobi set is a bivariate analog of critical points, and may correspond to features of interest. In the specific case of time-varying fields and when one of the scalar fields is time, the Jacobi set corresponds to temporal tracks of critical points, and serves as a feature-tracking graph. The Jacobi set of a bivariate field or a time-varying scalar field is complex, resulting in cluttered visualizations that are difficult to analyze. This paper addresses the problem of Jacobi set simplification. Specifically, we use the time-varying scalar field scenario to introduce a method that computes a reduced Jacobi set. The method is based on a stability measure called robustness that was originally developed for vector fields and helps capture the structural stability of critical points. We also present a mathematical analysis for the method, and describe an implementation for 2D time-varying scalar fields. Applications to both synthetic and real-world datasets demonstrate the effectiveness of the method for tracking features.
Computing an optimal cycle in a given homology class, also referred to as the homology localization problem, is known to be an NP-hard problem in general. Furthermore, there is currently no known optimality criterion that localizes classes geometrically and admits a stability property under the setting of persistent homology. We present a geometric optimization of the cycles that is computable in polynomial time and is stable in an approximate sense. Tailoring our search criterion to different settings, we obtain various optimization problems like optimal homologous cycle, minimum homology basis, and minimum persistent
homology basis. In practice, the (trivial) exact algorithm is computationally expensive despite having a worst case polynomial runtime. Therefore, we design approximation algorithms for the above problems and study their performance experimentally. These algorithms have reasonable runtimes for moderate sized datasets and the cycles computed by these algorithms
are consistently of high quality as demonstrated via experiments on multiple datasets.
The Bay of Bengal (BoB) has maintained its salinity distribution over the years despite a continuous flow of fresh water entering it through rivers on the northern coast, which is capable of diluting the salinity. This can be attributed to the cyclic flow of high salinity water (>= 35 psu), coming from Arabian sea and entering BoB from the south, which moves northward and mixes with this fresh water. The movement of this high salinity water has been studied and analyzed in previous work (Singh et al., 2022). This paper extends the computational methods and analysis of salinity movement. Specifically, we introduce an advection based feature definition that represents the movement of high salinity water, and describe algorithms to track their evolution over time. This method allows us to trace the movement of high salinity water caused due to ocean currents. The method is validated via comparison with established observations on the flow of high salinity water in the BoB, including its entry from the Arabian Sea and its movement near Sri Lanka. Further, the visual analysis and tracking framework enables us to compare it with previous work and analyze the contribution of advection to salinity transport.
Studying neural mechanisms in complementary model organisms from different ecological niches in the same animal class can leverage the comparative brain analysis at the cellular level. To advance such a direction, we developed a unified brain atlas platform and specialized tools that allowed us to quantitatively compare neural structures in two teleost larvae, medaka (Oryzias latipes) and zebrafish (Danio rerio). Leveraging this quantitative approach we found that most brain regions are similar but some subpopulations are unique in each species. Specifically, we confirmed the existence of a clear dorsal pallial region in the telencephalon in medaka lacking in zebrafish. Further, our approach allows for extraction of differentially expressed genes in both species, and for quantitative comparison of neural activity at cellular resolution. The web-based and interactive nature of this atlas platform will facilitate the teleost community’s research and its easy extensibility will encourage contributions to its continuous expansion.
For industries like the cement industry, switching to a carbon-neutral production process is impossible. They must rely on carbon capture, utilization and storage (CCUS) technologies to reduce their production processes’ inevitable carbon dioxide (CO2) emissions. For transporting continuously large amounts of CO2, utilizing a pipeline network is the most effective solution; however, building such a network is expensive. Therefore minimizing the cost of the pipelines to be built is extremely important to make the operation financially feasible. In this context, we investigate the problem of finding optimal pipeline diameters from a discrete set of diameters for a tree-shaped network transporting captured CO2 from multiple sources to a single sink. The general problem of optimizing arc capacities in potential-based fluid networks is already a challenging mixed-integer nonlinear optimization problem. The problem becomes even more complex when adding the highly sensitive nonlinear behavior of CO2 regarding temperature and pressure changes. We propose an iterative algorithm splitting the problem into two parts: a) the pipe-sizing problem under a fixed supply scenario and temperature distribution and b) the thermophysical modeling, including mixing effects, the Joule-Thomson effect, and heat exchange with the surrounding environment. We demonstrate the effectiveness of our approach by applying our algorithm to a real-world network planning problem for a CO2 network in Western Germany. Further, we show the robustness of the algorithm by solving a large artificially created set of network instances.
The landscape of applications and subroutines relying on shortest path computations continues to grow steadily. This growth is driven by the undeniable success of shortest path algorithms in theory and practice. It also introduces new challenges as the models and assessing the optimality of paths become more complicated. Hence, multiple recent publications in the field adapt existing labeling methods in an ad hoc fashion to their specific problem variant without considering the underlying general structure: they always deal with multi-criteria scenarios, and those criteria define different partial orders on the paths. In this paper, we introduce the partial order shortest path problem (POSP), a generalization of the multi-objective shortest path problem (MOSP) and in turn also of the classical shortest path problem. POSP captures the particular structure of many shortest path applications as special cases. In this generality, we study optimality conditions or the lack of them, depending on the objective functions’ properties. Our final contribution is a big lookup table summarizing our findings and providing the reader with an easy way to choose among the most recent multi-criteria shortest path algorithms depending on their problems’ weight structure. Examples range from time-dependent shortest path and bottleneck path problems to the electric vehicle shortest path problem with recharging and complex financial weight functions studied in the public transportation community. Our results hold for general digraphs and, therefore, surpass previous generalizations that were limited to acyclic graphs.
The investigation of energy transition paths toward a sustainable and decarbonized future under uncertainty is a critical aspect of contemporary energy planning and policy development. There are numerous methods for analysing uncertainties and sensitivities and many studies on sustainable transformation paths, but there is a lack of combined application to relevant use-cases.
In this study, we investigate the sensitivity of energy transition paths to uncertainties in operational and investment costs of power plants in the metropolitan area of Berlin and its rural surroundings.
By employing the linear programming energy system model oemof-B3, we extensively focus on the system's energy technologies, such as wind turbines, photovoltaics, hydro and combustion plants, and energy storages. Greenhouse gas reduction and electrification rates per commodity are realized by selected constraints.
Our research aims to discern how investments in energy production capacities are influenced by uncertainties of other energy technologies' investment and operational costs in the system. We apply a quantitative approach to investigate such interdependencies of cost variations and their impact on long-term energy planning. Thus, the analysis sheds light on the robustness of energy transition paths in the face of these uncertainties.
The region Berlin-Brandenburg serves as a case study and thus reflects on the present space conflicts to meet energy demands in urban and suburban areas and their rural surroundings. An electricity-intensive scenario is selected that assumes a 100 % reduction in greenhouse gas emissions by 2050. With the results of the case study, we show how our approach enables rural and metropolitan decision-makers to collaborate in achieving sustainable energy.
Decision-making in long-term energy planning can be made more robust and flexible by acknowledging the identified sensitivities and enable such regions better to navigate challenges and uncertainties associated with sustainable energy planning.
Compressible flows are prevalent in natural and technological processes, particularly in the energy transition to renewable energy systems. Consequently, extensive research has focused on understanding the stability of tangential--velocity discontinuity in compressible media. Despite recent advancements that address industrial challenges more realistically, many studies have ignored viscous stress tensors' impact, leading to inaccuracies in predicting interface stability. This omission becomes critical, especially in high Reynolds or low Mach number flows, where viscous forces dissipate kinetic energy across interfaces, affect total energy dissipation, and dampen flow instabilities. Our work is thus motivated to analyze the viscosity force effect by including the viscous stress tensor terms in the motion equations. Our results show that by considering the effect of viscous forces, the tangential-velocity discontinuity interface is constantly destabilized for the entire range of the Mach number.
We study a complex planning and scheduling problem arising from the build-up process of air cargo pallets and containers, collectively referred to as unit load devices (ULD), in which ULDs must be assigned to workstations for loading. Since air freight usually becomes available gradually along the planning horizon, ULD build-ups must be scheduled neither too early to avoid underutilizing ULD capacity, nor too late to avoid resource conflicts with other flights. Whenever possible, ULDs should be built up in batches, thereby giving ground handlers more freedom to rearrange cargo and utilize the ULD's capacity efficiently. The resulting scheduling problem has an intricate cost function and produces large time-expanded models, especially for longer planning horizons. We propose a logic-based Benders decomposition approach that assigns batches to time intervals and workstations in the master problem, while the actual schedule is decided in a subproblem. By choosing appropriate intervals, the subproblem becomes a feasibility problem that decomposes over the workstations. Additionally, the similarity of many batches is exploited by a strengthening procedure for no-good cuts. We benchmark our approach against a time-expanded MIP formulation from the literature on a publicly available data set. It solves 15% more instances to optimality and decreases run times by more than 50% in the geometric mean. This improvement is especially pronounced for longer planning horizons of up to one week, where the Benders approach solves over 50% instances more than the baseline
The imperative to decarbonize energy systems has intensified the need for efficient transformations within the heating sector, with a particular focus on district heating networks. This study addresses this challenge by proposing a comprehensive optimization approach evaluated on the district heating
network of the Märkisches Viertel of Berlin. Our objective is to simultaneously optimize heat production with three targets: minimizing costs, minimizing CO2-emissions, and maximizing heat generation from Combined Heat and Power (CHP) plants for enhanced efficiency.
To tackle this optimization problem, we employed a Mixed-Integer Linear Program (MILP) that encompasses the conversion of various fuels into heat and power, integration with relevant markets, and considerations for technical constraints on power plant operation. These constraints include startup
and minimum downtime, activation costs, and storage limits. The ultimate goal is to delineate the Pareto front, representing the optimal trade-offs between the three targets. We evaluate variants of the 𝜖-constraint algorithm for their effectiveness in coordinating these objectives, with a simultaneous focus on the quality of the estimated Pareto front and computational efficiency. One algorithm explores solutions on an evenly spaced grid in the objective space, while another dynamically adjusts the grid based on identified solutions. Initial findings highlight the strengths and limitations of each algorithm, providing guidance on algorithm selection depending on desired outcomes and computational constraints.
Our study emphasizes that the optimal choice of algorithm hinges on the density and distribution of solutions in the feasible space. Whether solutions are clustered or evenly distributed significantly influences algorithm performance. These insights contribute to a nuanced understanding of algorithm selection for multi-objective multi-energy system optimization, offering valuable guidance for future research and practical applications for planning sustainable district heating networks.
Modeling-Simulation-Optimization workflows play a fundamental role in applied mathematics. The Mathematical Research Data Initiative, MaRDI, responded to this by developing a FAIR and machine-interpretable template for a comprehensive documentation of such workflows. MaRDMO, a Plugin for the Research Data Management Organiser, enables scientists from diverse fields to document and publish their workflows on the MaRDI Portal seamlessly using the MaRDI template. Central to these workflows are mathematical models. MaRDI addresses them with the MathModDB ontology, offering a structured formal model description. Here, we showcase the interaction between MaRDMO and the MathModDB Knowledge Graph through an algebraic modeling workflow from the Digital Humanities. This demonstration underscores the versatility of both services beyond their original numerical domain.
At present, data management plans (DMPs) are still often perceived as mere documents for funding agencies providing clarity on how research data will be handled during a funded project, but are not usually actively involved in the processes. However, they contain a great deal of information that can be shared automatically to facilitate active research data management (RDM) by providing metadata to research infrastructures and supporting communication between all involved stakeholders. This position paper brings together a number of ideas developed and collected during interdisciplinary workshops of the Data Management Planning Working Group (infra-dmp), which is part of the section Common Infrastructures of the National Research Data Infrastructure (NFDI) in Germany. We present our vision of a possible future role of DMPs, templates, and tools in the upcoming NFDI service architecture.
In applied mathematics and related disciplines, the modeling-simulation-optimization workflow is a prominent scheme, with mathematical models and numerical algorithms playing a crucial role. For these types of mathematical research data, the Mathematical Research Data Initiative has developed, merged and implemented ontologies and knowledge graphs. This contributes to making mathematical research data FAIR by introducing semantic technology and documenting the mathematical foundations accordingly. Using the concrete example of microfracture analysis of porous media, it is shown how the knowledge of the underlying mathematical model and the corresponding numerical algorithms for its solution can be represented by the ontologies.
Ontologies and knowledge graphs for mathematical algorithms and models are presented, that have been developed by the Mathematical Research Data Initiative. This enables FAIR data handling in mathematics and the applied disciplines. Moreover, challenges of harmonization during the ontology development are discussed.
MaRDMO Plugin
(2023)
MaRDMO, a plugin for the Research Data Management Organiser, was developed in the Mathematical Research Data Initiative to document interdisciplinary workflows using a standardised scheme. Interdisciplinary workflows recorded this way are published directly on the MaRDI portal. In addition, central information is integrated into the MaRDI knowledge graph. Next to the documentation, MaRDMO offers the possibility to retrieve existing interdisciplinary workflows from the MaRDI Knowledge Graph to allow the reproduction of the initial work and to provide scientists with new researchimpulses. Thus, MaRDMO creates a community-driven knowledge loop that could help to overcome the replication crisis.
Research data are crucial in mathematics and all scientific disciplines, as they form the
foundation for empirical evidence, by enabling the validation and reproducibility of scientific findings. Mathematical research data (MathRD) have become vast and complex, and their interdisciplinary potential and abstract nature make them ubiquitous in various scientific fields. The volume of data and the velocity of its creation are rapidly increasing due to advancements in data science and computing power. This complexity extends to other disciplines, resulting in diverse research data and computational models. Thus, proper handling of research data is crucial both within mathematics and for its manifold connections and exchange with other disciplines. The National Research Data Infrastructure (NFDI), funded by the federal and state governments of Germany, consists of discipline-oriented consortia, including the Mathematical Research Data Initiative (MaRDI). MaRDI has been established to develop services, guidelines and outreach measures for all aspects of MathRD, and thus support the mathematical research community. Research data management (RDM) should be an integral component of every scientific project, and is becoming a mandatory component of grants with funding bodies such as the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation). At the core of RDM are the FAIR (Findable, Accessible, Interoperable, and Reusable) principles. This document aims to guide mathematicians and researchers from related disciplines who create RDM plans. It highlights the benefits and opportunities of RDM in mathematics and interdisciplinary studies, showcases examples of diverse MathRD, and suggests technical solutions that meet the requirements of funding agencies with specific examples. The document is regularly updated to reflect the latest developments within the mathematical community represented by MaRDI.
Voronoi Graph - Improved raycasting and integration schemes for high dimensional Voronoi diagrams
(2024)
The computation of Voronoi Diagrams, or their dual Delauney triangulations is difficult in high dimensions. In a recent publication Polianskii and Pokorny propose an iterative randomized algorithm facilitating the approximation of Voronoi tesselations in high dimensions. In this paper, we provide an improved vertex search method that is not only exact but even faster than the bisection method that was previously recommended. Building on this we also provide a depth-first graph-traversal algorithm which allows us to compute the entire Voronoi diagram. This enables us to compare the outcomes with those of classical algorithms like qHull, which we either match or marginally beat in terms of computation time. We furthermore show how the raycasting algorithm naturally lends to a Monte Carlo approximation for the volume and boundary integrals of the Voronoi cells, both of which are of importance for finite Volume methods. We compare the Monte-Carlo methods to the exact polygonal integration, as well as a hybrid approximation scheme.
Introduction and application of a new approach for model-based optical bidirectional measurements
(2024)
The Koopman operator has entered and transformed many research areas over the last years. Although the underlying concept–representing highly nonlinear dynamical systems by infinite-dimensional linear operators–has been known for a long time, the availability of large data sets and efficient machine learning algorithms for estimating the Koopman operator from data make this framework extremely powerful and popular. Koopman operator theory allows us to gain insights into the characteristic global properties of a system without requiring detailed mathematical models. We will show how these methods can also be used to analyze complex networks and highlight relationships between Koopman operators and graph Laplacians.
This paper is concerned with collective variables, or reaction coordinates, that map a discrete-in-time Markov process X_n in R^d to a (much) smaller dimension k≪d. We define the effective dynamics under a given collective variable map ξ as the best Markovian representation of X_n under ξ. The novelty of the paper is that it gives strict criteria for selecting optimal collective variables via the properties of the effective dynamics. In particular, we show that the transition density of the effective dynamics of the optimal collective variable solves a relative entropy minimization problem from certain family of densities to the transition density of X_n. We also show that many transfer operator-based data-driven numerical approaches essentially learn quantities of the effective dynamics. Furthermore, we obtain various error estimates for the effective dynamics in approximating dominant timescales / eigenvalues and transition rates of the original process X_n and how optimal collective variables minimize these errors. Our results contribute to the development of theoretical tools for the understanding of complex dynamical systems, e.g. molecular kinetics, on large timescales. These results shed light on the relations among existing data-driven numerical approaches for identifying good collective variables, and they also motivate the development of new methods.
The multi-grid reaction-diffusion master equation (mgRDME) provides a generalization of stochastic compartment-based reaction-diffusion modelling described by the standard reaction-diffusion master equation (RDME). By enabling different resolutions on lattices for biochemical species with different diffusion constants, the mgRDME approach improves both accuracy and efficiency of compartment-based reaction-diffusion simulations. The mgRDME framework is examined through its application to morphogen gradient formation in stochastic reaction-diffusion scenarios, using both an analytically tractable first-order reaction network and a model with a second-order reaction. The results obtained by the mgRDME modelling are compared with the standard RDME model and with the (more detailed) particle-based Brownian dynamics simulations. The dependence of error and numerical cost on the compartment sizes is defined and investigated through a multi-objective optimization problem.
Existing planning approaches for onshore wind farm siting and grid integration often do not meet minimum cost solutions or social and environmental considerations. In this paper, we develop an exact approach for the integrated layout and cable routing problem of onshore wind farm planning using the Quota Steiner tree problem. Applying a novel transformation on a known directed cut formulation, reduction techniques, and heuristics, we design an exact solver that makes large problem instances solvable and outperforms generic MIP solvers. In selected regions of Germany, the trade-offs between minimizing costs and landscape impact of onshore wind farm siting are investigated. Although our case studies show large trade-offs between the objective criteria of cost and landscape impact, small burdens on one criterion can significantly improve the other criteria. In addition, we demonstrate that contrary to many approaches for exclusive turbine siting, grid integration must be simultaneously optimized to avoid excessive costs or landscape impacts in the course of a wind farm project. Our novel problem formulation and the developed solver can assist planners in decision-making and help optimize wind farms in large regions in the future.
AI-guided pipeline for protein–protein interaction drug discovery identifies a SARS-CoV-2 inhibitor
(2024)
Protein–protein interactions (PPIs) offer great opportunities to expand the druggable proteome and therapeutically tackle various diseases, but remain challenging targets for drug discovery. Here, we provide a comprehensive pipeline that combines experimental and computational tools to identify and validate PPI targets and perform early-stage drug discovery. We have developed a machine learning approach that prioritizes interactions by analyzing quantitative data from binary PPI assays or AlphaFold-Multimer predictions. Using the quantitative assay LuTHy together with our machine learning algorithm, we identified high-confidence interactions among SARS-CoV-2 proteins for which we predicted three-dimensional structures using AlphaFold-Multimer. We employed VirtualFlow to target the contact interface of the NSP10-NSP16 SARS-CoV-2 methyltransferase complex by ultra-large virtual drug screening. Thereby, we identified a compound that binds to NSP10 and inhibits its interaction with NSP16, while also disrupting the methyltransferase activity of the complex, and SARS-CoV-2 replication. Overall, this pipeline will help to prioritize PPI targets to accelerate the discovery of early-stage drug candidates targeting protein complexes and pathways.
We present a heuristic solution approach for the rolling stock rotation problem with predictive maintenance (RSRP-PdM). The task of this problem is to assign a sequence of trips to each of the vehicles and to schedule their maintenance such that all trips can be operated. Here, the health states of the vehicles are considered to be random variables distributed by a family of probability distribution functions, and the maintenance services should be scheduled based on the failure probability of the vehicles. The proposed algorithm first generates a solution by solving an integer linear program and then heuristically improves this solution by applying a local search procedure. For this purpose, the trips assigned to the vehicles are split up and recombined, whereby additional deadhead trips can be inserted between the partial assignments. Subsequently, the maintenance is scheduled by solving a shortest path problem in a state-expanded version of a space-time graph restricted to the trips of the individual vehicles. The solution approach is tested and evaluated on a set of test instances based on real-world timetables.
An Iterative Refinement Approach for the Rolling Stock Rotation Problem with Predictive Maintenance
(2024)
The rolling stock rotation problem with predictive maintenance (RSRP-PdM) involves the assignment of trips to a fleet of vehicles with integrated maintenance scheduling based on the predicted failure probability of the vehicles. These probabilities are determined by the health states of the vehicles, which are considered to be random variables distributed by a parameterized family of probability distribution functions. During the operation of the trips, the corresponding parameters get updated. In this article, we present a dual solution approach for RSRP-PdM and generalize a linear programming based lower bound for this problem to families of probability distribution functions with more than one parameter. For this purpose, we define a rounding function that allows for a consistent underestimation of the parameters and model the problem by a state-expanded event-graph in which the possible states are restricted to a discrete set. This induces a flow problem that is solved by an integer linear program. We show that the iterative refinement of the underlying discretization leads to solutions that converge from below to an optimal solution of the original instance. Thus, the linear relaxation of the considered integer linear program results in a lower bound for RSRP-PdM. Finally, we report on the results of computational experiments conducted on a library of test instances.
Die Metadatenqualität bestimmt wesentlich den Nutzen und Wert von Kulturerbedaten. ‚Gute‘ Metadaten erhöhen die Auffindbarkeit, Interoperabilität und Nutzbarkeit von Daten signifikant. Mit Blick auf Retrieval bzw. Discovery, Vernetzung im Kontext von Linked Open Data und
wissenschaftliches Data Mining hängt die Qualität dabei wesentlich von der Verwendung von maschinenlesbaren kontrollierten Vokabularen ab. Diese wird in der vorliegenden Arbeit quantitativ untersucht. Als Datengrundlage dienen die in der Deutschen Digitalen Bibliothek aggregierten Metadaten aus Berliner Museen (ca. 1,2 Millionen Metadatenobjekte im LIDO-Format)
Collaborative comparisons and combinations of epidemic models are used as policy-relevant evidence during epidemic outbreaks. In the process of collecting multiple model projections, such collaborations may gain or lose relevant information. Typically, modellers contribute a probabilistic summary at each time-step. We compared this to directly collecting simulated trajectories. We aimed to explore information on key epidemic quantities; ensemble uncertainty; and performance against data, investigating potential to continuously gain information from a single cross-sectional collection of model results. Methods We compared July 2022 projections from the European COVID-19 Scenario Modelling Hub. Five modelling teams projected incidence in Belgium, the Netherlands, and Spain. We compared projections by incidence, peaks, and cumulative totals. We created a probabilistic ensemble drawn from all trajectories, and compared to ensembles from a median across each model’s quantiles, or a linear opinion pool. We measured the predictive accuracy of individual trajectories against observations, using this in a weighted ensemble. We repeated this sequentially against increasing weeks of observed data. We evaluated these ensembles to reflect performance with varying observed data. Results. By collecting modelled trajectories, we showed policy-relevant epidemic characteristics. Trajectories contained a right-skewed distribution well represented by an ensemble of trajectories or a linear opinion pool, but not models’ quantile intervals. Ensembles weighted by performance typically retained the range of plausible incidence over time, and in some cases narrowed this by excluding some epidemic shapes. Conclusions. We observed several information gains from collecting modelled trajectories rather than quantile distributions, including potential for continuously updated information from a single model collection. The value of information gains and losses may vary with each collaborative effort’s aims, depending on the needs of projection users. Understanding the differing information potential of methods to collect model projections can support the accuracy, sustainability, and communication of collaborative infectious disease modelling efforts. Data availability All code and data available on Github: https://github.com/covid19-forecast-hub-europe/aggregation-info-loss
This paper proposes an almost feasible Sequential Linear Programming (afSLP) algorithm. In the first part, the practical limitations of previously proposed Feasible Sequential Linear Programming (FSLP) methods are discussed along with illustrative examples. Then, we present a generalization of FSLP based on a tolerance-tube method that addresses the shortcomings of FSLP. The proposed algorithm afSLP consists of two phases. Phase I starts from random infeasible points and iterates towards a relaxation of the feasible set. Once the tolerance-tube around the feasible set is reached, phase II is started and all future iterates are kept within the tolerance-tube. The novel method includes enhancements to the originally proposed tolerance-tube method that are necessary for global convergence. afSLP is shown to outperform FSLP and the state-of-the-art solver IPOPT on a SCARA robot optimization problem.
The decarbonization of the European energy system demands a rapid and comprehensive transformation while securing energy supplies at all times. Still, natural gas plays a crucial role in this process. Recent unexpected events forced drastic changes in gas routes throughout Europe. Therefore, operational-level analysis of the gas transport networks and technical capacities to cope with these transitions using unconventional scenarios has become essential.
Unfortunately, data limitations often hinder such analyses. To overcome this challenge, we propose a mathematical model-based scenario generator that enables operational analysis of the European gas network using open data. Our approach focuses on the consistent analysis of specific partitions of the gas transport network, whose network topology data is readily available. We generate reproducible and consistent node-based gas in/out-flow scenarios for these defined network partitions to enable feasibility analysis and data quality assessment.
Our proposed method is demonstrated through several applications that address the feasibility analysis and data quality assessment of the German gas transport network. By using open data and a mathematical modeling approach, our method allows for a more comprehensive understanding of the gas transport network's behavior and assists in decision-making during the transition to decarbonization.
Für die Energiesystemforschung sind Software-Modelle ein Kernelement zur Analyse von Szenarien. Das Forschungsprojekt UNSEEN hatte das Ziel eine bisher unerreichte Anzahl an modellbasierten Energieszenarien zu berechnen, um Unsicherheiten – vor allem unter Nutzung linear optimierender Energiesystem-Modelle - besser bewerten zu können. Hierfür wurden umfangreiche Parametervariationen auf Energieszenarien angewendet und das wesentliche methodische Hindernis in diesem Zusammenhang adressiert: die rechnerische Beherrschbarkeit der zu lösenden mathematischen Optimierungsprobleme. Im Vorläuferprojekt BEAM-ME wurde mit der Entwicklung und Anwendung des Open-Source-Lösers PIPS-IPM++ die Grundlage für den Einsatz von High-Performance-Computing (HPC) zur Lösung dieser Modelle gelegt. In UNSEEN war dieser Löser die zentrale Komponente eines Workflows, welcher zur Generierung, Lösung und multi-kriteriellen Bewertung von Energieszenarien auf dem Hochleistungscomputer JUWELS am Forschungszentrum Jülich implementiert wurde. Zur effizienten Generierung und Kommunikation von Modellinstanzen für Methoden der mathematischen Optimierung auf HPC wurde eine weitere Workflow-Komponente von der GAMS Software GmbH entwickelt: der Szenariogenerator. Bei der Weiterentwicklung von Lösungsalgorithmen für linear optimierende Energie-Systemmodelle standen gemischt-ganzzahlige Optimierungsprobleme im Fokus, welche für die Modellierung konkreter Infrastrukturen und Maßnahmen zur Umsetzung der Energiewende gelöst werden müssen. Die in diesem Zusammenhang stehenden Arbeiten zur Entwicklung von Algorithmen wurden von der Technischen Universität Berlin verantwortet. Bei Design und Implementierung dieser Methoden wurde sie vom Zuse Instituts Berlin unterstützt.
Optimized Sensing on Gold Nanoparticles Created by Graded-Layer Magnetron Sputtering and Annealing
(2024)
Task-adapted image reconstruction methods using end-to-end trainable neural networks (NNs) have been proposed to optimize reconstruction for subsequent processing tasks, such as segmentation. However, their training typically requires considerable hardware resources and thus, only relatively simple building blocks, e.g. U-Nets, are typically used, which, albeit powerful, do not integrate model-specific knowledge.
In this work, we extend an end-to-end trainable task-adapted image reconstruction method for a clinically realistic reconstruction and segmentation problem of bone and cartilage in 3D knee MRI by incorporating statistical shape models (SSMs). The SSMs model the prior information and help to regularize the segmentation maps as a final post-processing step.
We compare the proposed method to a state-of-the-art (SOTA) simultaneous multitask learning approach for image reconstruction and segmentation (MTL) and to a complex SSMs-informed segmentation pipeline (SIS).
Our experiments show that the combination of joint end-to-end training and SSMs to further regularize the segmentation maps obtained by MTL highly improves the results, especially in terms of mean and maximal surface errors.
In particular, we achieve the segmentation quality of SIS and, at the same time, a substantial model reduction that yields a five-fold decimation in model parameters and a computational speedup of an order of magnitude.
Remarkably, even for undersampling factors of up to R=8, the obtained segmentation maps are of comparable quality to those obtained by SIS from ground-truth images.
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization, centered around the constraint integer programming framework SCIP. This report discusses the enhancements and extensions included in the SCIP Optimization Suite 9.0. The updates in SCIP 9.0 include improved symmetry handling, additions and improvements of nonlinear handlers and primal heuristics, a new cut generator and two new cut selection schemes, a new branching rule, a new LP interface, and several bug fixes. The SCIP Optimization Suite 9.0 also features new Rust and C++ interfaces for SCIP, new Python interface for SoPlex, along with enhancements to existing interfaces. The SCIP Optimization Suite 9.0 also includes new and improved features in the LP solver SoPlex, the presolving library PaPILO, the parallel framework UG, the decomposition framework GCG, and the SCIP extension SCIP-SDP. These additions and enhancements have resulted in an overall performance improvement of SCIP in terms of solving time, number of nodes in the branch-and-bound tree, as well as the reliability of the solver.
We study the solution of the rolling stock rotation problem with predictive maintenance (RSRP-PdM) by an iterative refinement approach that is based on a state-expanded event-graph. In this graph, the states are parameters of a failure distribution, and paths correspond to vehicle rotations with associated health state approximations. An optimal set of paths including maintenance can be computed by solving an integer linear program. Afterwards, the graph is refined and the procedure repeated. An associated linear program gives rise to a lower bound that can be used to determine the solution quality. Computational results for six instances derived from real-world timetables of a German railway company are presented. The results show the effectiveness of the approach and the quality of the solutions.
Markov processes serve as foundational models in many scientific disciplines,
such as molecular dynamics, and their simulation forms a common basis for
analysis. While simulations produce useful trajectories, obtaining macroscopic
information directly from microstate data presents significant challenges. This
paper addresses this gap by introducing the concept of membership functions
being the macrostates themselves. We derive equations for the holding times of
these macrostates and demonstrate their consistency with the classical definition.
Furthermore, we discuss the application of the ISOKANN method for learning
these quantities from simulation data. In addition, we present a novel method
for extracting transition paths based on the ISOKANN results and demonstrate
its efficacy by applying it to simulations of the 𝜇-opioid receptor. With this
approach we provide a new perspective on analyzing the macroscopic behaviour
of Markov systems.
Estimating the rate of rare conformational changes in molecular systems is one of the goals of molecular dynamics simulations. In the past few decades, a lot of progress has been done in data-based approaches toward this problem. In contrast, model-based methods, such as the Square Root Approximation (SqRA), directly derive these quantities from the potential energy functions. In this article, we demonstrate how the SqRA formalism naturally blends with the tensor structure obtained by coupling multiple systems, resulting in the tensor-based Square Root Approximation (tSqRA). It enables efficient treatment of high-dimensional systems using the SqRA and provides an algebraic expression of the impact of coupling energies between molecular subsystems. Based on the tSqRA, we also develop the projected rate estimation, a hybrid data-model-based algorithm that efficiently estimates the slowest rates for coupled systems. In addition, we investigate the possibility of integrating low-rank approximations within this framework to maximize the potential of the tSqRA.
It has been shown that any 9 by 9 Sudoku puzzle must contain at least 17 clues to have a unique solution. This paper investigates the more specific question: given a particular completed Sudoku grid, what is the minimum number of clues in any puzzle whose unique solution is the given grid? We call this problem the Minimum Sudoku Clue Problem (MSCP). We formulate MSCP as a binary bilevel linear program, present a class of globally valid inequalities, and provide a computational study on 50 MSCP instances of 9 by 9 Sudoku grids. Using a general bilevel solver, we solve 95% of instances to optimality, and show that the solution process benefits from the addition of a moderate amount of inequalities. Finally, we extend the proposed model to other combinatorial problems in which uniqueness of the solution is of interest.
The Fairness-Oriented Crew Rostering Problem (FCRP) considers the joint optimization of attractiveness and fairness in cyclic crew rostering. Like many problems in scheduling and logistics, the combinatorial complexity of cyclic rostering causes exact methods to fail for large-scale practical instances. In case of the FCRP, this is accentuated by the additionally imposed fairness requirements. Hence, heuristic methods are necessary. We present a three-phase heuristic for the FCRP combining column generation techniques with variable-depth neighborhood search. The heuristic exploits different mathematical formulations to find feasible solutions and to search for improvements. We apply our methodology to practical instances from Netherlands Railways (NS), the main passenger railway operator in the Netherlands Our results show the three-phase heuristic finds good solutions for most instances and outperforms a state-of-the-art commercial solver.
Source code and simulation results: Computing eigenfrequency sensitivities near exceptional points
(2024)
Accelerated Riemannian optimization: Handling constraints with a prox to bound geometric penalties
(2022)
In multipartite Bell scenarios, we study the nonlocality robustness of the Greenberger-Horne-Zeilinger (GHZ) state. When each party performs planar measurements forming a regular polygon, we exploit the symmetry of the resulting correlation tensor to drastically accelerate the computation of (i) a Bell inequality via Frank-Wolfe algorithms and (ii) the corresponding local bound. The Bell inequalities obtained are facets of the symmetrized local polytope and they give the best-known upper bounds on the nonlocality robustness of the GHZ state for three to ten parties. Moreover, for four measurements per party, we generalize our facets and hence show, for any number of parties, an improvement on Mermin's inequality in terms of noise robustness. We also compute the detection efficiency of our inequalities and show that some give rise to the activation of nonlocality in star networks, a property that was only shown with an infinite number of measurements.
We present EPR-Net, a novel and effective deep learning approach that tackles a crucial challenge in biophysics: constructing potential landscapes for high-dimensional non-equilibrium steady-state (NESS) systems. EPR-Net leverages a nice mathematical fact that the desired negative potential gradient is simply the orthogonal projection of the driving force of the underlying dynamics in a weighted inner-product space. Remarkably, our loss function has an intimate connection with the steady entropy production rate (EPR), enabling simultaneous landscape construction and EPR estimation. We introduce an enhanced learning strategy for systems with small noise, and extend our framework to include dimensionality reduction and state-dependent diffusion coefficient case in a unified fashion. Comparative evaluations on benchmark problems demonstrate the superior accuracy, effectiveness, and robustness of EPR-Net compared to existing methods. We apply our approach to challenging biophysical problems, such as an 8D limit cycle and a 52D multi-stability problem, which provide accurate solutions and interesting insights on constructed landscapes. With its versatility and power, EPR-Net offers a promising solution for diverse landscape construction problems in biophysics.
Conduction velocity in cardiac tissue is a crucial electrophysiological parameter for arrhythmia vulnerability. Pathologically reduced conduction velocity facilitates arrhythmogenesis because such conduction velocities decrease the wavelength with which re-entry may occur. Computational studies on CV and how it changes regionally in models at spatial scales multiple times larger than actual cardiac cells exist. However, microscopic conduction within cells and between them have been studied less in simulations. In this work, we study the relation of microscopic conduction patterns and clinically observable macroscopic conduction using an extracellular-membrane-intracellular model which represents cardiac tissue with these subdomains at subcellular resolution. By considering cell arrangement and non-uniform gap junction distribution, it yields anisotropic excitation propagation. This novel kind of model can for example be used to understand how discontinuous conduction on the microscopic level affects fractionation of electrograms in healthy and fibrotic tissue. Along the membrane of a cell, we observed a continuously propagating activation wavefront. When transitioning from one cell to the neighbouring one, jumps in local activation times occurred, which led to lower global conduction velocities than locally within each cell.
For decades, de Casteljau's algorithm has been used as a fundamental building block in curve and surface design and has found a wide range of applications in fields such as scientific computing, and discrete geometry to name but a few. With increasing interest in nonlinear data science, its constructive approach has been shown to provide a principled way to generalize parametric smooth curves to manifolds. These curves have found remarkable new applications in the analysis of parameter-dependent, geometric data. This article provides a survey of the recent theoretical developments in this exciting area as well as its applications in fields such as geometric morphometrics and longitudinal data analysis in medicine, archaeology, and meteorology.
In this work, we study the geodesics of the space of certain geometrically and physically motivated subspaces of the space of immersed curves endowed with a first order Sobolev metric. This includes elastic curves and also an extension of some results on planar concentric circles to surfaces. The work focuses on intrinsic and constructive approaches.
Statistical shape models are an essential tool for various tasks in medical image analysis, including shape generation, reconstruction and classification. Shape models are learned from a population of example shapes, which are typically obtained through segmentation of volumetric medical images. In clinical practice, highly anisotropic volumetric scans with large slice distances are prevalent, e.g., to reduce radiation exposure in CT or image acquisition time in MR imaging. For existing shape modeling approaches, the resolution of the emerging model is limited to the resolution of the training shapes. Therefore, any missing information between slices prohibits existing methods from learning a high-resolution shape prior. We propose a novel shape modeling approach that can be trained on sparse, binary segmentation masks with large slice distances. This is achieved through employing continuous shape representations based on neural implicit functions. After training, our model can reconstruct shapes from various sparse inputs at high target resolutions beyond the resolution of individual training examples. We successfully reconstruct high-resolution shapes from as few as three orthogonal slices. Furthermore, our shape model allows us to embed various sparse segmentation masks into a common, low-dimensional latent space — independent of the acquisition direction, resolution, spacing, and field of view. We show that the emerging latent representation discriminates between healthy and pathological shapes, even when provided with sparse segmentation masks. Lastly, we qualitatively demonstrate that the emerging latent space is smooth and captures characteristic modes of shape variation. We evaluate our shape model on two anatomical structures: the lumbar vertebra and the distal femur, both from publicly available datasets.
Periodic timetabling is a challenging planning task in public transport.
As safety requirements are crucial, track allocation is indispensable for validating the practical feasibility of a railway timetable. For busy stations with limited capacities, this requires a detailed planning of turnarounds. It is therefore desirable to integrate timetabling not only with track allocation, but also with vehicle scheduling and line planning. This is captured by the Integrated Line Planning and Turn-Sensitive Periodic Timetabling Problem with Track Choice, whose MIP formulation has been demonstrated to be effective for construction site railway rescheduling, as long as a good quality initial solution is available. In this paper, we discuss how to generate such a solution by extending the SAT formulation of the Periodic Event Scheduling Problem with track choice, track occupation, and minimum service frequency components. The SAT approach is superior to pure MIP on real-world instances of the S-Bahn Berlin network.
The recent COVID-19 pandemic has thrown the importance of accurately forecasting contagion dynamics and learning infection parameters into sharp focus. At the same time, effective policy-making requires knowledge of the uncertainty on such predictions, in order, for instance, to be able to ready hospitals and intensive care units for a worst-case scenario without needlessly wasting resources. In this work, we apply a novel and powerful computational method to the problem of learning probability densities on contagion parameters and providing uncertainty quantification for pandemic projections. Using a neural network, we calibrate an ODE model to data of the spread of COVID-19 in Berlin in 2020, achieving both a significantly more accurate calibration and prediction than Markov-Chain Monte Carlo (MCMC)-based sampling schemes. The uncertainties on our predictions provide meaningful confidence intervals e.g. on infection figures and hospitalisation rates, while training and running the neural scheme takes minutes where MCMC takes hours. We show convergence of our method to the true posterior on a simplified SIR model of epidemics, and also demonstrate our method's learning capabilities on a reduced dataset, where a complex model is learned from a small number of compartments for which data is available.
We have investigated how Langevin dynamics is affected by the friction
coefficient using the novel algorithm ISOKANN, which combines the transfer
operator approach with modern machine learning techniques. ISOKANN describes
the dynamics in terms of an invariant subspace projection of the Koopman
operator defined in the entire state space, avoiding approximations due to
dimensionality reduction and discretization. Our results are consistent with
the Kramers turnover and show that in the low and moderate friction regimes,
metastable macro-states and transition rates are defined in phase space, not
only in position space.
Chiral and directional optical emission from a dipole source coupled to a helical plasmonic antenna
(2024)
A major step in the planning process of passenger railway operators is the assignment of rolling stock, i.e., train units, to the trips of the timetable. A wide variety of mathematical optimization models have been proposed to support this task, which we discuss and argue to be justified in order to deal with operational differences between railway operators, and hence different planning requirements, in the best possible way. Our investigation focuses on two commonly used models, the Composition model and the Hypergraph model, that were developed for Netherlands Railways (NS) and DB Fernverkehr AG (DB), respectively. We compare these models in a rolling stock scheduling setting similar to that of NS, which we show to be strongly NP-hard, and propose different variants of the Hypergraph model to tune the model to the NS setting. We prove that, in this setting, the linear programming bounds of both models are equally strong as long as a Hypergraph model variant is chosen that is sufficiently expressive. However, through a numerical evaluation on NS instances, we show that the Composition model is generally more compact in practice and can find optimal solutions in the shortest running time.
a variational inequality model for the construction of signals from inconsistent nonlinear equations
(2022)
The Machine Learning for Combinatorial Optimization Competition (ML4CO): results and insights
(2022)
a framework for generalized Benders' decomposition and its applications to multilevel optimization
(2022)
Rolling stock is one of the major assets for a railway transportation company. Hence, their utilization should be as efficiently and effectively as possible. Railway undertakings are facing rolling stock scheduling challenges in different forms - from rather idealized weekly strategic problems to very concrete operational ones. Thus, a vast of optimization models with different features and objectives exist. Thorlacius et al. (2015) provides a comprehensive and valuable collection on technical requirements, models, and methods considered in
the scientific literature. We contribute with an update including recent works. The main focus of the paper is to present a classification and elaboration of the major features which our solver R-OPT is able to handle. Moreover, the basic optimization model and algorithmic ingredients of R-OPT are discussed. Finally, we present computational results for a cargo application at SBB CARGO AG and other railway undertakings for passenger traffic in Europe to show the capabilities of R-OPT.
Sparse Model Soups
(2024)
Merlin-Arthur classifiers
(2024)
We introduce DiffOpt.jl, a Julia library to differentiate through the solution of optimization problems with respect to arbitrary parameters present in the objective and/or constraints. The library builds upon MathOptInterface, thus leveraging the rich ecosystem of solvers and composing well with modeling languages like JuMP. DiffOpt offers both forward and reverse differentiation modes, enabling multiple use cases from hyperparameter optimization to backpropagation and sensitivity analysis, bridging constrained optimization with end-to-end differentiable programming. DiffOpt is built on two known rules for differentiating quadratic programming and conic programming standard forms. However, thanks to its ability to differentiate through model transformations, the user is not limited to these forms and can differentiate with respect to the parameters of any model that can be reformulated into these standard forms. This notably includes programs mixing affine conic constraints and convex quadratic constraints or objective function.
In Bell scenarios with two outcomes per party, we algorithmically consider the two sides of the membership problem for the local polytope: Constructing local models and deriving separating hyperplanes, that is, Bell inequalities. We take advantage of the recent developments in so-called Frank-Wolfe algorithms to significantly increase the convergence rate of existing methods. First, we study the threshold value for the nonlocality of two-qubit Werner states under projective measurements. Here, we improve on both the upper and lower bounds present in the literature. Importantly, our bounds are entirely analytical; moreover, they yield refined bounds on the value of the Grothendieck constant of order three: 1.4367⩽KG(3)⩽1.4546. Second, we demonstrate the efficiency of our approach in multipartite Bell scenarios, and present local models for all projective measurements with visibilities noticeably higher than the entanglement threshold. We make our entire code accessible as a julia library called BellPolytopes.jl.
The last milestone achievement for the roundoff-error-free solution of general mixed integer programs over the rational numbers was a hybrid-precision branch-and-bound algorithm published by Cook, Koch, Steffy, and Wolter in 2013. We describe a substantial revision and extension of this framework that integrates symbolic presolving, features an exact repair step for solutions from primal heuristics, employs a faster rational LP solver based on LP iterative refinement, and is able to produce independently verifiable certificates of optimality. We study the significantly improved performance and give insights into the computational behavior of the new algorithmic components. On the MIPLIB 2017 benchmark set, we observe an average speedup of 10.7x over the original framework and 2.9 times as many instances solved within a time limit of two hours.
The distance geometry problem asks to find a realization of a given simple edge-weighted graph in a Euclidean space of given dimension , where the edges are realized as straight segments of lengths equal (or as close as possible) to the edge weights. The problem is often modelled as a mathematical programming formulation involving decision variables that determine the position of the vertices in the given Euclidean space. Solution algorithms are generally constructed using local or global nonlinear optimization techniques. We present a new modelling technique for this problem where, instead of deciding vertex positions, the formulations decide the length of the segments representing the edges in each cycle in the graph, projected in every dimension. We propose an exact formulation and a relaxation based on a Eulerian cycle. We then compare computational results from protein conformation instances obtained with stochastic global optimization techniques on the new cycle-based formulation and on the existing edge-based formulation. While edge-based formulations take less time to reach termination, cycle-based formulations are generally better on solution quality measures.