Image de couverture de livre

A Fast and Effective Breakpoints Heuristic Algorithm for the Quadratic Knapsack Problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hochbaum, Dorit S., Baumann, Philipp, Goldschmidt, Olivier, Zhang, Yiqing
Format:	Preprint
Publié:	2024
Sujets:	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

A Fast and Effective Method for Euclidean Anticlustering: The Assignment-Based-Anticlustering Algorithm
par: Baumann, Philipp, et autres
Publié: (2026)

The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings
par: Atkinson, Nathan, et autres
Publié: (2023)

On Solving the Knapsack Problem with Conflicts
par: Montemanni, Roberto, et autres
Publié: (2025)

A Fast Heuristic for Stochastic Steiner Tree Problems
par: Markhorst, Berend, et autres
Publié: (2026)

A Re-solving Heuristic for Dynamic Assortment Optimization with Knapsack Constraints
par: Chen, Xi, et autres
Publié: (2024)

Hardware-Compatible Single-Shot Feasible-Space Heuristics for Solving the Quadratic Assignment Problem
par: Im, Haesol, et autres
Publié: (2025)

A Block-Based Heuristic Algorithm for the Three-Dimensional Nuclear Waste Packing Problem
par: Wen, Yajie, et autres
Publié: (2025)

An algorithm for clustering with confidence-based must-link and cannot-link constraints
par: Baumann, Philipp, et autres
Publié: (2022)

A Fast and Convergent Algorithm for Unassigned Distance Geometry Problems
par: Fan, Jun, et autres
Publié: (2025)

Efficient Primal Heuristics for Mixed Binary Quadratic Programs Using Suboptimal Rounding Guidance
par: Huang, Weimin, et autres
Publié: (2025)

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

Knapsack with compactness: a semidefinite approach
par: Villuendas, Hubert, et autres
Publié: (2025)

Policy Learning for Perturbance-wise Linear Quadratic Control Problem
par: Zhang, Haoran, et autres
Publié: (2025)

ML-Guided Primal Heuristics for Mixed Binary Quadratic Programs
par: Huang, Weimin, et autres
Publié: (2026)

Fast and Optimal Incremental Parametric Procedure for the Densest Subgraph Problem: An Experimental Study
par: Hochbaum, Dorit S., et autres
Publié: (2025)

Continuous Equality Knapsack with Probit-Style Objectives
par: Fravel, Jamie, et autres
Publié: (2022)

Numerical Discretization Methods for the Discounted Linear Quadratic Control Problem
par: Zhang, Zhanhao, et autres
Publié: (2024)

The Ergodic Linear-Quadratic Optimal Control Problems with Random Periodic Coefficients
par: Wu, Jiacheng, et autres
Publié: (2026)

The Dating Heuristic: A Provably Strong Matching Algorithm for Dating Platforms
par: Rios, Ignacio, et autres
Publié: (2023)

Linear Convergence of a Unified Primal--Dual Algorithm for Convex--Concave Saddle Point Problems with Quadratic Growth
par: Melcher, Cody, et autres
Publié: (2025)

Policy Optimization in the Linear Quadratic Gaussian Problem: A Frequency Domain Perspective
par: Li, Haoran, et autres
Publié: (2025)

Instance Space Analysis for the Quadratic Assignment Problem
par: Christiansen, Jeffrey, et autres
Publié: (2025)

Wave Function Collapse Set Covering and the Hill Climbing Algorithm: A New, Fast Heuristic and Metaheuristic Pairing for the Minimum Set Cover Problem
par: Oprea, David, et autres
Publié: (2025)

Heuristic approaches for a new variant of the Team Orienteering Problem
par: Guastalla, Alberto, et autres
Publié: (2025)

Mixed-Integer Linear Programming Approximations for the Stochastic Knapsack
par: Rossi, Roberto, et autres
Publié: (2025)

Convergence of Policy Gradient for Stochastic Linear-Quadratic Control Problem in Infinite Horizon
par: Zhang, Xinpei, et autres
Publié: (2024)

A Heuristic Algorithm Based on Beam Search and Iterated Local Search for the Maritime Inventory Routing Problem
par: Sanghikian, Nathalie, et autres
Publié: (2025)

Fast Algorithm for Constrained Linear Inverse Problems
par: Sheriff, Mohammed Rayyan, et autres
Publié: (2022)

Exactness Conditions for Semidefinite Relaxations of the Quadratic Assignment Problem
par: Chen, Junyu, et autres
Publié: (2024)

Exact Quadratic Penalty Function for Symplectic Eigenvalue Problem
par: Wang, Jiaqi, et autres
Publié: (2026)

Solving Linear-Quadratic Stochastic Control Problems with Signatures
par: Aqsha, Alif, et autres
Publié: (2026)

A Quadratic Programming Algorithm with $O(n^3)$ Time Complexity
par: Wu, Liang, et autres
Publié: (2025)

Affine FR: an Effective Facial Reduction Algorithm for Semidefinite Relaxations of Combinatorial Problems
par: Hu, Hao, et autres
Publié: (2024)

Decomposition and Successive Decomposition Methods and Algorithms for Nonconvex Optimization
par: Zhai, Yiqing, et autres
Publié: (2026)

Non-stationary Bandits with Habituation and Recovery Dynamics and Knapsack Constraints
par: He, Qinyang, et autres
Publié: (2024)

Parametric Region Search: A Mixed-Integer Bilevel Optimization Problem Primal Heuristic
par: Tsai, Meng-Lin, et autres
Publié: (2026)

Exact and Heuristic Algorithms for Constrained Biclustering
par: Sudoso, Antonio M.
Publié: (2025)

Heuristic approaches for solving a bilevel optimistic scheduling problem on parallel machines
par: Schau, Quentin, et autres
Publié: (2026)

Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner M{ü}ller-Merbach, a Former President of IFORS)
par: Moeini, Mahdi, et autres
Publié: (2024)

Polyhedral Analysis of Quadratic Optimization Problems with Stieltjes Matrices and Indicators
par: Liu, Peijing, et autres
Publié: (2024)