A hybrid path‐relinking method for solving two‐stage stochastic integer problems

DOI10.1111/itor.12084zbMath1309.90067OpenAlexW1599419070MaRDI QIDQ5246827

Alysson M. Costa, Bernardo Almada-Lobo, Pedro Amorim

Publication date: 22 April 2015

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12084

zbMATH Keywords

stochastic programmingdemand uncertaintypath relinkinglot sizing and schedulingmixed-integer solver

Mathematics Subject Classification ID

Mixed integer programming (90C11) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

From scenarios to conditional scenarios in two‐stage stochastic MILP problems

Cites Work

• Influence of consumer purchasing behaviour on the production planning of perishable food
• Progressive hedging innovations for a class of stochastic mixed-integer resource allocation problems
• A survey on metaheuristics for stochastic combinatorial optimization
• Tabu search when noise is present: An illustration in the context of cause and effect analysis
• Simultaneous lotsizing and scheduling on parallel machines
• Scenarios and Policy Aggregation in Optimization Under Uncertainty
• A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management
• Benchmarking optimization software with performance profiles.