Copertina

Adjustable Robust Nonlinear Network Design Without Controllable Elements under Load Scenario Uncertainties

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Thürauf, Johannes, Grübel, Julia, Schmidt, Martin
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 90C11, 90C17, 90C35, 90C90
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

On Computing and Pricing of Adjustable Robust Chemical Process Designs
di: Schwientek, Jan, et al.
Pubblicazione: (2025)

A Positive Semidefinite Safe Approximation of Multivariate Distributionally Robust Constraints Determined by Simple Functions
di: Dienstbier, J., et al.
Pubblicazione: (2023)

A Computational Study for Solving Decision-Dependent Robust Problems as Bilevel Optimization Problems
di: Lefebvre, Henri, et al.
Pubblicazione: (2025)

Designing Tractable Piecewise Affine Policies for Multi-Stage Adjustable Robust Optimization
di: Thomä, Simon, et al.
Pubblicazione: (2022)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
di: Nguyen, Vinh
Pubblicazione: (2025)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
di: Guo, Feng, et al.
Pubblicazione: (2023)

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
di: Borges, Jennifer C., et al.
Pubblicazione: (2026)

Characterization of Highly Robust Solutions in Multi-Objective Programming in Banach Spaces
di: Rahimi, Morteza, et al.
Pubblicazione: (2025)

A Gauge Set Framework for Flexible Robustness Design
di: Wei, Ningji, et al.
Pubblicazione: (2025)

Mixed-Integer Linear Optimization for Cardinality-Constrained Random Forests
di: Burgard, Jan Pablo, et al.
Pubblicazione: (2024)

Mixed-Integer Linear Optimization for Semi-Supervised Optimal Classification Trees
di: Burgard, Jan Pablo, et al.
Pubblicazione: (2024)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
di: Gómez-Casares, Ignacio, et al.
Pubblicazione: (2025)

Sparse Polynomial Optimization with Unbounded Sets
di: Huang, Lei, et al.
Pubblicazione: (2024)

Sparse Polynomial Matrix Optimization
di: Miller, Jared, et al.
Pubblicazione: (2024)

Parabolic Approximation & Relaxation for MINLP
di: Göß, Adrian, et al.
Pubblicazione: (2024)

An Exact Algorithm for Public Transport Line Planning Considering Passenger and Operational Costs and Lost Demand
di: Hansen, Siv Marie Cartland, et al.
Pubblicazione: (2026)

A Safe Approximation Based on Mixed-Integer Optimization for Non-Convex Distributional Robustness Governed by Univariate Indicator Functions
di: Dienstbier, Jana, et al.
Pubblicazione: (2023)

Solving Min-Cost Concave Generalized Dynamic Flows and Approximating Dynamic Optimal Power Flows
di: Rothschild, Jacob H.
Pubblicazione: (2024)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
di: McRae, Andrew D., et al.
Pubblicazione: (2023)

A Canceling Heuristic for the Directed Traveling Salesman Problem
di: Borgwardt, Steffen, et al.
Pubblicazione: (2026)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
di: Bestuzheva, Ksenia, et al.
Pubblicazione: (2022)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
di: Göß, Adrian
Pubblicazione: (2026)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
di: Kempke, Nils-Christian, et al.
Pubblicazione: (2025)

Benders decomposition algorithms for minimizing the spread of harmful contagions in networks
di: Tanınmış, Kübra, et al.
Pubblicazione: (2023)

Improved semidefinite programming bounds for the maximum $k$-colorable subgraph problem
di: Barkel, Mathijs, et al.
Pubblicazione: (2026)

The SCIP Optimization Suite 10.0
di: Hojny, Christopher, et al.
Pubblicazione: (2025)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
di: Tang, Tianyun, et al.
Pubblicazione: (2024)

SDP Approach to Quadratic Vertex-Disjoint Paths Problem
di: Xu, Mingming, et al.
Pubblicazione: (2026)

On exactness of SDP relaxation for the maximum cut problem
di: Bhardwaj, Avinash, et al.
Pubblicazione: (2025)

An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
di: Liang, Ling, et al.
Pubblicazione: (2024)

Surrogate-based categorical neighborhoods for mixed-variable blackbox optimization
di: Audet, Charles, et al.
Pubblicazione: (2026)

CatMADS: Mesh Adaptive Direct Search for constrained blackbox optimization with categorical variables
di: Audet, Charles, et al.
Pubblicazione: (2025)

A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization
di: Mexi, Gioni, et al.
Pubblicazione: (2025)

A Unifying Convexification Framework for Chance-Constrained Programs via Bilinear Extended Formulations over a Simplex
di: Davarnia, Danial, et al.
Pubblicazione: (2025)

Lagrangian cuts generated by batch to efficiently solve two-stage stochastic mixed-integer program
di: Xiaoyu, Luo, et al.
Pubblicazione: (2024)

Tighter yet more tractable relaxations and nontrivial instance generation for sparse standard quadratic optimization
di: Bomze, Immanuel, et al.
Pubblicazione: (2024)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Multi-timescale Stochastic Programming with Applications in Power Systems
di: Zhang, Yihang, et al.
Pubblicazione: (2025)

An extension of an RLT-based solver to MINLP polynomial problems
di: González-Díaz, Julio, et al.
Pubblicazione: (2024)

Is Noisy Data a Blessing in Disguise? A Distributionally Robust Optimization Perspective
di: Hsieh, Chung-Han, et al.
Pubblicazione: (2025)