<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>5892</id>
    <completedYear/>
    <publishedYear>2016</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst>283</pageFirst>
    <pageLast>298</pageLast>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume>9597</volume>
    <type>conferenceobject</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">An (MI)LP-based Primal Heuristic for 3-Architecture Connected Facility Location in Urban Access Network Design</title>
    <abstract language="eng">We investigate the 3-architecture Connected Facility Location Problem arising in the design of urban telecommunication access networks integrating wired and wireless technologies. We propose an original optimization model for the problem that includes additional variables and constraints to take into account wireless signal coverage represented through signal-to-interference ratios. Since the problem can prove very challenging even for modern state-of-the art optimization solvers, we propose to solve it by an original primal heuristic that combines a probabilistic fixing procedure, guided by peculiar Linear Programming relaxations, with an exact MIP heuristic, based on a very large neighborhood search. Computational experiments on a set of realistic instances show that our heuristic can find solutions associated with much lower optimality gaps than a state-of-the-art solver.</abstract>
    <parentTitle language="eng">EvoApplications: European Conference on the Applications of Evolutionary Computation. Applications of Evolutionary Computation. 19th European Conference, EvoApplications 2016, Porto, Portugal, March 30 -- April 1, 2016, Proceedings, Part I</parentTitle>
    <identifier type="doi">10.1007/978-3-319-31204-0_19</identifier>
    <enrichment key="Series">Lecture Notes in Computer Science</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-57139</enrichment>
    <author>Fabio D'Andreagiovanni</author>
    <submitter>Fabio D'Andreagiovanni</submitter>
    <author>Fabian Mett</author>
    <author>Jonad Pulaj</author>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="tele">Mathematics of Telecommunication</collection>
    <collection role="projects" number="ECMath-MI4">ECMath-MI4</collection>
    <collection role="projects" number="VINO">VINO</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
  <doc>
    <id>6062</id>
    <completedYear/>
    <publishedYear/>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>reportzib</type>
    <publisherName/>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>2016-10-19</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">Cutting Planes for Families Implying Frankl's Conjecture</title>
    <abstract language="eng">We find previously unknown families which imply Frankl’s conjecture using an algorithmic framework. The conjecture states that for any non-empty union-closed (or Frankl) family there exists an element in at least half of the sets. Poonen’s Theorem characterizes the existence of weights which determine whether a given Frankl family implies the conjecture for all Frankl families which contain it. A Frankl family is Non–Frankl-Complete (Non–FC), if it does not imply the conjecture in its elements for some Frankl family that contains it. We design a cutting-plane method that computes the explicit weights which imply the existence conditions of Poonen’s Theorem. This method allows us to find a counterexample to a ten-year-old conjecture by R. Morris about the structure of generators for Non–FC-families.</abstract>
    <identifier type="issn">1438-0064</identifier>
    <identifier type="urn">urn:nbn:de:0297-zib-60626</identifier>
    <author>Jonad Pulaj</author>
    <submitter>Jonad Pulaj</submitter>
    <series>
      <title>ZIB-Report</title>
      <number>16-51</number>
    </series>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>extremal combinatorics, extremal set theory, cutting plane, exact integer programming</value>
    </subject>
    <collection role="ccs" number="A.">General Literature</collection>
    <collection role="pacs" number="00.00.00">GENERAL</collection>
    <collection role="msc" number="05-XX">COMBINATORICS (For finite fields, see 11Txx)</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="institutes" number="mip">Mathematical Optimization Methods</collection>
    <collection role="persons" number="pulaj">Pulaj, Jonad</collection>
    <collection role="projects" number="MIP-ZIBOPT">MIP-ZIBOPT</collection>
    <collection role="projects" number="MODAL-SynLab">MODAL-SynLab</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
    <file>https://opus4.kobv.de/opus4-zib/files/6062/ZIB_Report_16_51.pdf</file>
    <file>https://opus4.kobv.de/opus4-zib/files/6062/revisedPulaj.pdf</file>
  </doc>
</export-example>
