Pages that link to "Item:Q4062195"
From MaRDI portal
The following pages link to When the Greedy Solution Solves a Class of Knapsack Problems (Q4062195):
Displayed 32 items.
- What's in \textit{YOUR} wallet? (Q297491) (← links)
- Fractal patterns related to dividing coins (Q340462) (← links)
- Motion planning with pulley, rope, and baskets (Q385498) (← links)
- On \(n\)-step MIR and partition inequalities for integer knapsack and single-node capacitated flow sets (Q427901) (← links)
- The capacitated budgeted minimum cost flow problem with unit upgrading costs (Q510969) (← links)
- Unbounded knapsack problems with arithmetic weight sequences (Q545110) (← links)
- The zone hopping problem (Q750298) (← links)
- A new lower bound for the linear knapsack problem with general integer variables (Q859686) (← links)
- Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
- An exact algorithm for large unbounded knapsack problems (Q913659) (← links)
- Combinatorics of the change-making problem (Q1041183) (← links)
- Dynamic programming algorithms for the zero-one knapsack problem (Q1138485) (← links)
- Optimal and canonical solutions of the change making problem (Q1141080) (← links)
- An extension of a greedy heuristic for the knapsack problem (Q1178644) (← links)
- A total-value greedy heuristic for the integer knapsack problem (Q1200766) (← links)
- An application of an optimal behaviour of the greedy solution in number theory (Q1321639) (← links)
- On variations of the subset sum problem (Q1382248) (← links)
- Change-making problems revisited: a parameterized point of view (Q1679517) (← links)
- A constructive periodicity bound for the unbounded knapsack problem (Q1758270) (← links)
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation (Q1804882) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- The correction term for the Riemann-Roch formula of cyclic quotient singularities and associated invariants (Q2425053) (← links)
- A heuristic algorithm for a chance constrained stochastic program (Q2432880) (← links)
- Characterization of canonical systems with six types of coins for the change-making problem (Q2697436) (← links)
- A solution method for a knapsack problem and its variant (Q3028724) (← links)
- (Q3301008) (← links)
- On the greedy solution in integer linear programming (Q3768677) (← links)
- Fractional knapsack problems (Q4159177) (← links)
- A hybrid approach to discrete mathematical programming (Q4170534) (← links)
- On the optimality of the greedy solutions of the general knapsack problems (Q4327882) (← links)
- A polynomially solvable special case of the unbounded knapsack problem (Q5949903) (← links)
- When greedy gives optimal: a unified approach (Q6122087) (← links)