Copertina

An online joint replenishment problem combined with single machine scheduling

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Györgyi, Péter, Kis, Tamás, Tamási, Tímea
Natura:	Preprint
Pubblicazione:	2022
Soggetti:	Data Structures and Algorithms Optimization and Control 90B35
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

An overview of some single machine scheduling problems: polynomial algorithms, complexity and approximability
di: Vakhania, Nodari, et al.
Pubblicazione: (2024)

Approximation algorithms for coupled task scheduling minimizing the sum of completion times
di: Fischer, David, et al.
Pubblicazione: (2022)

Coach Reservation for Groups Requests
di: Cardonha, Carlos H., et al.
Pubblicazione: (2024)

Implicit Decision Diagrams
di: Rudich, Isaac, et al.
Pubblicazione: (2026)

Efficient Tree Generation for Globally Optimal Decisions under Probabilistic Outcomes
di: Ozturk, Berk, et al.
Pubblicazione: (2025)

Online Rack Placement in Large-Scale Data Centers: Online Sampling Optimization and Deployment
di: Baxi, Saumil, et al.
Pubblicazione: (2025)

Handicap reduction for linear complementarity problems
di: -Nagy, Marianna E., et al.
Pubblicazione: (2026)

Robust Permutation Flowshops Under Budgeted Uncertainty
di: Goldberg, Noam, et al.
Pubblicazione: (2026)

Better and Simpler Reducibility Bounds over the Integers
di: Levin, Asaf
Pubblicazione: (2025)

On the complexity of the upgrading version of the maximal covering location problem
di: Baldomero-Naranjo, Marta, et al.
Pubblicazione: (2024)

Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
di: Kasperski, Adam, et al.
Pubblicazione: (2024)

A rounding and clustering-based exact algorithm for the p-center problem
di: Ales, Zacharie, et al.
Pubblicazione: (2024)

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

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

Efficient approximation schemes for scheduling on a stochastic number of machines
di: Epstein, Leah, et al.
Pubblicazione: (2024)

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

Asymptotics of solutions to the linear search problem
di: Heinonen, Robin A.
Pubblicazione: (2026)

Loss Minimization for Electrical Flows over Spanning Trees on Grids
di: Ito, Takehiro, et al.
Pubblicazione: (2024)

A Two-Layer Framework for Joint Online Configuration Selection and Admission Control
di: Shen, Owen, et al.
Pubblicazione: (2026)

The Bounded Acceleration Shortest Path problem: complexity and solution algorithms
di: Ardizzoni, Stefano, et al.
Pubblicazione: (2021)

Prefix-bounded matrices
di: Borsik, Nóra A., et al.
Pubblicazione: (2025)

Finding Short Paths on Simple Polytopes
di: Black, Alexander E., et al.
Pubblicazione: (2026)

A quantum central path algorithm for linear optimization
di: Augustino, Brandon, et al.
Pubblicazione: (2023)

On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers"
di: Diaby, Moustapha, et al.
Pubblicazione: (2023)

The Complexity Landscape of Two-Stage Robust Selection Problems with Budgeted Uncertainty
di: Goerigk, Marc, et al.
Pubblicazione: (2026)

Vertex-ordering and arc-partitioning problems
di: Borsik, Nóra A., et al.
Pubblicazione: (2025)

A note on the complexity of the picker routing problem in multi-block warehouses and related problems
di: Prunet, Thibault, et al.
Pubblicazione: (2023)

Interior point methods are not worse than Simplex
di: Allamigeon, Xavier, et al.
Pubblicazione: (2022)

Online Bipartite Matching with Advice: Tight Robustness-Consistency Tradeoffs for the Two-Stage Model
di: Jin, Billy, et al.
Pubblicazione: (2022)

A nearly optimal randomized algorithm for explorable heap selection
di: Borst, Sander, et al.
Pubblicazione: (2022)

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

Solving the Probabilistic Profitable Tour Problem on a Tree
di: Angelelli, Enrico, et al.
Pubblicazione: (2022)

Fair Assortment Planning
di: Chen, Qinyi, et al.
Pubblicazione: (2022)

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

(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
di: Hunkenschröder, Christoph, et al.
Pubblicazione: (2025)

Generalized Assignment and Knapsack Problems in the Random-Order Model
di: Klimm, Max, et al.
Pubblicazione: (2025)

Radial Isotropic Position via an Implicit Newton's Method
di: Jambulapati, Arun, et al.
Pubblicazione: (2025)

An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
di: Chen, Yike, et al.
Pubblicazione: (2024)

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

Parameterized Complexity of Scheduling Problems in Robotic Process Automation
di: Dvořák, Michal, et al.
Pubblicazione: (2026)