@inproceedings{BleyD'AndreagiovanniKarch2013, author = {Bley, Andreas and D'Andreagiovanni, Fabio and Karch, Daniel}, title = {Scheduling technology migration in WDM Networks}, booktitle = {Photonic Networks, 14. 2013 ITG Symposium. Proceedings}, pages = {1 -- 5}, year = {2013}, language = {en} } @inproceedings{BorndoerferCardonha2012, author = {Bornd{\"o}rfer, Ralf and Cardonha, Carlos}, title = {A Binary Quadratic Programming Approach to the Vehicle Positioning Problem}, booktitle = {Modeling, Simulation and Optimization of Complex Processes -- Proceedings of the Fourth International Conference on High Performance Scientific Computing, March 2-6, 2009}, doi = {10.1007/978-3-642-25707-0}, pages = {41 -- 52}, year = {2012}, abstract = {The Vehicle Positioning Problem (VPP) consists of the assignment of vehicles (buses, trams or trains) of a public transport or railway company to parking positions in a depot and to timetabled trips. Such companies have many different types of vehicles, and each trip can be performed only by vehicles of some of these types. These assignments are non-trivial due to the topology of depots. The parking positions are organized in tracks, which work as one- or two-sided stacks or queues. If a required type of vehicle is not available in the front of any track, shunting movements must be performed in order to change vehicles' positions, which is undesirable and should be avoided. In this text we present integer linear and non-linear programming formulations for some versions of the problem and compare them from a theoretical and a computational point of view.}, language = {en} } @inproceedings{Bley2009, author = {Bley, Andreas}, title = {On the Hardness of Finding Small Shortest Path Routing Conflicts}, booktitle = {Proceedings of 4th International Network Optimization Conference (INOC2009)}, year = {2009}, abstract = {Nowadays most data networks use shortest path protocols such as OSPF or IS-IS to route traffic. Given administrative routing lengths for the links of a network, all data packets are sent along shortest paths with respect to these lengths from their source to their destination. One of the most fundamental problems in planning shortest path networks is to decide whether a given set of routing paths forms a valid routing and, if this is not the case, to find a small subset of the given paths that cannot be shortest paths simultaneously for any routing lengths. In this paper we show that it is NP-hard to approximate the size of the smallest shortest path conflict by a factor less than 7/6.}, language = {en} } @inproceedings{MenneRaackWessaelyetal.2012, author = {Menne, Ulrich and Raack, Christian and Wess{\"a}ly, Roland and Kharitonov, Daniel}, title = {Optimal Degree of Optical Circuit Switching in IP-over-WDM Networks}, booktitle = {Optical Network Design and Modeling (ONDM), 2012 16th International Conference on}, doi = {10.1109/ONDM.2012.6210206}, pages = {1 -- 6}, year = {2012}, abstract = {In this paper, we study the influence of technology, traffic properties and price trends on optimized design of a reference IP-over-WDM network with rich underlying fiber topology. In each network node, we investigate the optimal degree of traffic switching in an optical (lambda) domain versus an electrical (packet) domain, also known as measure of \emph{node transparency}. This measure is studied in connection to changes in traffic volume, demand affinity, optical circuit speeds and equipment cost. By applying variable design constraints, we assess the relative roles of the two distinct equipment groups, IP routers and optical cross-connects, with respect to resulting changes in cost-sensitive network architectures.}, language = {en} } @inproceedings{D'AndreagiovanniKrolikowskiPulaj2014, author = {D'Andreagiovanni, Fabio and Krolikowski, Jonatan and Pulaj, Jonad}, title = {A hybrid primal heuristic for Robust Multiperiod Network Design}, booktitle = {EvoApplications 2014}, year = {2014}, language = {en} } @inproceedings{BuesingD'Andreagiovanni2014, author = {B{\"u}sing, Christina and D'Andreagiovanni, Fabio}, title = {A New Theoretical Framework for Robust Optimization Under Multi-Band Uncertainty}, booktitle = {Operations Research Proceedings 2012}, doi = {10.1007/978-3-319-00795-3_17}, pages = {115 -- 121}, year = {2014}, language = {en} } @inproceedings{BuesingD'AndreagiovanniRaymond2013, author = {B{\"u}sing, Christina and D'Andreagiovanni, Fabio and Raymond, Annie}, title = {0-1 Multiband Robust Optimization}, booktitle = {Operations Research Proceedings 2013}, year = {2013}, language = {en} } @inproceedings{BleyD'AndreagiovanniKarch2013, author = {Bley, Andreas and D'Andreagiovanni, Fabio and Karch, Daniel}, title = {WDM Fiber Replacement Scheduling}, volume = {41}, booktitle = {Proceedings of INOC 2013}, doi = {10.1016/j.endm.2013.05.092}, pages = {189 -- 196}, year = {2013}, language = {en} } @inproceedings{D'Andreagiovanni2012, author = {D'Andreagiovanni, Fabio}, title = {A Hybrid Exact-ACO Algorithm for the Joint Scheduling, Power and Cluster Assignment in Cooperative Wireless Networks}, booktitle = {BIONETICS 2012}, year = {2012}, language = {en} } @inproceedings{D'AndreagiovanniRaymond2014, author = {D'Andreagiovanni, Fabio and Raymond, Annie}, title = {Multiband Robust Optimization and its Adoption in Harvest Scheduling}, booktitle = {Proc. of FORMATH 2013}, year = {2014}, language = {en} }