A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks
DOI10.1016/j.ejor.2016.04.058zbMath1346.90235OpenAlexW2345953693MaRDI QIDQ323507
Bernard Gendron, Luca Tavanti, Gianfranco Nencioni, Maria Grazia Scutellà, Rosario Giuseppe Garroppo
Publication date: 7 October 2016
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.04.058
integer programmingnetwork designbranch-and-cutBenders decompositiongreen wireless local area network
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)
Related Items (15)
Cites Work
- A hybrid outer-approximation/Benders decomposition algorithm for the single allocation hub location problem under congestion
- An improved Benders decomposition applied to a multi-layer network design problem
- Partitioning procedures for solving mixed-variables programming problems
- Logic-based Benders decomposition
- Pure 0-1 programming approaches to wireless network design. (Summary)
- An interior-point Benders based branch-and-cut algorithm for mixed integer programs
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- A nested benders decomposition approach for telecommunication network planning
- A Modified Benders' Partitioning Algorithm for Mixed Integer Programming
- Solving Wind Farm Layout Optimization with Mixed Integer Programming and Constraint Programming
- Canonical Cuts on the Unit Hypercube
- Benchmarking optimization software with performance profiles.
- Unnamed Item
- Unnamed Item
This page was built for publication: A branch-and-Benders-cut method for nonlinear power design in green wireless local area networks