Image de couverture de livre

An online joint replenishment problem combined with single machine scheduling

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Györgyi, Péter, Kis, Tamás, Tamási, Tímea
Format:	Preprint
Publié:	2022
Sujets:	Data Structures and Algorithms Optimization and Control 90B35
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability
par: Vakhania, Nodari, et autres
Publié: (2024)

Approximation algorithms for coupled task scheduling minimizing the sum of completion times
par: Fischer, David, et autres
Publié: (2022)

Coach Reservation for Groups Requests
par: Cardonha, Carlos H., et autres
Publié: (2024)

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)

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

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 the complexity of the upgrading version of the maximal covering location problem
par: Baldomero-Naranjo, Marta, et autres
Publié: (2024)

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

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

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

TSP integrality gap via 2-edge-connected multisubgraph problem under coincident IP optima
par: Yamanaka, Toshiaki
Publié: (2025)

Efficient approximation schemes for scheduling on a stochastic number of machines
par: Epstein, Leah, et autres
Publié: (2024)

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

Asymptotics of solutions to the linear search problem
par: Heinonen, Robin A.
Publié: (2026)

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

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

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
par: Ardizzoni, Stefano, et autres
Publié: (2021)

Prefix-bounded matrices
par: Borsik, Nóra A., et autres
Publié: (2025)

Finding Short Paths on Simple Polytopes
par: Black, Alexander E., et autres
Publié: (2026)

A quantum central path algorithm for linear optimization
par: Augustino, Brandon, et autres
Publié: (2023)

On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers"
par: Diaby, Moustapha, et autres
Publié: (2023)

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

Vertex-ordering and arc-partitioning problems
par: Borsik, Nóra A., et autres
Publié: (2025)

A note on the complexity of the picker routing problem in multi-block warehouses and related problems
par: Prunet, Thibault, et autres
Publié: (2023)

Interior point methods are not worse than Simplex
par: Allamigeon, Xavier, et autres
Publié: (2022)

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
par: Jin, Billy, et autres
Publié: (2022)

A nearly optimal randomized algorithm for explorable heap selection
par: Borst, Sander, et autres
Publié: (2022)

Online Decision Making with Fairness over Time
par: Chen, Rui, et autres
Publié: (2022)

Solving the Probabilistic Profitable Tour Problem on a Tree
par: Angelelli, Enrico, et autres
Publié: (2022)

Fair Assortment Planning
par: Chen, Qinyi, et autres
Publié: (2022)

Accelerated first-order methods for a class of semidefinite programs
par: Wang, Alex L., et autres
Publié: (2022)

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

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)

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