A comparative study of decomposition algorithms for stochastic combinatorial optimization
type: Item
instance of: scholarly article
title: A comparative study of decomposition algorithms for stochastic combinatorial optimization
zbMATH Open document ID: 1153.90515
author: Lewis Ntaimo
author: Suvrajeet Sen
published in: Computational Optimization and Applications
publication date: 2009-02-13T00:00:00Z
full work available at URL: http://edoc.hu-berlin.de/18452/9000
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5508151
zbMATH Keywords: Stochastic mixed-integer programming
zbMATH Keywords: Disjunctive decomposition
zbMATH Keywords: Stochastic server location
zbMATH Keywords: Strategic supply chain planning
describes a project that uses: HTCondor MW
describes a project that uses: CPLEX
MaRDI profile type: Publication
OpenAlex ID: W1965736643
cites work: A multi-stage stochastic integer programming approach for capacity expansion under uncertainty
cites work: BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs.
cites work: An approach for strategic supply chain planning under uncertainty based on stochastic 0-1 programming
cites work: Disjunctive Programming
cites work: Partitioning procedures for solving mixed-variables programming problems
cites work: Q4851830
cites work: Schumann, a modeling framework for supply chain management under uncertainty
cites work: The integer \(L\)-shaped method for stochastic integer programs with complete recourse
cites work: Computational solution of capacity planning models under uncertainty
cites work: The million-variable ``march'' for stochastic combinatorial optimization
cites work: Q4452916
cites work: The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification
cites work: Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming
cites work: The sample average approximation method applied to stochastic routing problems: a computational study
cites work: Facility location models for immobile servers with stochastic demand
cites work: Stochastic Programs with Fixed Recourse: The Equivalent Deterministic Program
DOI: 10.1007/S10589-007-9085-1
description: scientific article; zbMATH DE number 5508151