Pages that link to "Item:Q1772862"
From MaRDI portal
The following pages link to Where are the hard knapsack problems? (Q1772862):
Displaying 50 items.
- Implicit cover inequalities (Q266036) (← links)
- An efficient algorithm for capacitated assortment planning with stochastic demand and substitution (Q322508) (← links)
- Decomposition approaches for recoverable robust optimization problems (Q322768) (← links)
- Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic (Q333075) (← links)
- Exact solution of the robust knapsack problem (Q336592) (← links)
- Dynamic programming based algorithms for the discounted \(\{0-1\}\) knapsack problem (Q428109) (← links)
- A multi-period renewal equipment problem (Q439598) (← links)
- Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
- A branch-and-bound algorithm for hard multiple knapsack problems (Q545544) (← links)
- Yet harder knapsack problems (Q653327) (← links)
- A two state reduction based dynamic programming algorithm for the bi-objective \(0\)-\(1\) knapsack problem (Q662206) (← links)
- Hard multidimensional multiple choice knapsack problems, an empirical study (Q733540) (← links)
- Towards a new strategy for solving fuzzy optimization problems (Q1037445) (← links)
- New trends in exact algorithms for the \(0-1\) knapsack problem (Q1569935) (← links)
- Dual mean field search for large scale linear and quadratic knapsack problems (Q1620646) (← links)
- Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
- Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem (Q1652300) (← links)
- An empirical analysis of exact algorithms for the unbounded knapsack problem (Q1735169) (← links)
- The multi-band robust knapsack problem -- a dynamic programming approach (Q1751135) (← links)
- An incomplete \(m\)-exchange algorithm for solving the large-scale multi-scenario knapsack problem (Q1761118) (← links)
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (Q1761954) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Orbital shrinking: theory and applications (Q1786877) (← links)
- Evolution of new algorithms for the binary knapsack problem (Q2003461) (← links)
- Revisiting \textit{where are the hard knapsack problems?} Via instance space analysis (Q2027074) (← links)
- Learn to relax: integrating \(0-1\) integer linear programming with pseudo-Boolean conflict-driven search (Q2074664) (← links)
- Minimizing the weighted number of tardy jobs on a single machine: strongly correlated instances (Q2076814) (← links)
- Reinforcement learning for the knapsack problem (Q2089607) (← links)
- Hard combinatorial problems and minor embeddings on lattice graphs (Q2105986) (← links)
- Evolving test instances of the Hamiltonian completion problem (Q2108108) (← links)
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
- A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Exact algorithms for the 0-1 time-bomb knapsack problem (Q2147139) (← links)
- Matheuristics for the flowshop scheduling problem with controllable processing times and limited resource consumption to minimize total tardiness (Q2147170) (← links)
- Smallest covering regions and highest density regions for discrete distributions (Q2155016) (← links)
- Balance in resource allocation problems: a changing reference approach (Q2178919) (← links)
- Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem (Q2185833) (← links)
- Bounds on the objective value of feasible roundings (Q2189630) (← links)
- Complexity results and exact algorithms for robust knapsack problems (Q2247901) (← links)
- Generating hard instances for robust combinatorial optimization (Q2272296) (← links)
- Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem (Q2329707) (← links)
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (Q2364490) (← links)
- On a resource-constrained scheduling problem with application to distributed systems reconfiguration (Q2371345) (← links)
- A hybrid quantum inspired harmony search algorithm for 0-1 optimization problems (Q2453178) (← links)
- The multi-Handler knapsack problem under uncertainty (Q2514753) (← links)
- Using 3D-printing in disaster response: the two-stage stochastic 3D-printing knapsack problem (Q2668788) (← links)
- A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem (Q2883626) (← links)
- Generalized Restless Bandits and the Knapsack Problem for Perishable Inventories (Q2935312) (← links)
- Time-Constrained Restless Bandits and the Knapsack Problem for Perishable Items (Extended Abstract) (Q3439578) (← links)
