Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks

DOI10.1002/net.22083zbMath1528.90068OpenAlexW3212634810MaRDI QIDQ6087570

Unnamed Author, Unnamed Author

Publication date: 12 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22083

zbMATH Keywords

branch-and-pricenetwork optimizationmixed integer programming (MIP)unsplittable multi-commodity flow

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Communication networks in operations research (90B18)

Cites Work

• Unnamed Item
• On splittable and unsplittable flow capacitated network design arc-set polyhedra.
• Maximum concurrent flow with incomplete data
• Revisiting Lagrangian relaxation for network design
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• On the minimum cost multiple-source unsplittable flow problem
• Models and Algorithms for Robust Network Design with Several Traffic Scenarios
• Acceleration of cutting-plane and column generation algorithms: Applications to network design
• Convex Combinations of Single Source Unsplittable Flows
• The capacity of wireless networks
• Linear network coding
• Automation and Combination of Linear-Programming Based Stabilization Techniques in Column Generation
• Exact Approaches for Network Design Problems with Relays
• Column Generation
• Selected Topics in Column Generation
• Implementing Mixed Integer Column Generation

This page was built for publication: Branch‐and‐price for energy optimization in multi‐hop wireless sensor networks