Saved in:
| Main Authors: | Graf, Lukas, Harks, Tobias, Schwarz, Julian |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.04761 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Generalized Nash Equilibrium Problems with Mixed-Integer Variables
by: Harks, Tobias, et al.
Published: (2021)
by: Harks, Tobias, et al.
Published: (2021)
Fast and Flexible Flow Decompositions in General Graphs via Dominators
by: Sena, Francisco, et al.
Published: (2025)
by: Sena, Francisco, et al.
Published: (2025)
Are System Optimal Dynamic Flows Implementable by Tolls?
by: Graf, Lukas, et al.
Published: (2025)
by: Graf, Lukas, et al.
Published: (2025)
Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
by: Chen, Li, et al.
Published: (2025)
by: Chen, Li, et al.
Published: (2025)
A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
by: Sun, Shuo, et al.
Published: (2024)
by: Sun, Shuo, et al.
Published: (2024)
Dynamic Pricing for Reusable Resources: The Power of Two Prices
by: Balseiro, Santiago R., et al.
Published: (2023)
by: Balseiro, Santiago R., et al.
Published: (2023)
Dynamic Batching of Online Arrivals to Leverage Economies of Scale
by: Bhimaraju, Akhil, et al.
Published: (2023)
by: Bhimaraju, Akhil, et al.
Published: (2023)
Near-Optimal Dynamic Policies for Joint Replenishment in Continuous/Discrete Time
by: Segev, Danny
Published: (2025)
by: Segev, Danny
Published: (2025)
Minimum Cost Nowhere-zero Flows and Cut-balanced Orientations
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)
A Faster Parametric Search for the Integral Quickest Transshipment Problem
by: Anapolska, Mariia, et al.
Published: (2025)
by: Anapolska, Mariia, et al.
Published: (2025)
A nearly optimal randomized algorithm for explorable heap selection
by: Borst, Sander, et al.
Published: (2022)
by: Borst, Sander, et al.
Published: (2022)
A Variational-Calculus Approach to Online Algorithm Design and Analysis
by: Xu, Pan
Published: (2025)
by: Xu, Pan
Published: (2025)
A rounding and clustering-based exact algorithm for the p-center problem
by: Ales, Zacharie, et al.
Published: (2024)
by: Ales, Zacharie, et al.
Published: (2024)
A First Order Method for Linear Programming Parameterized by Circuit Imbalance
by: Cole, Richard, et al.
Published: (2023)
by: Cole, Richard, et al.
Published: (2023)
Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
by: Besbes, Omar, et al.
Published: (2022)
by: Besbes, Omar, et al.
Published: (2022)
A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
by: Shen, Owen, et al.
Published: (2026)
by: Shen, Owen, et al.
Published: (2026)
Flow Shop Scheduling with Stochastic Reentry
by: von Aspern, Maximilian, et al.
Published: (2026)
by: von Aspern, Maximilian, et al.
Published: (2026)
Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
by: Kasperski, Adam, et al.
Published: (2024)
by: Kasperski, Adam, et al.
Published: (2024)
An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
by: Chen, Yike, et al.
Published: (2024)
by: Chen, Yike, et al.
Published: (2024)
On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
by: Shi, Haoyan, et al.
Published: (2024)
by: Shi, Haoyan, et al.
Published: (2024)
On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
by: Sergeev, Ivan
Published: (2024)
by: Sergeev, Ivan
Published: (2024)
Distributionally Robust Newsvendor on a Metric
by: Foussoul, Ayoub, et al.
Published: (2024)
by: Foussoul, Ayoub, et al.
Published: (2024)
The Robust Bilevel Selection Problem
by: Henke, Dorothee
Published: (2024)
by: Henke, Dorothee
Published: (2024)
Extracting Dual Solutions via Primal Optimizers
by: Carmon, Yair, et al.
Published: (2024)
by: Carmon, Yair, et al.
Published: (2024)
On the complexity of the upgrading version of the maximal covering location problem
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)
Accelerating Proximal Gradient Descent via Silver Stepsizes
by: Bok, Jinho, et al.
Published: (2024)
by: Bok, Jinho, et al.
Published: (2024)
Acceleration Meets Inverse Maintenance: Faster $\ell_{\infty}$-Regression
by: Adil, Deeksha, et al.
Published: (2024)
by: Adil, Deeksha, et al.
Published: (2024)
Convex optimization with $p$-norm oracles
by: Adil, Deeksha, et al.
Published: (2024)
by: Adil, Deeksha, et al.
Published: (2024)
The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
by: Zhang, Qiao, et al.
Published: (2024)
by: Zhang, Qiao, et al.
Published: (2024)
Fully Subexponential Time Approximation Scheme for Product Partition
by: Costandin, Marius
Published: (2024)
by: Costandin, Marius
Published: (2024)
Optimization in Sanger Sequencing
by: Carpente, Luisa, et al.
Published: (2024)
by: Carpente, Luisa, et al.
Published: (2024)
Strongly Polynomial Frame Scaling to High Precision
by: Dadush, Daniel, et al.
Published: (2024)
by: Dadush, Daniel, et al.
Published: (2024)
Acceleration by Random Stepsizes: Hedging, Equalization, and the Arcsine Stepsize Schedule
by: Altschuler, Jason M., et al.
Published: (2024)
by: Altschuler, Jason M., et al.
Published: (2024)
On computing approximate Lewis weights
by: Apers, Simon, et al.
Published: (2024)
by: Apers, Simon, et al.
Published: (2024)
Online Matching on $3$-Uniform Hypergraphs
by: Borst, Sander, et al.
Published: (2024)
by: Borst, Sander, et al.
Published: (2024)
New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
by: Segev, Danny
Published: (2024)
by: Segev, Danny
Published: (2024)
Improved Approximation Guarantees for Joint Replenishment in Continuous Time
by: Segev, Danny
Published: (2024)
by: Segev, Danny
Published: (2024)
Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
by: Nerem, Robert R., et al.
Published: (2024)
by: Nerem, Robert R., et al.
Published: (2024)
Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
by: Housni, Omar El, et al.
Published: (2024)
by: Housni, Omar El, et al.
Published: (2024)
Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
by: Moeini, Mahdi, et al.
Published: (2024)
by: Moeini, Mahdi, et al.
Published: (2024)
Similar Items
-
Generalized Nash Equilibrium Problems with Mixed-Integer Variables
by: Harks, Tobias, et al.
Published: (2021) -
Fast and Flexible Flow Decompositions in General Graphs via Dominators
by: Sena, Francisco, et al.
Published: (2025) -
Are System Optimal Dynamic Flows Implementable by Tolls?
by: Graf, Lukas, et al.
Published: (2025) -
Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
by: Chen, Li, et al.
Published: (2025) -
A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
by: Sun, Shuo, et al.
Published: (2024)