| 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
Networks | 2024-09-05 | Paper |
Job shop scheduling with flexible energy prices and time windows
| 2021-08-30 | Paper |
The incremental connected facility location problem
Computers & Operations Research | 2019-10-18 | Paper |
Securely connected facility location in metric graphs
Operations Research Proceedings | 2019-09-13 | Paper |
Joint optimization of reorder points in \(n\)-level distribution networks using (R, Q)-order policies
Operations Research Proceedings | 2018-10-09 | Paper |
A node-based ILP formulation for the node-weighted dominating Steiner problem
Networks | 2018-06-13 | Paper |
Local search based approximation algorithms for two-stage stochastic location problems
Approximation and Online Algorithms | 2017-04-04 | Paper |
Combinatorial approximation algorithms for buy-at-bulk connected facility location problems
Discrete Applied Mathematics | 2016-09-12 | Paper |
Lagrangian decompositions for the two-level FTTx network design problem
EURO Journal on Computational Optimization | 2014-09-30 | Paper |
Approximation algorithms for facility location with capacitated and length-bounded tree connections
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Approximation algorithms for a combined facility location buy-at-bulk network design problem
Lecture Notes in Computer Science | 2013-05-28 | Paper |
Clique-based facets for the precedence constrained knapsack problem
Mathematical Programming. Series A. Series B | 2012-06-26 | Paper |
MIP modeling of incremental connected facility location
Lecture Notes in Computer Science | 2011-09-09 | Paper |
An integer programming algorithm for routing optimization in IP networks
Algorithmica | 2011-07-01 | Paper |
Routing and capacity optimization for IP networks
Operations Research Proceedings | 2011-04-07 | Paper |
Approximability of unsplittable shortest path routing problems
Networks | 2010-11-24 | Paper |
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems
Integer Programming and Combinatorial Optimization | 2010-06-22 | Paper |
A strengthened formulation and cutting planes for the open pit mine production scheduling problem
Computers & Operations Research | 2010-03-18 | Paper |
Optimization of OSPF routing in IP networks
Texts in Theoretical Computer Science. An EATCS Series | 2010-02-09 | Paper |
An Integer Programming Algorithm for Routing Optimization in IP Networks
Algorithms - ESA 2008 | 2008-11-25 | Paper |
On the Approximability of the Minimum Congestion Unsplittable Shortest Path Routing Problem
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
Networks | 2007-07-20 | Paper |
On the complexity of vertex-disjoint length-restricted path problems
Computational Complexity | 2005-02-11 | Paper |
scientific article; zbMATH DE number 1532269 (Why is no real title available?)
| 2001-08-05 | Paper |
