Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem

DOI10.1007/s10878-020-00584-2zbMath1445.90060arXiv1901.01215OpenAlexW3029974580MaRDI QIDQ2185833

Jairo A. Martínez, Fernando A. Morales

Publication date: 5 June 2020

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1901.01215

zbMATH Keywords

Monte Carlo simulationsknapsack problemdivide-and-conquermethod's efficiency

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) General topics in computing methodologies (68U01)

Related Items (1)

Knapsack problems -- an overview of recent advances. I: Single knapsack problems

Uses Software

• Knapsack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tabu search and finite convergence
• Where are the hard knapsack problems?
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• A survey of effective heuristics and their application to a variety of knapsack problems
• Matheuristics
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
• Stochastic Algorithms: Foundations and Applications
• On the convergence of tabu search

This page was built for publication: Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem