An algorithmic framework for the exact solution of tree-star problems

DOI10.1016/j.ejor.2017.02.011zbMath1403.90577OpenAlexW2588888080WikidataQ57705353 ScholiaQ57705353MaRDI QIDQ1753556

Juan-José Salazar-González, Ivana Ljubić, Markus Sinnl, Markus Leitner

Publication date: 29 May 2018

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/126355/1/ConFLthinning_TR.pdf

zbMATH Keywords

combinatorial optimizationbranch-and-cutBenders decompositiondual ascentconnected facility location

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Distributed systems (68M14)

Related Items (10)

Layered graph approaches for combinatorial optimization problems ⋮ The \(p\)-arborescence star problem: formulations and exact solution approaches ⋮ Exact algorithms for budgeted prize-collecting covering subgraph problems ⋮ Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks ⋮ The connected facility location polytope ⋮ Branch‐and‐cut algorithms for the ‐arborescence star problem ⋮ Solving Steiner trees: Recent advances, challenges, and perspectives ⋮ A branch-and-cut algorithm for the maximum covering cycle problem ⋮ An exact solution framework for the minimum cost dominating tree problem ⋮ The incremental connected facility location problem

Uses Software

• SteinLib
• OR-Library

Cites Work

• Unnamed Item
• Branch-and-cut-and-price for capacitated connected facility location
• MIP models for connected facility location: a theoretical and computational study
• Hybrid metaheuristics. 4th international workshop, HM 2007, Dortmund, Germany, October 8--9, 2007. Proceedings
• On the exact solution of large-scale simple plant location problems
• Digital data networks design using genetic algorithms
• The General Steiner Tree-Star problem.
• Approximation algorithms for data management in networks
• Primal-dual algorithms for connected facility location problems
• Connected facility location via random facility sampling and core detouring
• An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
• Solving the simple plant location problem by genetic algorithm
• Dual-Based Local Search for the Connected Facility Location and Related Problems
• Approximation Algorithms for Single and Multi-Commodity Connected Facility Location
• The Push Tree problem
• On the Asymmetric Connected Facility Location Polytope
• A dual ascent approach for steiner tree problems on a directed graph
• Solving Steiner tree problems in graphs to optimality
• Approximation Algorithms for Directed Steiner Problems
• A Branch and Cut Algorithm for a Steiner Tree-Star Problem
• A faster approximation algorithm for the Steiner problem in graphs
• Improved algorithms for the Steiner problem in networks

This page was built for publication: An algorithmic framework for the exact solution of tree-star problems