New articles by this author. New citations to this author. New articles related to this author's research. Email address for updates. My profile My library Metrics Alerts. Mathematics, Rose-Hulman Institute of Technology. Title Cited by Year Designing radiotherapy plans with elastic constraints and interior point methods A Holder. Linear Algebra and its Applications , , European Journal of Operational Research 2 , , Information Systems and Operational Research 39 4 , , Operations research and cyber-infrastructure, , International Symposium on Bioinformatics Research and Applications, , Brandt On the distribution of the number of packets in the fluid flow approximation of packet arrival streams Queueing Syst.
Ein Konzept zur Serviceverbesserung bei gleichzeitiger Kostensenkung. Jonas Schweiger , Frauke Liers. Optimization and Engineering , 19 2 , pp. Lovis Anderson , Benjamin Hiller. European Journal of Operational Research , 3 , pp. Kai Helge Becker , Benjamin Hiller. Structural analysis and enumeration.
Mathematical Optimization | Zuse Institute Berlin (ZIB)
An algorithm based on Semidefinite Programming for finding minimax optimal designs. Analysis of operating modes of complex compressor stations. Approximation Hierarchies for the cone of flow matrices. Operations Research Proceedings , pp. Calculation of clinch and elimination numbers for sports leagues with multiple tiebreaking criteria. Daniel Rehfeldt , Thorsten Koch. Computational aspects of the Generalized Trapezoidal Rule. Conflict-free railway track assignment at depots. Exploiting structure in non-convex quadratic optimization.
Kai Hoppmann , Robert Schwarz. Machine Learning, Optimization, and Big Data. Handbook of Optimization in the Railway Industry. Improving Energetic Propagations for Cumulative Scheduling. Improving branching for disjunctive polyhedral models using approximate convex decompositions. Benjamin Hiller , Kai Helge Becker. Improving relaxations for potential-driven network flow problems via acyclic flow orientations.
Optimierung des Liniennetzes in Karlsruhe. Multiscale Modeling and Simulation , 16 1 , pp. Modelling compressor stations in gas networks. Ralf Lenz , Kai Helge Becker. Markus Reuther , Thomas Schlechte. Optimization of Rolling Stock Rotations. Optimization of a Master Surgery Schedule. Handbook of Parallel Constraint Reasoning , pp. Annals of Operations Research , pp. Reduction-based exact solution of prize-collecting Steiner tree problems. Robust Allocation of Operating Rooms: European Journal of Operational Research , 2 , pp.
Separation of Cycle Inequalities in Periodic Timetabling. The Cone of Flow Matrices: Approximation Hierarchies and Applications. Networks , 72 1 , pp. The Graph Segmentation Problem. Journal of Nepal Mathematical Society , Vol. Maher , Guy Desaulniers, Francois Soumis. The daily tail assignment problem under operational uncertainty using look-ahead maintenance constraints.
Operations Research , pp. Journal of Computational Mathematics , 36 3 , pp. A Hypergraph Network Simplex Algorithm. A Re-optimization Approach for Train Dispatching. Airline scheduling and disruption management. Proceedings of Operations Research , pp. Cutting Planes for Union-Closed Families. Designing Inspector Rosters with Optimal Strategies.
Robert Lion Gottwald , Stephen J. Maher , Yuji Shinano. Exploiting structure in non-convex quadratic optimization and gas network planning under uncertainty. Operations Research Proceedings , accepted for publication on , preprint available as ZIB-Report Feasibility-based bound tightening via linear programming. From feasibility to improvement to proof: Optimization Methods and Software , 33 3 , pp. Gas Network Benchmark Models. Generalized preprocessing techniques for Steiner tree and maximum-weight connected subgraph problems. Integrating Lipschitzian dynamical systems using piecewise algorithmic differentiation.
Optimization Methods and Software , pp. Mathematical Optimization of Rolling Stock Rotations. Gerald Gamrath , Christoph Schubert. Measuring the impact of branching rules for mixed-integer programming. Optimisation Methods in Sustainable Manufacturing. Isabel Beckenbach , Robert Scheidweiler. Discrete Mathematics , 10 , pp.
Piecewise linear secant approximation via algorithmic piecewise differentiation. Polyhedral 3D Models for compressors in gas networks. Sahinidis, Stefan Vigerske , Angelika Wiegele. A Library of Quadratic Programming Instances. Recent success stories on integrated optimization of railway systems. Transportation Research Part C: Mathematical Programming Computation , 9 2 , pp. Stefan Vigerske , Ambros Gleixner. Frank Fischer, Thomas Schlechte. Structure-driven fix-and-propagate heuristics for mixed integer programming. Template-based Re-optimization of Rolling Stock Rotations.
The Ubiquity Generator Framework: Journal of Global Optimization , 67 4 , pp. Using white-box nonlinear optimization methods in system dynamics policy improvement. Verifying Integer Programming Results. A First Implementation of ParaXpress: A novel partitioning of the set of non-dominated points. Turbomachinery Technical Conference and Exposition, in press. Evaluation of forecasts by accuracy and spread in the MiKlip decadal climate prediction system. Meteorologische Zeitschrift , 25 6 , pp. Application to FTTx-network design.
Integrated Line Planning and Passenger Routing: Transportation Science , 50 3 , pp. Iterative Refinement for Linear Programming. Berlin, Germany, July , , Proceedings. Symposium Energieinnovation , Multiband Robust Optimization for optimal energy offering under price uncertainty. Procedia Technology , pp. Ralf Lenz , Robert Schwarz. Optimal Looping of Pipelines in Gas Networks.
Optimal duty rostering for toll enforcement inspectors. Annals of Operations Research , Vol. Passenger routing for periodic timetable optimization. Portfoliooptimierung mittels mathematischer Optimierung.
Tobias Achterberg , Robert E. Presolve Reductions in Mixed Integer Programming. Networks , accepted, preprint available as ZIB-Report Regularity patterns for rolling stock rotation optimization. Shortest Paths on Airway Networks. Jesco Humpola , Felipe Serrano. Procedia CIRP , pp. The Cycle Embedding Problem. The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences. Fabio D'Andreagiovanni , Ambros Gleixner.
Towards an accurate solution of wireless network design problems. Using sparse kernels to design computer experiments with tunable precision. ZIB-Report Appeared in: A Hall Condition for Normal Hypergraphs. Svenja Uslu , Axel Werner. A novel passenger recovery approach for the integrated airline recovery problem. Frank Pfeuffer , Axel Werner. Adaptive telecommunication network operation with a limited number of reconfigurations. Approximating Primitive Integand Aircraft Performance. Gleixner , Domenico Salvagnin. Branching on Multi-aggregated Variables.
Comparing two dual relaxations of large scale train timetabling problems. Computational results for validation of nominations. Radoslav Harman, Guillaume Sagnol. Computing D-optimal experimental designs for estimating treatment contrasts under the presence of a nuisance time trend.
Guillaume Sagnol , Radoslav Harman. Computing exact D-optimal designs by mixed integer second-order cone programming. The Annals of Statistics , 43 5 , pp. Convex reformulations for solving a nonlinear network design problem. Die IMU und ihr Sekretariat. Evaluating Gas Network Capacities. Fastest, Average and Quantile Schedule. Generation of multiple best solutions in multiobjective optimal design of energy supply systems.
- Stanford Libraries.
- Book Series.
- Mathematical Optimization.
- Great Canadian Poems for the Aged;
- Citations per year.
- Research Groups:!
- Irish Poetry of the 1930s!
Proceedings of the 15th International Conference on Power Engineering , Thorsten Koch , Marc E. Linienplanung und Minimale Konfigurationen. Optimization in the Real World , Springer, pp. Mathematical optimization for evaluating gas network capacities. Mathematische Modellierung, Simulation und Optimierung von Gastransportnetzwerken. Methods for verifying booked capacities. Evaluating gas network capacities , Society for Industrial and Applied Mathematics, pp. Metric inequalities for routings on direct connections with application to line planning.
Discrete Optimization , Vol. Theory and application to toll enforcing in transportation networks. Das Verkehrsangebot verbessern und Kosten sparen. Verkehr und Technik , 68 7 , pp. Electronic Notes in Discrete Mathematics , Vol. Optimal Designs for Steady-state Kalman filters. Optimal battery control for smart grid nodes.
Koster, Martin Tieves, Axel Werner. Optimal offline virtual network embedding with rent-at-bulk aspects. Optimization in the Real World. Optimization of energy supply systems by MILP branch and bound method in consideration of hierarchical relationship between design and operation.
Energy Conversion and Management , 92 1 March , pp. Pricing local emission exposure of road traffic: Transportation Research Part D: Progress in presolving for mixed integer programming. Mathematical Programming Computation , 7 4 , pp. Regulatory rules for gas markets in Germany and other European countries. Revisiting the use of Robust Optimization for optimal energy offering under price uncertainty.
Sepideh Ahmadi, Sascha F. Solving the integrated airline recovery problem using column-and-row generation. State-of-the-art in evaluating gas network capacities. Optimization in the Real World , Springer Japan, pp. Template based re-optimization of rolling stock rotations. The Connected Facility Location Problem. The S-Bahn Challenge in Berlin. OR News , pp. The hypergraph assignment problem. Timetabling and Passenger Routing in Public Transport.
Fabio D'Andreagiovanni , Antonella Nardin. Towards the fast and robust optimal design of Wireless Body Area Networks. Applied Soft Computing , Vol. Valid inequalities for the topology optimization problem in gas network design. A Jack of all Trades? Solving stochastic mixed-integer nonlinear constraint programs. A fast hybrid primal heuristic for multiband robust capacitated network design with multiple time periods. A hybrid primal heuristic for Robust Multiperiod Network Design. A primal heuristic for optimizing the topology of gas networks based on dual information.
Marco Blanco , Thomas Schlechte. Discrete Applied Mathematics , Vol. Journal of Optical Communications and Networking , 6 11 , pp. Demonstrating energy-efficiency improvements in load-adaptive dynamic multilayer optical networks. Tagungsband Photonische Netze , pp. Fair ticket pricing in public transport as a constrained cost allocation game. Gas network extension planning for multiple demand scenarios. Improving strong branching by domain propagation. Metric Inequalities for Routings on Direct Connections.
Fabio D'Andreagiovanni , Annie Raymond. Vorausschau und Technologieplanung , pp. Koster, Manuel Kutschka, Uwe Steglich. Network planning under demand uncertainty with robust optimization. Ohne Umsteigen ans Ziel. Re-Optimization of Rolling Stock Rotations. Recoverable robust single day aircraft maintenance routing problem. Optimization Letters , Vol. Timo Berthold , Gregor Hendel. Journal of Heuristics , 21 1 , pp.
The Hypergraph Assignment Problem. The Price of Spite in Spot-checking games. Gary Froyland, Stephen J. Maher , Cheng-Lung Wu. The recoverable robust tail assignment problem. Timo Berthold , Ambros M. Mathematical Programming , , pp. Validation of Nominations in Gas Network Optimization: Models, Methods, and Solutions. Steven Harrod, Thomas Schlechte. Transportation Research Part E: A hybrid branch-and-bound approach for exact rational mixed-integer programming. Mathematical Programming Computation , 5 3 , pp.
Affine recourse for the robust network design problem: Between static and dynamic routing. Networks - Special Issue: Flexible Services and Manufacturing Journal , pp. Approximation of a maximum-submodular-coverage problem involving spectral functions, with application to experimental designs. Discrete Applied Mathematics , , pp. Timo Berthold , Domenico Salvagnin.
Wireless Communications and Mobile Computing , 15 5 , pp. A Framework for Facet Classification. How many Steiner terminals can you connect in 20 years? Identification of trade-offs for sustainable manufacturing of a Bamboo Bike by System Dynamics. Proceedings of the Improving strong branching by propagation. Kreiseinbettungen von Hypergraphen und ihre Anwendung in der Umlaufoptimierung. Gleixner , Stefan Weltge. Line Planning and Connectivity.
SearchWorks Catalog
Mathematical optimization for challenging network planning problems in unbundled liberalized gas markets. Energy Systems , 5 3 , pp. Mathematische Behandlung von Dienstreihenfolgeregeln in der Wochenschemaoptimierung. Measuring the impact of primal heuristics. Operations Research Letters , 41 6 , pp. On the semidefinite representation of real functions applied to symmetric matrices.
Linear Algebra and its Applications , 10 , pp. Optimization of Large-Scale Conference Schedules. Optimizing Toll Enforcement in Transportation Networks: Proceedings of INOC' , pp. Optimizing control in a transportation network when users may choose their OD-path. Optimizing the energy consumption in optical networks by flexible bit rates and lightpath reconfiguration. Progress in Academic Computational Integer Programming. Facets of Combinatorial Optimization , pp. Progress in computational integer programming.
Public Transport , 5 1 , pp. Recent improvements using constraint integer programming for resource allocation and scheduling. Reoptimization in branch-and-bound algorithms with an application to elevator control. Proceedings of the 12th International Symposium on Experimental Algorithms , pp. Robust Optimization under Multiband Uncertainty. Robust optimization under multiband uncertainty. Scheduling technology migration in WDM Networks. Special cases of the hypergraph assignment problem. Standings in sports competitions using integer programming. Journal of Quantitative Analysis in Sports , 10 2 , pp.
The Random Hypergraph Assignment Problem. The Steiner connectivity problem. Mathematical Programming A , 1 , pp. Towards optimizing the deployment of optical access networks. Proceedings of INOC , pp. Queueing Systems , 75 , pp. Zweistufige Zielfunktionen in gemischt-ganzzahligen Programmen. A Note on Menger's Theorem for Hypergraphs.
A Stackelberg game to optimize the distribution of controls in transportation networks. Additive functionals with application to sojourn times in infinite-server and processor sharing systems. Queueing Systems , 70 4 , pp. Gleixner , Stefan Heinz , Stefan Vigerske. Numerical Algebra, Control and Optimization , 2 4 , pp. Andreas Bley, Ambros M. Gleixner , Thorsten Koch , Stefan Vigerske. Modeling, Simulation and Optimization of Complex Processes. Could we use a million cores to solve an integer program?
Einblicke in die diskrete Mathematik. Der Mathematikunterricht , 58 2 , pp. Energy efficiency in extensive multilayer core and regional networks with protection. Estimating trenching costs in FTTx network planning. Documenta Mathematica - Optimization Stories , Vol. Mixed Integer Nonlinear Programming , Vol. Factorization and update of a reduced basis matrix for the revised simplex method. Optimization Stories , Vol.
Models for Fare Planning in Public Transport. Discrete Applied Mathematics , 18 , pp. Computational Management Science , 9 3 , pp. Network-related problems in optimal experimental design and second order cone programming. Optimierung des Linienplans in Potsdam. Der Nahverkehr , 30 4 , pp. Optimizing cable and duct installations in FTTx networks. Optimizing the Simplon railway corridor. Annals of Operations Research , 1 , pp. Benjamin Hiller , Tjark Vredeveld. Probabilistic alternatives for competitive analysis. Computer Science - Research and Development , 27 3 , pp. Pure programming approaches to wireless network design.
RENS — the optimal rounding. Stefan Heinz , J. Proceedings of the 24th RAMP symposium. Solving steel mill slab design problems. Constraints , 17 1 , pp. Nam-Dung Hoang , Thorsten Koch.
Stanford Libraries
Steiner tree packing revisited. Stochastic dominance analysis of Online Bin Coloring algorithms. The set of solutions to nomination validation in passive gas transportation networks with a generalized flow formula. Towards globally optimal operation of water supply networks. Train Dispatching by Disjunctive Programming. Using dual presolving reductions to reformulate cumulative constraints. Vehicle Rotation Planning for Intercity Railways.
A class of Semidefinite Programs with rank-one solutions. Linear Algebra and its Applications , 6 , pp. A note on the MIR closure and basic relaxations of polyhedra. Optimization Research Letters , 39 3 , pp. An approximative Criterion for the Potential of Energetic Reasoning. Theory and Practice of Algorithms in Computer Systems , pp. Applied Methods for the Vehicle Positioning Problem.
Computational aspects of time in scheduling and dynamic flow problems. Experimente in der multikriteriellen linearen Optimierung. Explanations for the Cumulative Constraint: Experimental Algorithms , pp. Kombinatorische Optimierung und die Punkte-Regel. Mitteilungen der DMV , Vol. Mathematical Programming Computation , 3 2 , pp. Mathematik, Politik und Recht.
Micro—macro transformation of railway networks. Applications of Evolutionary Computation - EvoApplications , pp. On cut-based inequalities for capacitated network design polyhedra. On linkages in polytope graphs. Optimierung in der Energiewirtschaft , pp. Polyhedral Aspects of Self-Avoiding Walks. Railway Track Allocation - Simulation and Optimization. Koster, Manuel Kutschka, Christian Raack. Formulations, Valid Inequalities, and Computations.
Breitbandversorgung in Deutschland , Vol. Localizing nodes from noisy data. Szenariogenerierung zur Modellierung der stochastischen Ausspeiselasten in einem Gastransportnetz. Anastasios Giovanidis , Jonad Pulaj. The Multiperiod Network Design Problem: Valid Cuts for Mixed-Integer Programming. Steffy , Kati Wolter. Which mixed integer programs could a million CPUs solve? ARQ protocols in wireless communications. Algorithmic Cost Allocation Games: An extension of disjunctive programming and its impact for compact tree formulations.
Cardinality constrained combinatorial optimization. Eine parallele Variante des Netzwerksimplexalgorithmus.