Regenerator location problem: polyhedral study and effective branch-and-cut algorithms

DOI10.1016/J.EJOR.2016.07.032MaRDI QIDQ1752767zbMATH OpenOpenAlexFDO

Authors Xiangyong Li, Y. P. Aneja

Publication date 24 May 2018

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

Full work available at URL https://doi.org/10.1016/j.ejor.2016.07.032

zbMATH Keywords

branch and cutfacetsinteger programmingoptical network designregenerator placement

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Discrete location and assignment (90B80) Integer programming (90C10) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• A new branch-and-cut approach for the generalized regenerator location problem
• The Generalized Regenerator Location Problem
• A branch-and-Benders-cut approach for the fault tolerant regenerator location problem
• Improved heuristics for the regenerator location problem
• On the complexity of the regenerator location problem -- treewidth and other parameters (extended abstract)
• On the complexity of the regenerator location problem treewidth and other parameters
• The regenerator location problem
• Polyhedral analysis for concentrator location problems
• Regenerator location problem in flexible optical networks
• A branch-and-cut algorithm for the plant-cycle location problem

Cites work

• A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
• A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
• An exact algorithm for the maximum leaf spanning tree problem
• An exact algorithm for the maximum leaf spanning tree problem.
• Approximation algorithms for connected dominating sets
• Benders decomposition, branch-and-cut, and hybrid algorithms for the minimum connected dominating set problem
• Fixed-charge transportation problem: facets of the projection polyhedron
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 3573250 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1312984 (Why is no real title available?)
• Improved heuristics for the regenerator location problem
• Integer linear programming models for topology optimization in sheet metal design
• Metaheuristic hybridizations for the regenerator placement and dimensioning problem in sub-wavelength switching optical networks
• On connected dominating sets of restricted diameter
• On the complexity of the regenerator location problem -- treewidth and other parameters (extended abstract)
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• Online optimization of busy time on parallel machines. (Extended abstract)
• Reformulations and solution algorithms for the maximum leaf spanning tree problem
• Solving the connected dominating set problem and power dominating set problem by integer programming
• The Generalized Regenerator Location Problem
• The Maximum Weight Connected Subgraph Problem
• The maximum-leaf spanning tree problem: Formulations and facets
• The minimum connected dominating set problem: formulation, valid inequalities and a branch-and-cut algorithm
• The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
• The regenerator location problem

Cited in

(8)

• A branch-and-Benders-cut approach for the fault tolerant regenerator location problem
• The regenerator location problem
• The Generalized Regenerator Location Problem
• Regenerator location problem in flexible optical networks
• The optimal design of low-latency virtual backbones
• Improved heuristics for the regenerator location problem
• A new branch-and-cut approach for the generalized regenerator location problem
• On the complexity of the regenerator location problem treewidth and other parameters

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: Regenerator location problem: polyhedral study and effective branch-and-cut algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1752767)