Image de couverture de livre

Benchmarking Realistic Synthetic Instances Against a Large-Scale District Heating Network: A Multi-Objective Optimization Study for Berlin

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Buchholz, Annika, Riedmüller, Stephanie, Passage, Matthew, Zittel, Janina
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control 90 G.2.3
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Long-Term Multi-Objective Optimization for Integrated Unit Commitment and Investment Planning for District Heating Networks
par: Riedmüller, Stephanie, et autres
Publié: (2024)

Enhancing Multi-Energy Modeling: The Role of Mixed-Integer Optimization Decisions
par: Riedmüller, Stephanie, et autres
Publié: (2025)

Warm-starting Strategies in Scalarization Methods for Multi-Objective Optimization
par: Riedmüller, Stephanie, et autres
Publié: (2025)

An Overview of Convergence Rates for Sum of Squares Hierarchies in Polynomial Optimization
par: Laurent, Monique, et autres
Publié: (2024)

A Moment-QSOS Hierarchy for a Class of Quaternion Polynomial Optimization Problems
par: Liu, Yanqing, et autres
Publié: (2026)

Outer Approximation Scheme for Weakly Convex Constrained Optimization Problems
par: Bednarczuk, Ewa M., et autres
Publié: (2024)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
par: Hou, Di, et autres
Publié: (2025)

Finite convergence and minimizer extraction in moment relaxations with correlative sparsity
par: Fantuzzi, Giovanni, et autres
Publié: (2025)

Degree Bounds for Positivstellensätze of general semialgebraic sets
par: Heijmans-Kuryatnikova, Olga, et autres
Publié: (2026)

Sparse Polynomial Matrix Optimization
par: Miller, Jared, et autres
Publié: (2024)

Sparse Polynomial Optimization with Unbounded Sets
par: Huang, Lei, et autres
Publié: (2024)

Duality attainment and strict feasibility of the generalized moment problem and its relaxations
par: Halaseh, Sami, et autres
Publié: (2026)

A more efficient reformulation of complex SDP as real SDP
par: Wang, Jie
Publié: (2023)

The link between $1$-norm approximation and effective Positivstellensatze for the hypercube
par: de Klerk, Etienne, et autres
Publié: (2024)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
par: Guo, Feng, et autres
Publié: (2023)

Solving Low-Rank Semidefinite Programs via Manifold Optimization
par: Wang, Jie, et autres
Publié: (2023)

Exact Objective Space Contraction for the Preprocessing of Multi-objective Integer Programs
par: Riedmüller, Stephanie, et autres
Publié: (2025)

A Bilevel Hierarchy of Strengthened Complex Moment Relaxations for Complex Polynomial Optimization
par: Wang, Jie
Publié: (2024)

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
par: Hua, Zheng, et autres
Publié: (2021)

Sum-of-squares certificates for symmetric polynomials on the hypercube: a counterexample to a conjecture of De Klerk and Laurent
par: Polak, Sven
Publié: (2026)

A parameter-free approach for solving SOS-convex semi-algebraic fractional programs
par: Yang, Chengmiao, et autres
Publié: (2024)

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
par: Guo, Feng, et autres
Publié: (2024)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
par: Slot, Lucas, et autres
Publié: (2024)

Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
par: Papp, Dávid, et autres
Publié: (2025)

An extension of an RLT-based solver to MINLP polynomial problems
par: González-Díaz, Julio, et autres
Publié: (2024)

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation
par: Wang, Jie
Publié: (2022)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
par: Slot, Lucas
Publié: (2021)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
par: González-Díaz, Julio, et autres
Publié: (2025)

Semidefinite hierarchies for diagonal unitary invariant bipartite quantum states
par: Britz, Jonas, et autres
Publié: (2025)

A Dual Riemannian ADMM Algorithm for Low-Rank SDPs with Unit Diagonal
par: Wang, Jie, et autres
Publié: (2025)

Moment-sos and spectral hierarchies for polynomial optimization on the sphere and quantum de Finetti theorems
par: Blomenhofer, Alexander Taveira, et autres
Publié: (2024)

Exploiting Sparsity in Complex Polynomial Optimization
par: Wang, Jie, et autres
Publié: (2021)

Benchmarking of quantum and classical SDP relaxations for QUBO formulations of real-world logistics problems
par: Ostermann, Birte, et autres
Publié: (2025)

An ODE approach to multiple choice polynomial programming
par: Shao, Sihong, et autres
Publié: (2022)

Strict Copositivity for a Class of 3rd Order Symmetric Tensors
par: Li, Min, et autres
Publié: (2024)

Sparse convex relaxations in polynomial optimization
par: Averkov, Gennadiy, et autres
Publié: (2024)

Yau's Affine-Normal Descent for Large-Scale Unrestricted Higher-Moment Portfolio Optimization
par: Wang, Ya-Juan, et autres
Publié: (2026)

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem
par: Bencheikh, Ali, et autres
Publié: (2024)

Cardinality-Constrained Multi-Objective Optimization: Novel Optimality Conditions and Algorithms
par: Lapucci, Matteo, et autres
Publié: (2023)

Solving clustered low-rank semidefinite programs arising from polynomial optimization
par: Leijenhorst, Nando, et autres
Publié: (2022)