A decomposition approach for solving a broadcast domination network design problem (Q2442092): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-011-0962-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088124884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3277097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3378248 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4677956 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: L-shaped decomposition of two-stage stochastic programs with integer recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Broadcasts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition in general mathematical programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal broadcast domination in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid method for the planning and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and Scheduling to Minimize Tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and Scheduling by Logic-Based Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic-based Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem with Stochastic Travel Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution to a Location Problem with Stochastic Demands / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5641193 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders method using covering cut bundle generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification of Benders' decomposition algorithm for discrete subproblems: An approach for stochastic programs with integer recourse / rank
 
Normal rank
Property / cites work
 
Property / cites work: <i>L</i>-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two stage linear programming under uncertainty with 0–1 integer first stage variables / rank
 
Normal rank

Latest revision as of 12:29, 7 July 2024

scientific article
Language Label Description Also known as
English
A decomposition approach for solving a broadcast domination network design problem
scientific article

    Statements

    A decomposition approach for solving a broadcast domination network design problem (English)
    0 references
    0 references
    0 references
    31 March 2014
    0 references
    broadcast domination
    0 references
    integer programming
    0 references
    Benders decomposition
    0 references
    cutting-plane algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers