Image de couverture de livre

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

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Moeini, Mahdi, Schermer, Daniel, Wendt, Oliver
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Generalized Assignment and Knapsack Problems in the Random-Order Model
par: Klimm, Max, et autres
Publié: (2025)

Sum-Of-Squares To Approximate Knapsack
par: Kothari, Pravesh K., et autres
Publié: (2025)

Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
par: Chen, Shengminjie, et autres
Publié: (2026)

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 the Distribution of Unweighted Minimum Knapsack Instances with Large SOS Rank
par: Kurpisz, Adam, et autres
Publié: (2026)

Quantum Algorithms for Bandits with Knapsacks with Improved Regret and Time Complexities
par: Su, Yuexin, et autres
Publié: (2025)

Lower Bounds on the Complexity of Mixed-Integer Programs for Stable Set and Knapsack
par: Schade, Jamico, et autres
Publié: (2023)

An Efficient Algorithm for Minimizing Ordered Norms in Fractional Load Balancing
par: Blankenburg, Daniel, et autres
Publié: (2025)

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

The Fair Periodic Assignment Problem
par: van Lieshout, Rolf, et autres
Publié: (2025)

On the Complexity of Bilevel Independent Set Problem
par: Muluk, Komal
Publié: (2026)

Approximation Schemes for Sequential Hiring Problems
par: Segev, Danny, et autres
Publié: (2026)

Learning-Augmented Algorithms for the Bahncard Problem
par: Zhao, Hailiang, et autres
Publié: (2024)

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

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

Deriving the Gradients of Some Popular Optimal Transport Algorithms
par: Xie, Fangzhou
Publié: (2025)

Branch-and-Bound Algorithms as Polynomial-time Approximation Schemes
par: Encz, Koppány István, et autres
Publié: (2025)

Solving Linear Programs with Fast Online Learning Algorithms
par: Gao, Wenzhi, et autres
Publié: (2021)

A Faster Parametric Search for the Integral Quickest Transshipment Problem
par: Anapolska, Mariia, et autres
Publié: (2025)

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

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

A Variational-Calculus Approach to Online Algorithm Design and Analysis
par: Xu, Pan
Publié: (2025)

Two-sided Assortment Optimization: Adaptivity Gaps and Approximation Algorithms
par: Housni, Omar El, 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)

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

Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
par: Su, Yuexin, et autres
Publié: (2026)

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

Stay or Switch: Competitive Online Algorithms for Energy Plan Selection in Energy Markets with Retail Choice
par: Zhai, Jianing, et autres
Publié: (2019)

Learning-Augmented Algorithms for Online Concave Packing and Convex Covering Problems
par: Grigorescu, Elena, et autres
Publié: (2024)

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

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

Improved Speed via Regional Fulfillment
par: Hathcock, Daniel, et autres
Publié: (2026)

A Primal-Dual Extension of the Goemans--Williamson Algorithm for the Weighted Fractional Cut-Covering Problem
par: Proença, Nathan Benedetto, et autres
Publié: (2023)

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

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

Safe Sequences via Dominators in DAGs for Path-Covering Problems
par: Sena, Francisco, et autres
Publié: (2024)

A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm
par: Kuhlmann, Stefan, et autres
Publié: (2025)

Dynamic Resource Allocation: Algorithmic Design Principles and Spectrum of Achievable Performances
par: Besbes, Omar, et autres
Publié: (2022)

Automated Discovery of Branching Rules with Optimal Complexity for the Maximum Independent Set Problem
par: Gao, Xuan-Zhao, et autres
Publié: (2024)