Beam search heuristic to solve stochastic integer problems under probabilistic constraints (Q2484339): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: OR-Library / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2004.02.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2004572554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Probabilistic Set-Covering Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound method for stochastic integer problems under probabilistic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chance-Constrained Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for probabilistic integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chance Constrained Programming with Joint Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strategic facility location: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5638126 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contributions to the theory of stochastic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual method for the solution of a one-stage stochastic programming problem with random RHS obeying a discrete probability distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4838490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840335 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job shop scheduling with beam search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxations for probabilistically constrained programs with discrete random variables / rank
 
Normal rank

Latest revision as of 13:41, 10 June 2024

scientific article
Language Label Description Also known as
English
Beam search heuristic to solve stochastic integer problems under probabilistic constraints
scientific article

    Statements

    Beam search heuristic to solve stochastic integer problems under probabilistic constraints (English)
    0 references
    1 August 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Stochastic programming
    0 references
    Combinatorial optimization
    0 references
    Beam search heuristic
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references