:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Györgyi, Péter, Kis, Tamás, Tamási, Tímea
Format:	Preprint
Published:	2022
Subjects:	Data Structures and Algorithms Optimization and Control 90B35
Online Access:	https://arxiv.org/abs/2208.02748
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Implicit Decision Diagrams
by: Rudich, Isaac, et al.
Published: (2026)

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

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

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

Better and Simpler Reducibility Bounds over the Integers
by: Levin, Asaf
Published: (2025)

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

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

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

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

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

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

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

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

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

Turnpike with Uncertain Measurements: Triangle-Equality ILP with a Deterministic Recovery Guarantee
by: Elder, C. S., et al.
Published: (2026)

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

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

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

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

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

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

Minimizing Completion Times of Stochastic Jobs on Parallel Machines is Hard
by: Moseley, Benjamin, et al.
Published: (2026)

Disjunctive Sum of Squares
by: Ahmadi, Amir Ali, et al.
Published: (2026)

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

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

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

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

A branch-&-price approach to the unrooted maximum agreement forest problem
by: Frohn, Martin, et al.
Published: (2024)

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

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

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

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

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

Fair Assortment Planning
by: Chen, Qinyi, et al.
Published: (2022)

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

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

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