A decomposition approach for solving a broadcast domination network design problem
From MaRDI portal
Publication:2442092
DOI10.1007/s10479-011-0962-8zbMath1308.90190OpenAlexW2088124884MaRDI QIDQ2442092
Publication date: 31 March 2014
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-011-0962-8
Programming involving graphs or networks (90C35) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Linear-time algorithm for paired-domination on distance-hereditary graphs, New bounds for the broadcast domination number of a graph, Logic-Based Benders Decomposition for Large-Scale Optimization
Cites Work
- A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse
- The integer \(L\)-shaped method for stochastic integer programs with complete recourse
- Decomposition in general mathematical programming
- A hybrid method for the planning and scheduling
- Optimal broadcast domination in polynomial time
- Partitioning procedures for solving mixed-variables programming problems
- L-shaped decomposition of two-stage stochastic programs with integer recourse
- A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems
- Logic-based Benders decomposition
- Generalized Benders decomposition
- The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
- Broadcasts in graphs
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- Planning and Scheduling by Logic-Based Benders Decomposition
- Planning and Scheduling to Minimize Tardiness
- Accelerating Benders method using covering cut bundle generation
- An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs
- Two stage linear programming under uncertainty with 0–1 integer first stage variables
- The Vehicle Routing Problem with Stochastic Travel Times
- Exact Solution to a Location Problem with Stochastic Demands
- Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming
- L-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming
- Principles and Practice of Constraint Programming – CP 2004
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
