BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. (Q1410308): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 17:38, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. |
scientific article |
Statements
BFC, A branch-and-fix coordination algorithmic framework for solving some types of stochastic pure and mixed 0--1 programs. (English)
0 references
14 October 2003
0 references
Stochastic programming
0 references
Multistage scenario tree
0 references
Mixed 0--1 programs
0 references
Splitting variables representation
0 references
Twin node families
0 references
