Pages that link to "Item:Q3115910"

The following pages link to Discrete Dynamic Programming and Capital Allocation (Q3115910):

Displaying 41 items.

• Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem (Q360382) (← links)
• A heuristic algorithm for the multidimensional zero-one knapsack problem (Q789318) (← links)
• An exact algorithm for the knapsack sharing problem with common items (Q817562) (← links)
• A multiobjective evolutionary approach for linearly constrained project selection under uncertainty (Q864003) (← links)
• Solving efficiently the 0-1 multi-objective knapsack problem (Q947962) (← links)
• Implementing an efficient fptas for the 0-1 multi-objective knapsack problem (Q1027579) (← links)
• Theory and applications of generalized dynamic programming: An overview (Q1119492) (← links)
• The imbedded state approach to reducing dimensionality in dynamic programs of higher dimensions (Q1223621) (← links)
• A decision model for interdependent information system project selection (Q1266704) (← links)
• The multidimensional 0-1 knapsack problem: an overview. (Q1428041) (← links)
• Integer optimization with penalized fractional values: the knapsack case (Q1631508) (← links)
• Bi-dimensional knapsack problems with one soft constraint (Q1652049) (← links)
• A universally-truthful approximation scheme for multi-unit auctions (Q1735729) (← links)
• Finding representations for an unconstrained bi-objective combinatorial optimization problem (Q1744630) (← links)
• Greedy algorithms for a class of knapsack problems with binary weights (Q1761999) (← links)
• Shift-and-merge technique for the DP solution of the time-constrained backpacker problem (Q1762021) (← links)
• Using analytic network process and goal programming for interdependent information system project selection (Q1974271) (← links)
• A model of anytime algorithm performance for bi-objective optimization (Q2022237) (← links)
• Shortest paths with a cost constraint: a probabilistic analysis (Q2043355) (← links)
• Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem (Q2079394) (← links)
• On the rectangular knapsack problem (Q2168057) (← links)
• Empirical orthogonal constraint generation for multidimensional 0/1 knapsack problems (Q2282492) (← links)
• A serial inventory system with supplier selection and order quantity allocation considering transportation costs (Q2286010) (← links)
• An alternative efficient representation for the project portfolio selection problem (Q2329483) (← links)
• Internet routing between autonomous systems: fast algorithms for path trading (Q2341707) (← links)
• An experimental study of random knapsack problems (Q2369879) (← links)
• Characterization of canonical systems with six types of coins for the change-making problem (Q2697436) (← links)
• The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization (Q2988849) (← links)
• (Q3191602) (← links)
• Multi-objective Problems in Terms of Relational Algebra (Q3498407) (← links)
• Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (Q3507347) (← links)
• Modeling multiple plant sourcing decisions (Q3532786) (← links)
• A Reach and Bound algorithm for acyclic dynamic-programming networks (Q3632964) (← links)
• A hybrid approach to discrete mathematical programming (Q4170534) (← links)
• Smoothing the Gap Between NP and ER (Q5071086) (← links)
• A minimal algorithm for the Bounded Knapsack Problem (Q5101408) (← links)
• Improved smoothed analysis of multiobjective optimization (Q5415491) (← links)
• (Q5743441) (← links)
• Statistical mechanics analysis of generalized multi-dimensional knapsack problems (Q5870449) (← links)
• Random knapsack in expected polynomial time (Q5917572) (← links)
• The smoothed number of Pareto-optimal solutions in bicriteria integer optimization (Q6044982) (← links)