Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
type: Item
instance of: scholarly article
title: Regenerator location problem: polyhedral study and effective branch-and-cut algorithms
zbMATH Open document ID: 1394.90548
author: Xiangyong Li
author: Y. P. Aneja
published in: European Journal of Operational Research
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90B18
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 6872907
zbMATH Keywords: optical network design
zbMATH Keywords: regenerator placement
zbMATH Keywords: integer programming
zbMATH Keywords: branch and cut
zbMATH Keywords: facets
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: j.ejor.2016.07.032
OpenAlex ID: W2476038618
cites work: Fixed-Charge Transportation Problem: Facets of the Projection Polyhedron
cites work: The Maximum Weight Connected Subgraph Problem
cites work: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
cites work: On connected dominating sets of restricted diameter
cites work: A Computational Study of the Pseudoflow and Push-Relabel Algorithms for the Maximum Flow Problem
cites work: The regenerator location problem
cites work: The Generalized Regenerator Location Problem
cites work: Improved heuristics for the regenerator location problem
cites work: Solving the Connected Dominating Set Problem and Power Dominating Set Problem by Integer Programming
cites work: An exact algorithm for the maximum leaf spanning tree problem
cites work: Q3292914
cites work: Integer linear programming models for topology optimization in sheet metal design
cites work: An exact algorithm for the maximum leaf spanning tree problem.
cites work: The maximum-leaf spanning tree problem: Formulations and facets
cites work: Q4198056
cites work: Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
cites work: A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
cites work: Approximation algorithms for connected dominating sets
cites work: On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters
cites work: The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
cites work: Reformulations and solution algorithms for the maximum leaf spanning tree problem
cites work: Metaheuristic hybridizations for the regenerator placement and dimensioning problem in sub-wavelength switching optical networks
cites work: Q4144192
cites work: Online Optimization of Busy Time on Parallel Machines
cites work: The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm
cites work: Q4254875
DOI: 10.1016/J.EJOR.2016.07.032
Recommended article: A new branch-and-cut approach for the generalized regenerator location problem
Recommended article: The Generalized Regenerator Location Problem
Recommended article: A branch-and-Benders-cut approach for the fault tolerant regenerator location problem
Recommended article: Improved heuristics for the regenerator location problem
Recommended article: On the Complexity of the Regenerator Location Problem - Treewidth and Other Parameters
Recommended article: On the complexity of the regenerator location problem treewidth and other parameters
Recommended article: The regenerator location problem
Recommended article: Polyhedral analysis for concentrator location problems
Recommended article: Regenerator Location Problem in Flexible Optical Networks
Recommended article: A branch-and-cut algorithm for the plant-cycle location problem
description: scientific article; zbMATH DE number 6872907