Alternating control tree search for knapsack/covering problems
From MaRDI portal
Recommendations
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- CORAL: an exact algorithm for the multidimensional knapsack problem
- The multidimensional knapsack problem: structure and algorithms
- Adaptive memory search for multidemand multidimensional knapsack problems
- On separating cover inequalities for the multidimensional knapsack problem
Cites work
- scientific article; zbMATH DE number 5282967 (Why is no real title available?)
- scientific article; zbMATH DE number 1062113 (Why is no real title available?)
- scientific article; zbMATH DE number 1947445 (Why is no real title available?)
- scientific article; zbMATH DE number 1846893 (Why is no real title available?)
- A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem
- A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem
- A genetic algorithm for the multidimensional knapsack problem
- A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
- Adaptive memory search for multidemand multidimensional knapsack problems
- Balancing and optimizing a portfolio of R&D projects
- Conflict analysis in mixed integer programming
- Exploring relaxation induced neighborhoods to improve MIP solutions
- Improved results on the 0--1 multidimensional knapsack problem
- Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
- Local branching
- New convergent heuristics for 0-1 mixed integer programming
- On the Solution of Discrete Programming Problems
- Preprocessing and Probing Techniques for Mixed Integer Programming Problems
- Principles and Practice of Constraint Programming – CP 2004
- Scatter search. Methodology and implementation in C. With CD-ROM.
- Semi-obnoxious location models: A global optimization approach
- Static competitive facility location: an overview of optimisation approaches.
- The Theory and Computation of Knapsack Functions
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Zero-one programming with many variables and few constraints
Cited in
(5)- Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
- Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems
- Robust efficiency measures for linear knapsack problem variants
- When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
This page was built for publication: Alternating control tree search for knapsack/covering problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q972644)
