Pages that link to "Item:Q1138485"
From MaRDI portal
The following pages link to Dynamic programming algorithms for the zero-one knapsack problem (Q1138485):
Displaying 31 items.
- A dynamic programming algorithm for the knapsack problem with setup (Q342065) (← links)
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem (Q811344) (← links)
- Single-vendor multi-buyer inventory coordination under private information (Q933523) (← links)
- Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
- A new enumeration scheme for the knapsack problem (Q1095029) (← links)
- The knapsack problem with generalized upper bounds (Q1122484) (← links)
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems (Q1278579) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock (Q1370660) (← links)
- Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
- Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems (Q1580967) (← links)
- Exact algorithms for the minimum cost vertex blocker clique problem (Q1634092) (← links)
- A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs (Q1652714) (← links)
- A multiperiod vehicle lease planning for urban freight consolidation network (Q1666945) (← links)
- An incentive dynamic programming method for the optimization of scholarship assignment (Q1727142) (← links)
- Solving knapsack problems on GPU (Q1761942) (← links)
- Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021) (← links)
- Novel binary differential evolution algorithm for knapsack problems (Q2053861) (← links)
- Solving robust bin-packing problems with a branch-and-price approach (Q2060393) (← links)
- A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106) (← links)
- Two-stage network constrained robust unit commitment problem (Q2514777) (← links)
- Hybrid approaches for the two-scenario max-min knapsack problem (Q2914199) (← links)
- A Dynamic Programming Algorithm for Solving Bi-Objective Fuzzy Knapsack Problem (Q3449428) (← links)
- On Bilevel Optimization with Inexact Follower (Q5120277) (← links)
- An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem (Q5189094) (← links)
- STATIC STOCHASTIC KNAPSACK PROBLEMS (Q5358058) (← links)
- An improved binary quantum-behaved particle swarm optimization algorithm for knapsack problems (Q6052645) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
- Formulations and a Lagrangian relaxation approach for the prize collecting traveling salesman problem (Q6091422) (← links)
- LP relaxation and dynamic programming enhancing VNS for the multiple knapsack problem with setup (Q6146649) (← links)
