Image de couverture de livre

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Goerigk, Marc, Henke, Dorothee, Wulf, Lasse
Format:	Preprint
Publié:	2026
Sujets:	Optimization and Control Data Structures and Algorithms 90C17, 90C27, 68Q25
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On the Complexity of the Bilevel Shortest Path Problem
par: Henke, Dorothee, et autres
Publié: (2024)

Loss Minimization for Electrical Flows over Spanning Trees on Grids
par: Ito, Takehiro, et autres
Publié: (2024)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
par: Gupta, Swati, et autres
Publié: (2026)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
par: Liu, Bowen
Publié: (2025)

Harnessing Inferior Solutions For Superior Outcomes: Obtaining Robust Solutions From Quantum Algorithms
par: Halffmann, Pascal, et autres
Publié: (2024)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
par: Simmons, Miles, et autres
Publié: (2026)

Concave Certificates: Geometric Framework for Distributionally Robust Risk and Complexity Analysis
par: Chu, Hong T. M.
Publié: (2026)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
par: Bansal, Ishan, et autres
Publié: (2024)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
par: Nesterov, Yurii
Publié: (2025)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
par: Ammann, Sabrina C. L., et autres
Publié: (2024)

A simple Path-based LP Relaxation for Directed Steiner Tree
par: Pashkovich, Kanstantsin, et autres
Publié: (2026)

Modern column generation for estimating single- and multi-purchase ranked list choice models
par: Costa, Luciano, et autres
Publié: (2026)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
par: Ouyang, Wenqing, et autres
Publié: (2024)

Kurdyka-Łojasiewicz exponent via square transformation
par: Ouyang, Wenqing
Publié: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
par: Zhang, Liwei, et autres
Publié: (2025)

Accelerating preconditioned ADMM via degenerate proximal point mappings
par: Sun, Defeng, et autres
Publié: (2024)

Interpolation Conditions for Linear Operators and Applications to Performance Estimation Problems
par: Bousselmi, Nizar, et autres
Publié: (2023)

Balanced connected partitions of edge-weighted graphs: Hardness and solving methods
par: Davari, Morteza, et autres
Publié: (2025)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
par: Emmerich, Michael T. M.
Publié: (2026)

Advancing Stochastic 3-SAT Solvers by Dissipating Oversatisfied Constraints
par: Schwardt, J., et autres
Publié: (2025)

A Lower Bound for Grothendieck's Constant
par: Heilman, Steven
Publié: (2026)

Accuracy and Performance Evaluation of Quantum, Classical and Hybrid Solvers for the Max-Cut Problem
par: Vodeb, Jaka, et autres
Publié: (2024)

Supermodular Maximization with Cardinality Constraints
par: Chen, Xujin, et autres
Publié: (2025)

On the hardness of deciding the finite convergence of Lasserre hierarchies
par: Vargas, Luis Felipe
Publié: (2024)

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

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
par: Geremew, W., et autres
Publié: (2026)

Analysis of Kernel Mirror Prox for Measure Optimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

The n-vehicle exploration problem is NP-complete
par: Cui, Jinchuan, et autres
Publié: (2023)

Polynomial and Pseudopolynomial Algorithms for Two Classes of Bin Packing Instances
par: da Silva, Renan Fernando Franco, et autres
Publié: (2026)

A constraint-based approach to function interpolation, with application to performance estimation for weakly convex optimisation
par: Rubbens, Anne, et autres
Publié: (2024)

Solving Hard Instances from Knapsack and Bounded Knapsack Problems: A new state-of-the-art solver
par: da Silva, Renan F. F., et autres
Publié: (2026)

Log-Averaged Mirror Prox for Fast, Large-Scale Optimal Transport in Linear Space
par: Burns, Matthew X., et autres
Publié: (2025)

Uncomputability of Global Optima for Nonconvex Functions in the Oracle Model
par: Lakshmanan, K
Publié: (2023)

Improved global performance guarantees of second-order methods in convex minimization
par: Dvurechensky, Pavel, et autres
Publié: (2024)

Performance Estimation of second-order optimization methods on classes of univariate functions
par: Rubbens, Anne, et autres
Publié: (2025)

A Polynomial-time Algorithm to Solve the Airplane Refueling Problem: the Sequential Search Algorithm
par: Cui, Jinchuan, et autres
Publié: (2022)

Integral Biflow Maximization
par: Ding, Guoli, et autres
Publié: (2024)

Finding Short Paths on Simple Polytopes
par: Black, Alexander E., et autres
Publié: (2026)

A Quantum Computing Approach for the Unit Commitment Problem
par: Halffmann, Pascal, et autres
Publié: (2022)

Assignment-Routing Optimization with Cutting-Plane Subtour Elimination: Solver and Benchmark Dataset
par: Yuan, Qilong
Publié: (2025)