Extended formulation for hop constrained distribution network configuration problems
type: Item
instance of: scholarly article
title: Extended formulation for hop constrained distribution network configuration problems
zbMATH Open document ID: 1374.90082
author: Bernard Fortz
author: Jérôme de Boeck
published in: European Journal of Operational Research
publication date: 2017-11-23T00:00:00Z
full work available at URL: MMPrev1.1.pdf
Mathematics Subject Classification ID: 90B10
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 6811851
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: distribution networks
zbMATH Keywords: hop constraints
zbMATH Keywords: extended formulations
zbMATH Keywords: layered graphs
MaRDI profile type: Publication
OpenAlex ID: W2745506364
cites work: Using a Hop-Constrained Model to Generate Alternative Communication Network Design
cites work: The network design problem with relays
cites work: Extended formulations in combinatorial optimization
cites work: General network design: a unified view of combined location and network design problems
cites work: Progress in presolving for mixed integer programming
cites work: Q4198056
cites work: Outline of an algorithm for integer solutions to linear programs
cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
cites work: On the capacitated concentrator location problem: a reformulation by discretization
cites work: Hop constrained Steiner trees with multiple root nodes
cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
cites work: Hamilton Paths in Grid Graphs
cites work: Modelling the hop constrained connected facility location problem on layered graphs
cites work: A note on ``Reducing the number of binary variables in cutting stock problems''
cites work: A survey of combinatorial optimization problems in multicast routing
cites work: Optimizing over the first Chvátal closure
cites work: New formulations and solution procedures for the hop constrained network design problem.
cites work: Connectivity-and-hop-constrained design of electricity distribution networks
cites work: The Steiner tree problem with hop constraints
cites work: Q4254875
DOI: 10.1016/J.EJOR.2017.08.017
description: scientific article; zbMATH DE number 6811851