Stochastic binary problems with simple penalties for capacity constraints violations
type: Item
instance of: scholarly article
title: Stochastic binary problems with simple penalties for capacity constraints violations
zbMATH Open document ID: 1266.90134
author: Martine Labbé
author: Michael Poss
author: Bernard Fortz
author: François V. Louveaux
published in: Mathematical Programming. Series A. Series B
publication date: 2013-05-06T00:00:00Z
Mathematics Subject Classification ID: 90C15
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C09
zbMATH DE Number: 6160904
zbMATH Keywords: stochastic programming
zbMATH Keywords: knapsack problem
zbMATH Keywords: pseudo-polynomial algorithm
zbMATH Keywords: mixed-integer nonlinear programming
zbMATH Keywords: branch-and-cut algorithm
describes a project that uses: Knapsack
describes a project that uses: Bonmin
describes a project that uses: MULKNAP
describes a project that uses: CPLEX
describes a project that uses: FilMINT
MaRDI profile type: Publication
full work available at URL: s10107-012-0520-4
OpenAlex ID: W2036826174
cites work: FilMINT: an outer approximation-based solver for convex mixed-integer nonlinear programs
cites work: Minimization of half-products
cites work: An exact approach for solving integer problems under probabilistic constraints with random technology matrix
cites work: Introduction to Stochastic Programming
cites work: An algorithmic framework for convex mixed integer nonlinear programs
cites work: Algorithms and Software for Convex Mixed Integer Nonlinear Programs
cites work: A survey of algorithms for the generalized assignment problem
cites work: A robust approach to the chance-constrained knapsack problem
cites work: Technical Note—Some Special Cases of Stochastic Programs with Recourse
cites work: An algorithm for the construction of convex hulls in simple integer recourse programming
cites work: The Dynamic and Stochastic Knapsack Problem with Random Sized Items
cites work: The sample average approximation method for stochastic discrete optimization
cites work: Solving chance-constrained combinatorial problems to optimality
cites work: Upper bounds for the 0-1 stochastic knapsack problem and a B\&B algorithm
cites work: The Vehicle Routing Problem with Stochastic Travel Times
cites work: Stochastic programming with simple integer recourse
cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
cites work: Q4377043
cites work: Robust Optimization of Large-Scale Systems
cites work: Solving the generalized assignment problem: an optimizing and heuristic approach
cites work: An exact algorithm for large multiple knapsack problems
cites work: Q3126752
cites work: Solving stochastic programs with simple recourse
DOI: 10.1007/S10107-012-0520-4
description: scientific article; zbMATH DE number 6160904