Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems (Q3466775): Difference between revisions

From MaRDI portal
Created claim: MaRDI profile type (P1460): MaRDI publication profile (Q5976449), #quickstatements; #temporary_batch_1710401496743
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1287/ijoc.2014.0627 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/ijoc.2014.0627 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972775205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3825952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization using special ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for probabilistic integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical Solution of Large Mixed Integer Programming Problems with Umpire / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic bottleneck spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chance constrained bottleneck spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Sample Average Approximation Method for Stochastic Discrete Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sample Approximation Approach for Optimization with Probabilistic Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monte Carlo bounding techniques for determinig solution quality in stochastic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound method for stochastic global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rate of Convergence of Optimal Solutions of Monte Carlo Approximations of Stochastic Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and solution techniques for production planning problems with increasing byproducts / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/IJOC.2014.0627 / rank
 
Normal rank

Latest revision as of 09:01, 21 December 2024

scientific article
Language Label Description Also known as
English
Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems
scientific article

    Statements

    Chance-Constrained Programming Models and Approximations for General Stochastic Bottleneck Spanning Tree Problems (English)
    0 references
    0 references
    0 references
    0 references
    25 January 2016
    0 references
    stochastic bottleneck spanning tree
    0 references
    chance-constrained programming
    0 references
    special ordered sets
    0 references
    bisection algorithm
    0 references
    NP-complete
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references