Andreas Bley

Available identifiers

zbMath Open bley.andreasMaRDI QIDQ313787

List of research outcomes

Publication	Date of Publication	Type
Routing and capacity optimization for IP networks	2024-11-12	Paper
Identifying critical demand periods in capacity planning for networks including storage	2024-09-17	Paper
Propagation and branching strategies for job shop scheduling minimizing the weighted energy consumption	2024-09-17	Paper
Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis	2024-09-05	Paper
Job shop scheduling with flexible energy prices and time windows	2021-08-30	Paper
The incremental connected facility location problem	2019-10-18	Paper
Securely Connected Facility Location in Metric Graphs	2019-09-13	Paper
Joint Optimization of Reorder Points in n-Level Distribution Networks Using (R, Q)-Order Policies	2018-10-09	Paper
A node‐based ILP formulation for the node‐weighted dominating Steiner problem	2018-06-13	Paper
Local Search Based Approximation Algorithms for Two-Stage Stochastic Location Problems	2017-04-04	Paper
Combinatorial approximation algorithms for buy-at-bulk connected facility location problems	2016-09-12	Paper
Lagrangian decompositions for the two-level FTTx network design problem	2014-09-30	Paper
Approximation Algorithms for Facility Location with Capacitated and Length-Bounded Tree Connections	2013-09-17	Paper
Approximation Algorithms for a Combined Facility Location Buy-at-Bulk Network Design Problem	2013-05-28	Paper
Clique-based facets for the precedence constrained knapsack problem	2012-06-26	Paper
MIP Modeling of Incremental Connected Facility Location	2011-09-09	Paper
An integer programming algorithm for routing optimization in IP networks	2011-07-01	Paper
Routing and Capacity Optimization for IP Networks	2011-04-07	Paper
Approximability of unsplittable shortest path routing problems	2010-11-24	Paper
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems	2010-06-22	Paper
A strengthened formulation and cutting planes for the open pit mine production scheduling problem	2010-03-18	Paper
Optimization of OSPF Routing in IP Networks	2010-02-09	Paper
An Integer Programming Algorithm for Routing Optimization in IP Networks	2008-11-25	Paper
On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem	2007-08-30	Paper
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths	2007-07-20	Paper
On the complexity of vertex-disjoint length-restricted path problems	2005-02-11	Paper
https://portal.mardi4nfdi.de/entity/Q4517675	2001-08-05	Paper

Research outcomes over time

This page was built for person: Andreas Bley