Cover Image

Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nerem, Robert R., Luo, Zhishang, Rafiey, Akbar, Wang, Yusu
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

3.415-Approximation for Coflow Scheduling via Iterated Rounding
by: Rohwedder, Lars, et al.
Published: (2025)

Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
by: Alejandro-Soto, J. A., et al.
Published: (2025)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
by: Shi, Haoyan, et al.
Published: (2024)

Improved Approximation Guarantees for Joint Replenishment in Continuous Time
by: Segev, Danny
Published: (2024)

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
by: Segev, Danny
Published: (2024)

Generalized Short Path Algorithms: Towards Super-Quadratic Speedup over Markov Chain Search for Combinatorial Optimization
by: Chakrabarti, Shouvanik, et al.
Published: (2024)

Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
by: Segev, Danny, et al.
Published: (2025)

Online Decision Making with Fairness over Time
by: Chen, Rui, et al.
Published: (2022)

Expected Maximin Fairness in Max-Cut and other Combinatorial Optimization Problems
by: Salem, Jad, et al.
Published: (2024)

Graph neural networks extrapolate out-of-distribution for shortest paths
by: Nerem, Robert R., et al.
Published: (2025)

On Matrices over a Polynomial Ring with Restricted Subdeterminants
by: Celaya, Marcel, et al.
Published: (2023)

Optimization in Sanger Sequencing
by: Carpente, Luisa, et al.
Published: (2024)

Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
by: Brubaker, Kyle, et al.
Published: (2025)

Submodular Order Functions and Assortment Optimization
by: Udwani, Rajan
Published: (2021)

Extracting Dual Solutions via Primal Optimizers
by: Carmon, Yair, et al.
Published: (2024)

Isotropic Noise in Stochastic and Quantum Convex Optimization
by: Marsden, Annie, et al.
Published: (2025)

Quasi-Self-Concordant Optimization with Lewis Weights
by: Ene, Alina, et al.
Published: (2025)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
by: Adil, Deeksha, et al.
Published: (2025)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
by: Chang, Claire, et al.
Published: (2026)

Optimized methods for composite optimization: a reduction perspective
by: Bok, Jinho, et al.
Published: (2025)

Best of Both Worlds Guarantees for Smoothed Online Quadratic Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2023)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
by: Housni, Omar El, et al.
Published: (2024)

Accelerated Approximate Optimization of Multi-Commodity Flows on Directed Graphs
by: Chen, Li, et al.
Published: (2025)

When Location Shapes Choice: Placement Optimization of Substitutable Products
by: Housni, Omar El, et al.
Published: (2023)

Combinatorial Sparse PCA Beyond the Spiked Identity Model
by: Kumar, Syamantak, et al.
Published: (2026)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
by: Sun, Shuo, et al.
Published: (2024)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
by: Su, Yuexin, et al.
Published: (2026)

Dynamic Pricing for Reusable Resources: The Power of Two Prices
by: Balseiro, Santiago R., et al.
Published: (2023)

Improved Speed via Regional Fulfillment
by: Hathcock, Daniel, et al.
Published: (2026)

Dynamic Batching of Online Arrivals to Leverage Economies of Scale
by: Bhimaraju, Akhil, et al.
Published: (2023)

Accelerated first-order methods for a class of semidefinite programs
by: Wang, Alex L., et al.
Published: (2022)

Reusing Samples in Variance Reduction
by: Jin, Yujia, et al.
Published: (2025)

A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem
by: Proença, Nathan Benedetto, et al.
Published: (2023)

A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm
by: Kuhlmann, Stefan, et al.
Published: (2025)

Recursive Modified Pattern Search on High-dimensional Simplex : A Blackbox Optimization Technique
by: Das, Priyam
Published: (2016)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
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)

On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
by: Sergeev, Ivan
Published: (2024)

Distributionally Robust Newsvendor on a Metric
by: Foussoul, Ayoub, et al.
Published: (2024)

The Robust Bilevel Selection Problem
by: Henke, Dorothee
Published: (2024)