Configuration‐based approach for topological problems in the design of wireless sensor networks
From MaRDI portal
Publication:6088118
DOI10.1111/itor.12615OpenAlexW2901906539MaRDI QIDQ6088118
Vinicius Morais, Geraldo Robson Mateus
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12615
Related Items (3)
Branch‐and‐cut algorithms for the ‐arborescence star problem ⋮ Allocating revenues in a Smart TV ecosystem ⋮ A data‐driven optimization approach to plan smart waste collection operations
Cites Work
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design
- A branch-and-cut-and-price algorithm for the Stackelberg minimum spanning tree game
- A column generation approach to extend lifetime in wireless sensor networks with coverage and connectivity constraints
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- A tutorial on column generation and branch-and-price for vehicle routing problems
- Branch-and-cut-and-price for capacitated connected facility location
- MIP models for connected facility location: a theoretical and computational study
- The \(p\)-median problem: a survey of metaheuristic approaches
- Computational study of large-scale \(p\)-median problems
- On the choice of explicit stabilizing terms in column generation
- The tree of hubs location problem
- Stabilized column generation
- A hybrid heuristic for the \(p\)-median problem
- Locating median cycles in networks
- A cutting plane algorithm for the capacitated connected facility location problem
- Interior point stabilization for column generation
- A survey of application distribution in wireless sensor networks
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
- On the Asymmetric Connected Facility Location Polytope
- The Capacitated m-Ring-Star Problem
- State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
- State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- Technical Note—An Algorithm for the p-Median Problem
- The Ring Star Problem: Polyhedral analysis and exact algorithm
- Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints
- A Primer in Column Generation
- Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
- The Traveling-Salesman Problem and Minimum Spanning Trees
- Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
This page was built for publication: Configuration‐based approach for topological problems in the design of wireless sensor networks
