Where are the hard knapsack problems?
From MaRDI portal
Recommendations
- Some Complexity Issues In A Class Of Knapsack Problems: What Makes A Knapsack Problem “Hard”?
- Yet harder knapsack problems
- scientific article; zbMATH DE number 1783857
- A hard knapsack problem
- Algorithms for some hard knapsack problems
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- scientific article; zbMATH DE number 1302173
- Knapsack problems with setups
- Core problems in knapsack algorithms
- scientific article; zbMATH DE number 2107164
Cites work
- A Minimal Algorithm for the 0-1 Knapsack Problem
- A New Algorithm for the 0-1 Knapsack Problem
- A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
- An Algorithm for Large Zero-One Knapsack Problems
- An expanding-core algorithm for the exact 0-1 knapsack problem
- Core problems in knapsack algorithms
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- Dynamic programming on the word RAM
- scientific article; zbMATH DE number 3126094 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1775437 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- Linear Time Algorithms for Knapsack Problems with Bounded Weights
- New trends in exact algorithms for the \(0-1\) knapsack problem
- On the \(0/1\) knapsack polytope
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
Cited in
(89)- Towards a new strategy for solving fuzzy optimization problems
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Dual mean field search for large scale linear and quadratic knapsack problems
- Integer optimization with penalized fractional values: the knapsack case
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
- An empirical analysis of exact algorithms for the unbounded knapsack problem
- The multi-band robust knapsack problem -- a dynamic programming approach
- An incomplete m-exchange algorithm for solving the large-scale multi-scenario knapsack problem
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
- Measuring instance difficulty for combinatorial optimization problems
- Orbital shrinking: theory and applications
- Evolution of new algorithms for the binary knapsack problem
- Revisiting \textit{Where are the hard knapsack problems?} via instance space analysis
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search
- Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances
- Reinforcement learning for the knapsack problem
- Hard combinatorial problems and minor embeddings on lattice graphs
- Evolving test instances of the Hamiltonian completion problem
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
- A new class of hard problem instances for the 0-1 knapsack problem
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems
- Exact algorithms for the 0-1 time-bomb knapsack problem
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness
- Smallest covering regions and highest density regions for discrete distributions
- Balance in resource allocation problems: a changing reference approach
- Analysis of divide-and-conquer strategies for the 0-1 minimization knapsack problem
- Bounds on the objective value of feasible roundings
- Complexity results and exact algorithms for robust knapsack problems
- Generating hard instances for robust combinatorial optimization
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time
- On a resource-constrained scheduling problem with application to distributed systems reconfiguration
- A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems
- The multi-Handler knapsack problem under uncertainty
- Implicit cover inequalities
- Using 3D-printing in disaster response: the two-stage stochastic 3D-printing knapsack problem
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
- Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories
- An efficient algorithm for capacitated assortment planning with stochastic demand and substitution
- Decomposition approaches for recoverable robust optimization problems
- Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
- Exact solution of the robust knapsack problem
- Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract)
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach
- A hard knapsack problem
- scientific article; zbMATH DE number 1302173 (Why is no real title available?)
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem
- Some Complexity Issues In A Class Of Knapsack Problems: What Makes A Knapsack Problem “Hard”?
- A multi-period renewal equipment problem
- scientific article; zbMATH DE number 1783857 (Why is no real title available?)
- scientific article; zbMATH DE number 4001485 (Why is no real title available?)
- Using dual feasible functions to construct fast lower bounds for routing and location problems
- Network meta-analysis: a statistical physics perspective
- Multivariable Branching: A 0-1 Knapsack Problem Case Study
- Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems
- Computing Optimized Path Integrals for Knapsack Feasibility
- Stationary probability density of stochastic search processes in global optimization
- A branch-and-bound algorithm for hard multiple knapsack problems
- Constrained multiagent Markov decision processes: a taxonomy of problems and algorithms
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems
- An exact algorithm for large knapsack sharing problems
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation
- A novel reformulation for the single-sink fixed-charge transportation problem
- An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems
- Branch \& Learn with Post-hoc correction for Predict+Optimize with unknown parameters in constraints
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions
- Resource management in device-to-device communications
- A branch and bound algorithm for robust binary optimization with budget uncertainty
- Yet harder knapsack problems
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis
- Learning to sample initial solution for solving 0-1 discrete optimization problem by local search
- A two state reduction based dynamic programming algorithm for the bi-objective 0-1 knapsack problem
- Expectation analysis for bounding solutions of the 0-1 knapsack problem
- A practical approach for dealing with hard knapsack problems using general-purpose integer programming software
- Knapsack-sharing model for hybrid hosting of enterprise resource planning software on IaaS clouds
- Learning primal heuristics for 0-1 knapsack interdiction problems
- Improving local search algorithm for pseudo Boolean optimization
- Solving hard bi-objective knapsack problems using deep reinforcement learning
- Model-based algorithms for the 0-1 time-bomb knapsack problem
- Applying instance space analysis for metaheuristic selection to the 0-1 multidemand multidimensional knapsack problem
- Discrete optimization: a quantum revolution?
- \textsc{Athanor}: local search over abstract constraint specifications
- A fast combinatorial algorithm for the bilevel knapsack problem with interdiction constraints
- Algorithms and complexity results for the 0-1 knapsack problem with group fairness
- Multiple solutions for combinatorial optimization via k-NN Hamming distance niching
- Hard multidimensional multiple choice knapsack problems, an empirical study
- Mixed-integer linear programming approximations for the stochastic knapsack
This page was built for publication: Where are the hard knapsack problems?
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1772862)
