An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition

DOI10.1016/j.cor.2009.02.028zbMath1173.90489OpenAlexW1980905218MaRDI QIDQ1038300

Matthew R. Gibson, Jeffrey W. Ohlmann, Michael J. Fry

Publication date: 17 November 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2009.02.028

zbMATH Keywords

beam searchknapsack problemdiscrete stochastic optimizationagent-based simulationsequential allocationstochastic ruler

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27)

Related Items (1)

Mature or emerging markets: competitive duopoly investment decisions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal control of diffusion processes with reflection
• Optimal access control for broadband services: Stochastic knapsack with advance information
• The multidimensional 0-1 knapsack problem: an overview.
• A class of generalized greedy algorithms for the multi-knapsack problem
• Job shop scheduling with beam search
• The Dynamic and Stochastic Knapsack Problem with Random Sized Items
• The stochastic knapsack problem
• Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
• Stochastic Discrete Optimization
• An algorithm for maximizing target achievement in the stochastic knapsack problem with normal returns
• Prisoners' Dilemama and Professional Sports Drafts
• Discrete stochastic optimization using variants of the stochastic ruler method
• Stochastic assembly line balancing using beam search
• Budgeting with bounded multiple-choice constraints.
• A modification of the stochastic ruler method for discrete stochastic optimization

This page was built for publication: An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition