:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Streeck, Robert, Gellert, Torsten, Schmitt, Andreas, Dipkaya, Asya, Fux, Vladimir, Januschowski, Tim, Berthold, Timo
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control
Online Access:	https://arxiv.org/abs/2404.02996
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Cut-based Conflict Analysis in Mixed Integer Programming
by: Mexi, Gioni, et al.
Published: (2024)

CHAP: A Hybrid GPU-CPU Heuristic for MIP
by: Tjusila, Gennesaret Kharistio, et al.
Published: (2026)

Deepest Cuts for Benders Decomposition
by: Hosseini, Mojtaba, et al.
Published: (2021)

Branch-Price-and-Cut Accelerated with a Pricing for Integrality Heuristic for the Electrical Vehicle Routing Problem with Time Windows and Charging Time Slots
by: Eveborn, Lukas, et al.
Published: (2026)

Pricing in Queues with Abandonments: Optimal Policies and Practical Heuristics
by: Di, Jieqi, et al.
Published: (2025)

Relax-and-Cut for Temporal SCUC Decomposition
by: Xiong, Jinxin, et al.
Published: (2025)

Learning to Choose Branching Rules for Nonconvex MINLPs
by: Berthold, Timo, et al.
Published: (2026)

Global Optimization for Combinatorial Geometry Problems Revisited in the Era of LLMs
by: Berthold, Timo, et al.
Published: (2026)

Out-of-the-Box Global Optimization for Packing Problems: New Models and Improved Solutions
by: Berthold, Timo, et al.
Published: (2026)

On the ReLU Lagrangian Cuts for Stochastic Mixed Integer Programming
by: Deng, Haoyun, et al.
Published: (2024)

A Linear and Scalable Cutting-Plane Algorithm for Electricity Pricing
by: Romero, Matías, et al.
Published: (2025)

Learning to Cut: Reinforcement Learning for Benders Decomposition
by: Cai, Haochen, et al.
Published: (2026)

Bilevel Optimization and Heuristic Algorithms for Integrating Latent Demand into the Design of Large-Scale Transit Systems
by: Guan, Hongzhao, et al.
Published: (2022)

Regional Constellation Reconfiguration Problem: Integer Linear Programming Formulation and Lagrangian Heuristic Method
by: Lee, Hang Woon, et al.
Published: (2022)

Stochastic Augmented Lagrangian Method in Riemannian Shape Manifolds
by: Geiersbach, Caroline, et al.
Published: (2023)

Parallel Sequential Quadratic Programming with Overlapping Graph Decomposition and Exact Augmented Lagrangian
by: Ni, Runxin, et al.
Published: (2024)

A Benchmark for Maximum Cut: Towards Standardization of the Evaluation of Learned Heuristics for Combinatorial Optimization
by: Nath, Ankur, et al.
Published: (2024)

Multimodal Transportation Pricing Alliance Design: Large-Scale Optimization for Rapid Gains
by: Cummings, Kayla, et al.
Published: (2023)

Adaptive Subproblem Selection in Benders Decomposition for Survivable Network Design Problems
by: Donkiewicz, Tim
Published: (2026)

A Stochastic Benders Decomposition Scheme for Large-Scale Stochastic Network Design
by: Bertsimas, Dimitris, et al.
Published: (2023)

A Branch-Price-Cut-And-Switch Approach for Optimizing Team Formation and Routing for Airport Baggage Handling Tasks with Stochastic Travel Times
by: Hagn, Andreas, et al.
Published: (2024)

Inertial Accelerated Stochastic Mirror Descent for Large-Scale Generalized Tensor CP Decomposition
by: Liu, Zehui, et al.
Published: (2024)

A Cutting-plane and Benders' Decomposition Algorithm for Two-Stage Distributionally Robust Convex programs
by: Luo, Fengqiao, et al.
Published: (2021)

Robust Competitive Ratio for Deterministic Monopoly Pricing
by: van Eck, Tim S. G., et al.
Published: (2025)

A Heuristic Framework of Variable Neighborhood Descent Methods for the Large-Scale Multi-Level Facility Location Problem in Supply Chain Networks
by: Wang, Haibo, et al.
Published: (2025)

A Composite Decomposition Method for Large-Scale Global Optimization
by: Tian, Maojiang, et al.
Published: (2024)

Debunking the Speed-Fidelity Trade-Off: Speeding-up Large-Scale Energy Models while Keeping Fidelity
by: Tejada-Arango, Diego A., et al.
Published: (2024)

An Efficient Benders Decomposition Approach for Optimal Large-Scale Network Slicing
by: Chen, Wei-Kun, et al.
Published: (2023)

LOTUS: A Warm-Start Framework for Powering Dual Decomposition in Large-Scale Two-Stage Stochastic Programs
by: Cornielje, Emma, et al.
Published: (2026)

Online Electricity Pricing from Frequency Measurements
by: Liu, Xinwei, et al.
Published: (2026)

Spatiotemporal Pricing and Fleet Management of Autonomous Mobility-on-Demand Networks: A Decomposition and Dynamic Programming Approach with Bounded Optimality Gap
by: Lai, Zhijie, et al.
Published: (2022)

AILS-II: An Adaptive Iterated Local Search Heuristic for the Large-scale Capacitated Vehicle Routing Problem
by: Máximo, Vinícius R., et al.
Published: (2022)

Double Variance Reduction: A Smoothing Trick for Composite Optimization Problems without First-Order Gradient
by: Di, Hao, et al.
Published: (2024)

A Decomposition Framework for Nonlinear Nonconvex Two-Stage Optimization
by: Lou, Yuchen, et al.
Published: (2025)

New Heuristics for the Operation of an Ambulance Fleet under Uncertainty
by: Guigues, Vincent, et al.
Published: (2024)

A Fast Heuristic for Stochastic Steiner Tree Problems
by: Markhorst, Berend, et al.
Published: (2026)

Learning Cuts via Enumeration Oracles
by: Thuerck, Daniel, et al.
Published: (2023)

Advanced Cutting-Plane Algorithms for ACOPF
by: Bienstock, Daniel, et al.
Published: (2025)

Theoretical Challenges in Learning for Branch-and-Cut
by: Cheng, Hongyu, et al.
Published: (2026)

Sparse Cuts for the Positive Semidefinite Cone
by: Günlük, Oktay, et al.
Published: (2026)