A Benders decomposition based framework for solving cable trench problems
type: Item
instance of: scholarly article
title: A Benders decomposition based framework for solving cable trench problems
zbMATH Open document ID: 1391.90505
author: Hatice Calik
author: Markus Leitner
author: Martin Luipersbeck
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
full work available at URL: paper.pdf
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6901379
zbMATH Keywords: location
zbMATH Keywords: network design
zbMATH Keywords: Benders decomposition
zbMATH Keywords: integer linear programming
describes a project that uses: CPLEX
describes a project that uses: OGDF
describes a project that uses: OR-Library
describes a project that uses: Algorithm 97
MaRDI profile type: Publication
OpenAlex ID: W2567364810
Wikidata QID: Q56524095
cites work: Acceleration of cutting-plane and column generation algorithms: Applications to network design
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: On implementing push-relabel method for the maximum flow problem
cites work: A note on two problems in connexion with graphs
cites work: Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
cites work: A column generation approach to capacitated \(p\)-median problems
cites work: Lagrangean relaxation heuristics for the \(p\)-cable-trench problem
cites work: The m-Center Problem
cites work: The cable trench problem: Combining the shortest path and minimum spanning tree problems
DOI: 10.1016/J.COR.2016.12.015
description: scientific article; zbMATH DE number 6901379