Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Two algorithms for solving 3-objective k-ArchConFL and IPs in general

Please always quote using this URN: urn:nbn:de:0297-zib-56259
  • We present two algorithms to solve a 3-objective optimization problem arising in telecommunications access network planning, the k-Architecture Connected Facility Location Problem. The methods can also be used to solve any 3-objective integer linear programming model and can be extended to the multiobjective case. We give some exemplary computations using small and medium-sized instances for our problem.

Download full text files

Export metadata

Metadaten
Author:Markus Leitner, Ivana Ljubic, Markus Sinnl, Axel Werner
Document Type:ZIB-Report
Tag:integer programming; multiobjective optimization; telecommunications
MSC-Classification:90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING
Date of first Publication:2015/09/30
Series (Serial Number):ZIB-Report (15-48)
ISSN:1438-0064
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.