The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks (Q518934): Difference between revisions

Revision as of 14:44, 13 July 2024

scientific article

Language	Label	Description	Also known as
English	The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks	scientific article

Statements

instance of

scholarly article

0 references

title

The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks (English)

0 references

0 references

0 references

0 references

0 references

Journal of Heuristics

0 references

publication date

4 April 2017

0 references

zbMATH Keywords

chance-constrained optimization

0 references

heuristic design

0 references

graph partitioning

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10732-014-9241-6

0 references

cites work

Q4796190

0 references

Sample average approximation method for chance constrained programming: Theory and applications

0 references

Robust solutions of uncertain linear programs

0 references

Beam search heuristic to solve stochastic integer problems under probabilistic constraints

0 references

The Price of Robustness

0 references

A survey on metaheuristics for stochastic combinatorial optimization

0 references

A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms

0 references

Q3575418

0 references

Uncertain convex programs: randomized solutions and confidence levels

0 references

The Scenario Approach to Robust Control Design

0 references

On an approximation measure founded on the links between optimization and polynomial approximation theory

0 references

Concavity and efficient points of discrete distributions in probabilistic programming.

0 references

Q4318617

0 references

Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning

0 references

Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks

0 references

On the Two-Stage Stochastic Graph Partitioning Problem

0 references

The node capacitated graph partitioning problem: A computational study

0 references

Knapsack problem with probability constraints

0 references

Some simplified NP-complete graph problems

0 references

An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations

0 references

Min-cut clustering

0 references

A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs

0 references

An Efficient Heuristic Procedure for Partitioning Graphs

0 references

Graph partitioning using linear and semidefinite programming

0 references

Cliques and clustering: A combinatorial approach

0 references

Q4838490

0 references

The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks

0 references

Cutting plane algorithms for solving a stochastic edge-partition problem

0 references

Randomized algorithms for robust controller synthesis using statistical learning theory

0 references

Identifiers

zbMATH Open document ID

1358.90163

0 references

DOI

10.1007/s10732-014-9241-6

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:518934

@@ Property / cites work @@
+Q4796190
@@ Property / cites work: Q4796190 / rank @@
+Normal rank
@@ Property / cites work @@
+Sample average approximation method for chance constrained programming: Theory and applications
+Normal rank
@@ Property / cites work @@
+Robust solutions of uncertain linear programs
@@ Property / cites work: Robust solutions of uncertain linear programs / rank @@
+Normal rank
@@ Property / cites work @@
+Beam search heuristic to solve stochastic integer problems under probabilistic constraints
+Normal rank
@@ Property / cites work @@
+The Price of Robustness
@@ Property / cites work: The Price of Robustness / rank @@
+Normal rank
@@ Property / cites work @@
+A survey on metaheuristics for stochastic combinatorial optimization
+Normal rank
@@ Property / cites work @@
+A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms
+Normal rank
@@ Property / cites work @@
+Q3575418
@@ Property / cites work: Q3575418 / rank @@
+Normal rank
@@ Property / cites work @@
+Uncertain convex programs: randomized solutions and confidence levels
+Normal rank
@@ Property / cites work @@
+The Scenario Approach to Robust Control Design
@@ Property / cites work: The Scenario Approach to Robust Control Design / rank @@
+Normal rank
@@ Property / cites work @@
+On an approximation measure founded on the links between optimization and polynomial approximation theory
+Normal rank
@@ Property / cites work @@
+Concavity and efficient points of discrete distributions in probabilistic programming.
+Normal rank
@@ Property / cites work @@
+Q4318617
@@ Property / cites work: Q4318617 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
+Normal rank
@@ Property / cites work @@
+Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
+Normal rank
@@ Property / cites work @@
+On the Two-Stage Stochastic Graph Partitioning Problem
+Normal rank
@@ Property / cites work @@
+The node capacitated graph partitioning problem: A computational study
+Normal rank
@@ Property / cites work @@
+Knapsack problem with probability constraints
@@ Property / cites work: Knapsack problem with probability constraints / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+An Improved Spectral Graph Partitioning Algorithm for Mapping Parallel Computations
+Normal rank
@@ Property / cites work @@
+Min-cut clustering
@@ Property / cites work: Min-cut clustering / rank @@
+Normal rank
@@ Property / cites work @@
+A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
+Normal rank
@@ Property / cites work @@
+An Efficient Heuristic Procedure for Partitioning Graphs
+Normal rank
@@ Property / cites work @@
+Graph partitioning using linear and semidefinite programming
+Normal rank
@@ Property / cites work @@
+Cliques and clustering: A combinatorial approach
@@ Property / cites work: Cliques and clustering: A combinatorial approach / rank @@
+Normal rank
@@ Property / cites work @@
+Q4838490
@@ Property / cites work: Q4838490 / rank @@
+Normal rank
@@ Property / cites work @@
+The robust binomial approach to chance-constrained optimization problems with application to stochastic partitioning of large process networks
+Normal rank
@@ Property / cites work @@
+Cutting plane algorithms for solving a stochastic edge-partition problem
+Normal rank
@@ Property / cites work @@
+Randomized algorithms for robust controller synthesis using statistical learning theory
+Normal rank