Imagen de Portada

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Moeini, Mahdi, Schermer, Daniel, Wendt, Oliver
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Sum-Of-Squares To Approximate Knapsack
por: Kothari, Pravesh K., et al.
Publicado: (2025)

Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
por: Chen, Shengminjie, et al.
Publicado: (2026)

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

On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
por: Shi, Haoyan, et al.
Publicado: (2024)

On the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank
por: Kurpisz, Adam, et al.
Publicado: (2026)

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
por: Su, Yuexin, et al.
Publicado: (2025)

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
por: Schade, Jamico, et al.
Publicado: (2023)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
por: Blankenburg, Daniel, et al.
Publicado: (2025)

The Robust Bilevel Selection Problem
por: Henke, Dorothee
Publicado: (2024)

The Fair Periodic Assignment Problem
por: van Lieshout, Rolf, et al.
Publicado: (2025)

On the Complexity of Bilevel Independent Set Problem
por: Muluk, Komal
Publicado: (2026)

Approximation Schemes for Sequential Hiring Problems
por: Segev, Danny, et al.
Publicado: (2026)

Learning-Augmented Algorithms for the Bahncard Problem
por: Zhao, Hailiang, et al.
Publicado: (2024)

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

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

Deriving the Gradients of Some Popular Optimal Transport Algorithms
por: Xie, Fangzhou
Publicado: (2025)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
por: Encz, Koppány István, et al.
Publicado: (2025)

Solving Linear Programs with Fast Online Learning Algorithms
por: Gao, Wenzhi, et al.
Publicado: (2021)

A Faster Parametric Search for the Integral Quickest Transshipment Problem
por: Anapolska, Mariia, et al.
Publicado: (2025)

New Approximation Guarantees for The Economic Warehouse Lot Scheduling Problem
por: Segev, Danny
Publicado: (2024)

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

A Variational-Calculus Approach to Online Algorithm Design and Analysis
por: Xu, Pan
Publicado: (2025)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
por: Housni, Omar El, et al.
Publicado: (2024)

Bounds for the Permutation Flowshop Scheduling Problem: New Framework and Theoretical Insights
por: Alejandro-Soto, J. A., et al.
Publicado: (2025)

A Unified Algorithmic Framework for Dynamic Assortment Optimization under MNL Choice
por: Sun, Shuo, et al.
Publicado: (2024)

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
por: Su, Yuexin, et al.
Publicado: (2026)

The Restricted Inverse Optimal Value Problem under Weighted Bottle-neck Hamming distance on trees
por: Zhang, Qiao, et al.
Publicado: (2024)

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
por: Zhai, Jianing, et al.
Publicado: (2019)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
por: Grigorescu, Elena, et al.
Publicado: (2024)

Strongly Polynomial Frame Scaling to High Precision
por: Dadush, Daniel, et al.
Publicado: (2024)

Breaking the Barrier of Self-Concordant Barriers: Faster Interior Point Methods for M-Matrices
por: Vladu, Adrian
Publicado: (2025)

Improved Speed via Regional Fulfillment
por: Hathcock, Daniel, et al.
Publicado: (2026)

A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem
por: Proença, Nathan Benedetto, et al.
Publicado: (2023)

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

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

Safe Sequences via Dominators in DAGs for Path-Covering Problems
por: Sena, Francisco, et al.
Publicado: (2024)

A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm
por: Kuhlmann, Stefan, et al.
Publicado: (2025)

Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
por: Besbes, Omar, et al.
Publicado: (2022)

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
por: Gao, Xuan-Zhao, et al.
Publicado: (2024)