Pages that link to "Item:Q1772862"
From MaRDI portal
The following pages link to Where are the hard knapsack problems? (Q1772862):
Displaying 22 items.
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (Q3507347) (← links)
- A hard knapsack problem (Q3780004) (← links)
- (Q4727431) (← links)
- Network meta-analysis: a statistical physics perspective (Q5055392) (← links)
- Multivariable Branching: A 0-1 Knapsack Problem Case Study (Q5084602) (← links)
- Decomposition-Based Approaches for a Class of Two-Stage Robust Binary Optimization Problems (Q5085995) (← links)
- Computing Optimized Path Integrals for Knapsack Feasibility (Q5106414) (← links)
- Stationary probability density of stochastic search processes in global optimization (Q5239420) (← links)
- Constrained Multiagent Markov Decision Processes: a Taxonomy of Problems and Algorithms (Q5856487) (← links)
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems (Q5870449) (← links)
- An exact algorithm for large knapsack sharing problems (Q5883603) (← links)
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)
- A novel reformulation for the single-sink fixed-charge transportation problem (Q6052058) (← links)
- An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems (Q6052645) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)
- Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)
- A branch and bound algorithm for robust binary optimization with budget uncertainty (Q6175705) (← links)
- Verifying new instances of the multidemand multidimensional knapsack problem with instance space analysis (Q6551077) (← links)
- Learning to sample initial solution for solving 0-1 discrete optimization problem by local search (Q6564766) (← links)
- Expectation analysis for bounding solutions of the 0-1 knapsack problem (Q6636466) (← links)
- A practical approach for dealing with hard knapsack problems using general-purpose integer programming software (Q6659825) (← links)
- Knapsack-sharing model for hybrid hosting of enterprise resource planning software on IaaS clouds (Q6660109) (← links)
