Cover Image

Warehouse Problem with Multiple Vendors and Generalized Complementarity Constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bansal, Ishan, Günlük, Oktay
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Parallel Token Swapping for Qubit Routing
by: Bansal, Ishan, et al.
Published: (2024)

A Global Analysis of the Primal-Dual Method for Pliable Families
by: Bansal, Ishan
Published: (2023)

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

Deterministic Volume Estimation of Truncated Hypercubes
by: Gunluk, Kyra
Published: (2026)

Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions
by: Bansal, Ishan, et al.
Published: (2022)

Network Design on Undirected Series-Parallel Graphs
by: Bansal, Ishan, et al.
Published: (2024)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
by: Simmons, Miles, et al.
Published: (2025)

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

Optimal 4-Approximation for the Correlated Pandora's Problem
by: Bansal, Nikhil, et al.
Published: (2025)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
by: Simmons, Miles, et al.
Published: (2026)

Constraint Satisfaction Problems with Advice
by: Ghoshal, Suprovat, et al.
Published: (2024)

Max-Cut with Multiple Cardinality Constraints
by: Makarychev, Yury, et al.
Published: (2025)

Reconfiguring Multiple Connected Components with Size Multiset Constraints
by: Nakahata, Yu
Published: (2025)

Lower Bounds for Matroid Optimization Problems with a Linear Constraint
by: Doron-Arad, Ilan, et al.
Published: (2023)

An Algorithm for the Longest Common Subsequence and Substring Problem for Multiple Strings
by: Li, Rao
Published: (2024)

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
by: Chen, Lin, et al.
Published: (2026)

Fine-Grained Computation in 3-Space: Matrix Multiplication and Graph Problems
by: Stout, Quentin F.
Published: (2024)

Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
by: Zhao, Jingyang, et al.
Published: (2026)

Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier
by: Segev, Danny
Published: (2026)

Multiplicative Weights Update, Area Convexity and Random Coordinate Descent for Densest Subgraph Problems
by: Nguyen, Ta Duy, et al.
Published: (2024)

Subquadratic Submodular Maximization with a General Matroid Constraint
by: Kobayashi, Yusuke, et al.
Published: (2024)

Expander Decomposition with Almost Optimal Overhead
by: Bansal, Nikhil, et al.
Published: (2026)

On Approximating Cutwidth and Pathwidth
by: Bansal, Nikhil, et al.
Published: (2023)

Improved SDP-Based Algorithm for Coloring 3-Colorable Graphs
by: Bansal, Nikhil, et al.
Published: (2026)

Generalized Capacity Planning for the Hospital-Residents Problem
by: Balasundaram, Haricharan, et al.
Published: (2025)

Generating Satisfiable Benchmark Instances for Stable Roommates Problems with Optimization
by: Yılmaz, Baturay, et al.
Published: (2025)

A Multivariate Complexity Analysis of the Generalized Noah's Ark Problem
by: Komusiewicz, Christian, et al.
Published: (2023)

Practical algorithms for Hierarchical overlap graphs
by: Talera, Saumya, et al.
Published: (2024)

Fault-Tolerant Bounded Flow Preservers
by: Bansal, Shivam, et al.
Published: (2024)

New Results on a General Class of Minimum Norm Optimization Problems
by: Chen, Kuowen, et al.
Published: (2025)

Economic Warehouse Lot Scheduling: Approximation Schemes via Efficiently-Representable DP-Encoded Policies
by: Segev, Danny
Published: (2026)

An $\mathcal{O}(\log N)$ Time Algorithm for the Generalized Egg Dropping Problem
by: Papadopoulos, Kleitos
Published: (2026)

Quantum Algorithm for the Multiple String Matching Problem
by: Khadiev, Kamil, et al.
Published: (2024)

A 58-Addition, Rank-23 Scheme for General 3x3 Matrix Multiplication
by: Perminov, A. I.
Published: (2025)

An Improved Fully Dynamic Algorithm for Counting 4-Cycles in General Graphs using Fast Matrix Multiplication
by: Assadi, Sepehr, et al.
Published: (2025)

Matrix Multiplication Reductions
by: Gola, Ashish, et al.
Published: (2024)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
by: Bansal, Ishan, et al.
Published: (2024)

Sensitivity Sampling for $k$-Means: Worst Case and Stability Optimal Coreset Bounds
by: Bansal, Nikhil, et al.
Published: (2024)

Subsequence Matching and LCS with Segment Number Constraints
by: Yonemoto, Yuki, et al.
Published: (2024)

Graph Exploration: The Impact of a Distance Constraint
by: Devismes, Stéphane, et al.
Published: (2024)