Commit 1f5a512e authored by msurl's avatar msurl
Browse files

added paper to references file

parent e6330210
......@@ -8,6 +8,7 @@ volume = {34},
journal = {Journal of Combinatorial Optimization},
doi = {10.1007/s10878-017-0128-y}
}
@InProceedings{bomersbach,
author="Bomersbach, Anna
and Chiarandini, Marco
......@@ -23,6 +24,7 @@ pages="27--39",
abstract="Cancer is a disease driven mostly by somatic mutations appearing in an individual's genome. One of the main challenges in large cancer studies is to identify the handful of driver mutations responsible for cancer among the hundreds or thousands mutations present in a tumour genome. Recent approaches have shown that analyzing mutations in the context of interaction networks increases the power to identify driver mutations.",
isbn="978-3-319-43681-4"
}
@article{fischetti_steiner_t,
title = "Thinning out Steiner trees: a node based model for uniform edge costs",
abstract = "The Steiner tree problem is a challenging NP-hard problem. Many hard instances of this problem are publicly available, that are still unsolved by state-of-the-art branch-and-cut codes. A typical strategy to attack these instances is to enrich the polyhedral description of the problem, and/or to implement more and more sophisticated separation procedures and branching strategies. In this paper we investigate the opposite viewpoint, and try to make the solution method as simple as possible while working on the modeling side. Our working hypothesis is that the extreme hardness of some classes of instances mainly comes from over-modeling, and that some instances can become quite easy to solve when a simpler model is considered. In other words, we aim at “thinning out” the usual models for the sake of getting a more agile framework. In particular, we focus on a model that only involves node variables, which is rather appealing for the “uniform” cases where all edges have the same cost. In our computational study, we first show that this new model allows one to quickly produce very good (sometimes proven optimal) solutions for notoriously hard instances from the literature. In some cases, our approach takes just few seconds to prove optimality for instances never solved (even after days of computation) by the standard methods. Moreover, we report improved solutions for several SteinLib instances, including the (in)famous hypercube ones. We also demonstrate how to build a unified solver on top of the new node-based model and the previous state-of-the-art model (defined in the space of arc and node variables). The solver relies on local branching, initialization heuristics, preprocessing and local search procedures. A filtering mechanism is applied to automatically select the best algorithmic ingredients for each instance individually. The presented solver is the winner of the DIMACS Challenge on Steiner trees in most of the considered categories.",
......@@ -38,6 +40,7 @@ issn = "1867-2949",
publisher = "Springer Berlin Heidelberg",
number = "2",
}
@InProceedings{number_v_sep,
author="Gaspers, Serge
and Mackenzie, Simon",
......@@ -51,3 +54,13 @@ pages="116--121",
abstract="We consider the largest number of minimal separators a graph on n vertices can have.",
isbn="978-3-662-53174-7"
}
@article{on_imposing_con,
author = {Wang, Yiming and Buchanan, Austin and Butenko, Sergiy},
year = {2017},
month = {02},
pages = {},
title = {On imposing connectivity constraints in integer programs},
journal = {Mathematical Programming},
doi = {10.1007/s10107-017-1117-8}
}
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment