Fenchel decomposition for stochastic mixed-integer programming (Q1937960)

From MaRDI portal

Revision as of 14:03, 16 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Fenchel decomposition for stochastic mixed-integer programming	scientific article

Statements

scholarly article

0 references

Fenchel decomposition for stochastic mixed-integer programming (English)

0 references

0 references

Journal of Global Optimization

0 references

publication date

1 February 2013

0 references

zbMATH Keywords

integer programming

0 references

Fenchel decomposition

0 references

FD cuts

0 references

lifting

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10898-011-9817-8

0 references

A finite branch-and-bound algorithm for two-stage stochastic integer programs

0 references

0 references

0 references

Disjunctive Programming

0 references

A lift-and-project cutting plane algorithm for mixed 0-1 programs

0 references

Partitioning procedures for solving mixed-variables programming problems

0 references

Introduction to Stochastic Programming

0 references

The value function of an integer program

0 references

Generating Fenchel Cutting Planes for Knapsack Polyhedra

0 references

Fenchel Cutting Planes for Integer Programs

0 references

Solving \(0/1\) integer programs with enumeration cutting planes

0 references

On the Convergence of Fenchel Cutting Planes in Mixed-Integer Programming

0 references

L-shaped decomposition of two-stage stochastic programs with integer recourse

0 references

A cutting-plane approach to mixed 0-1 stochastic integer programs

0 references

Stochastic integer programming: general models and algorithms

0 references

The integer \(L\)-shaped method for stochastic integer programs with complete recourse

0 references

The million-variable ``march'' for stochastic combinatorial optimization

0 references

A comparative study of decomposition algorithms for stochastic combinatorial optimization

0 references

Computations with disjunctive cuts for two-stage stochastic mixed 0-1 integer programs

0 references

Solving capacitated facility location problems by Fenchel cutting planes

0 references

Convex Analysis

0 references

Solving linear programming relaxations associated with Lagrangean relaxations by Fenchel cutting planes

0 references

Continuity Properties of Expectation Functions in Stochastic Integer Programming

0 references

Stochastic programming with integer variables

0 references

Two‐stage stochastic integer programming: a survey

0 references

Solving stochastic programs with integer recourse by enumeration: A framework using Gröbner basis reductions

0 references

0 references

The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification

0 references

0 references

Decomposition with branch-and-cut approaches for two-stage stochastic mixed-integer programming

0 references

Optimization with disjunctive constraints

0 references

On solving discrete two-stage stochastic programs having mixed-integer first- and second-stage variables

0 references

<i>L</i>-Shaped Linear Programs with Applications to Optimal Control and Stochastic Programming

0 references

Two stage linear programming under uncertainty with 0–1 integer first stage variables

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10898-011-9817-8

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1937960

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1937960&oldid=38799104"