Image de couverture de livre

Coordinating Spot and Contract Supply in Freight Marketplaces

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kaminsky, Philip, Kumar, Rachitesh, Lederman, Roger
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
par: Besbes, Omar, et autres
Publié: (2022)

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
par: Dvořák, Michal, et autres
Publié: (2026)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
par: Su, Yuexin, et autres
Publié: (2026)

On the Complexity of Bilevel Independent Set Problem
par: Muluk, Komal
Publié: (2026)

Handicap reduction for linear complementarity problems
par: -Nagy, Marianna E., et autres
Publié: (2026)

Optimizing for Fairness in Generalized Kidney Exchange: Theory and Computations
par: Chang, Claire, et autres
Publié: (2026)

Improved Speed via Regional Fulfillment
par: Hathcock, Daniel, et autres
Publié: (2026)

Stepsize Hedging: an Alternative Mechanism for Accelerating Gradient Descent
par: Altschuler, Jason M., et autres
Publié: (2026)

Economic Warehouse Lot Scheduling: Breaking the 2-Approximation Barrier
par: Segev, Danny
Publié: (2026)

Circuit Diameter of Polyhedra is Strongly Polynomial
par: Natura, Bento
Publié: (2026)

Approximation Schemes for Sequential Hiring Problems
par: Segev, Danny, et autres
Publié: (2026)

Resource-Constrained Joint Replenishment via Power-of-$m^{1/k}$ Policies
par: Segev, Danny
Publié: (2026)

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

A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
par: Shen, Owen, et autres
Publié: (2026)

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
par: Hunkenschröder, Christoph, et autres
Publié: (2025)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
par: Kasperski, Adam, et autres
Publié: (2024)

Generalized Assignment and Knapsack Problems in the Random-Order Model
par: Klimm, Max, et autres
Publié: (2025)

Radial Isotropic Position via an Implicit Newton's Method
par: Jambulapati, Arun, et autres
Publié: (2025)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
par: Chen, Yike, et autres
Publié: (2024)

Balancing Gradient and Hessian Queries in Non-Convex Optimization
par: Adil, Deeksha, et autres
Publié: (2025)

Deriving the Gradients of Some Popular Optimal Transport Algorithms
par: Xie, Fangzhou
Publié: (2025)

Labeling Methods for Partially Ordered Paths
par: Euler, Ricardo, et autres
Publié: (2023)

Sparse Submodular Function Minimization
par: Graur, Andrei, et autres
Publié: (2023)

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
par: Shi, Haoyan, et autres
Publié: (2024)

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

Distributionally Robust Newsvendor on a Metric
par: Foussoul, Ayoub, et autres
Publié: (2024)

ALNS for Tugboat Scheduling in Inland Waterway
par: Ma, Zihang
Publié: (2025)

The Robust Bilevel Selection Problem
par: Henke, Dorothee
Publié: (2024)

A First Order Method for Linear Programming Parameterized by Circuit Imbalance
par: Cole, Richard, et autres
Publié: (2023)

A Faster Parametric Search for the Integral Quickest Transshipment Problem
par: Anapolska, Mariia, et autres
Publié: (2025)

Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
par: Objois, Étienne, et autres
Publié: (2025)

Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
par: Altschuler, Jason M., et autres
Publié: (2023)

A rounding and clustering-based exact algorithm for the p-center problem
par: Ales, Zacharie, et autres
Publié: (2024)

Extracting Dual Solutions via Primal Optimizers
par: Carmon, Yair, et autres
Publié: (2024)

On the complexity of the upgrading version of the maximal covering location problem
par: Baldomero-Naranjo, Marta, et autres
Publié: (2024)

An Efficient Frequency-Based Approach for Maximal Square Detection in Binary Matrices
par: Bhandari, Swastik
Publié: (2025)

Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
par: Segev, Danny, et autres
Publié: (2025)

Dynamic Pricing for Reusable Resources: The Power of Two Prices
par: Balseiro, Santiago R., et autres
Publié: (2023)

Accelerating Proximal Gradient Descent via Silver Stepsizes
par: Bok, Jinho, et autres
Publié: (2024)

Acceleration Meets Inverse Maintenance: Faster $\ell_{\infty}$-Regression
par: Adil, Deeksha, et autres
Publié: (2024)