Pages that link to "Item:Q2572244"
From MaRDI portal
The following pages link to Approximate and exact algorithms for the fixed-charge knapsack problem (Q2572244):
Displaying 18 items.
- A dynamic programming algorithm for the knapsack problem with setup (Q342065) (← links)
- The zone hopping problem (Q750298) (← links)
- Exact and heuristic solution approaches for the mixed integer setup knapsack problem (Q928018) (← links)
- An exact algorithm for the fixed-charge multiple knapsack problem (Q1011207) (← links)
- A fast algorithm for strongly correlated knapsack problems (Q1281395) (← links)
- Approximation algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
- Fixed-charge continuous knapsack problems and pseudogreedy solutions (Q1586210) (← links)
- Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
- An exact approach for the 0-1 knapsack problem with setups (Q1652189) (← links)
- Exact approaches for the knapsack problem with setups (Q1652523) (← links)
- Approximate \#knapsack computations to count semi-fair allocations (Q2110714) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Exact and approximate algorithms for discounted \(\{0\text{-}1\}\) knapsack problem (Q2282074) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- An optimization algorithm for a penalized knapsack problem (Q2466588) (← links)
- Integer knapsack problems with set-up weights (Q2642635) (← links)
- Experiments with the ``Oregon Trail knapsack problem'' (Q2741262) (← links)
- The knapsack problem with forfeit sets (Q6109304) (← links)
