Image de couverture de livre

Coach Reservation for Groups Requests

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Cardonha, Carlos H., Raghunathan, Arvind U.
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Data Structures and Algorithms 90B06
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

An online joint replenishment problem combined with single machine scheduling
par: Györgyi, Péter, et autres
Publié: (2022)

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

Implicit Decision Diagrams
par: Rudich, Isaac, et autres
Publié: (2026)

Efficient Tree Generation for Globally Optimal Decisions under Probabilistic Outcomes
par: Ozturk, Berk, et autres
Publié: (2025)

Online Rack Placement in Large-Scale Data Centers: Online Sampling Optimization and Deployment
par: Baxi, Saumil, et autres
Publié: (2025)

Robust Permutation Flowshops Under Budgeted Uncertainty
par: Goldberg, Noam, et autres
Publié: (2026)

Better and Simpler Reducibility Bounds over the Integers
par: Levin, Asaf
Publié: (2025)

On Supmodular Matrices
par: Onn, Shmuel
Publié: (2023)

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

A Matheuristic Multi-Start Algorithm for a Novel Static Repositioning Problem in Public Bike-Sharing Systems
par: Daza-Escorcia, Julio-Mario, et autres
Publié: (2024)

Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
par: Alejandro-Soto, J. A., et autres
Publié: (2025)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
par: Goerigk, Marc, et autres
Publié: (2026)

Robust Learning of a Group DRO Neuron
par: Cao, Guyang, et autres
Publié: (2026)

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

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

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)

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

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)

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)

Convex optimization with $p$-norm oracles
par: Adil, Deeksha, et autres
Publié: (2024)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
par: Zhang, Qiao, et autres
Publié: (2024)

Fully Subexponential Time Approximation Scheme for Product Partition
par: Costandin, Marius
Publié: (2024)

Optimization in Sanger Sequencing
par: Carpente, Luisa, et autres
Publié: (2024)

Strongly Polynomial Frame Scaling to High Precision
par: Dadush, Daniel, et autres
Publié: (2024)

Acceleration by Random Stepsizes: Hedging, Equalization, and the Arcsine Stepsize Schedule
par: Altschuler, Jason M., et autres
Publié: (2024)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
par: Sun, Shuo, et autres
Publié: (2024)

On computing approximate Lewis weights
par: Apers, Simon, et autres
Publié: (2024)

Online Matching on $3$-Uniform Hypergraphs
par: Borst, Sander, et autres
Publié: (2024)

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
par: Segev, Danny
Publié: (2024)

Improved Approximation Guarantees for Joint Replenishment in Continuous Time
par: Segev, Danny
Publié: (2024)

Differentiable Extensions with Rounding Guarantees for Combinatorial Optimization over Permutations
par: Nerem, Robert R., et autres
Publié: (2024)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
par: Housni, Omar El, et autres
Publié: (2024)

A Decomposition Theorem for Dynamic Flows
par: Graf, Lukas, et autres
Publié: (2024)

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
par: Moeini, Mahdi, et autres
Publié: (2024)

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