On the public citation graph

Pattern-Based Control for Dynamic Stochastic Multi-Knapsack Problems with Multiple Item Types

0 signed · 31 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/9780470182963openalex-snapshot
Approximate Dynamic Programming
inferredcites →https://doi.org/10.1007/978-3-540-24777-7_9openalex-snapshot
Multidimensional Knapsack Problems
inferredcites →https://doi.org/10.1007/s10479-013-1312-9openalex-snapshot
Resource capacity allocation to stochastic dynamic competitors: knapsack problem for perishable items and index-knapsack heuristic
inferredcites →https://doi.org/10.1007/s10957-006-9047-2openalex-snapshot
Fenchel-Lagrange Duality Versus Geometric Duality in Convex Optimization
inferredcites →https://doi.org/10.1007/s12532-020-00189-0openalex-snapshot
A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
inferredcites →https://doi.org/10.1016/j.cor.2004.03.002openalex-snapshot
Where are the hard knapsack problems?
inferredcites →https://doi.org/10.1016/j.cor.2006.12.029openalex-snapshot
A new ant colony optimization algorithm for the multidimensional Knapsack problem
inferredcites →https://doi.org/10.1016/j.cor.2010.02.002openalex-snapshot
Kernel search: A general heuristic for the multi-dimensional knapsack problem
inferredcites →https://doi.org/10.1016/j.cor.2017.02.009openalex-snapshot
Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
inferredcites →https://doi.org/10.1016/j.cor.2018.04.013openalex-snapshot
A shortest-path-based approach for the stochastic knapsack problem with non-decreasing expected overfilling costs
inferredcites →https://doi.org/10.1016/j.ejor.2011.06.033openalex-snapshot
Network revenue management with inventory-sensitive bid prices and customer choice
inferredcites →https://doi.org/10.1016/j.ejor.2014.06.027openalex-snapshot
An adaptive stochastic knapsack problem
inferredcites →https://doi.org/10.1016/j.ejor.2018.05.027openalex-snapshot
Decomposition methods for dynamic room allocation in hotel revenue management
inferredcites →https://doi.org/10.1016/j.eswa.2013.11.040openalex-snapshot
An improved firefly algorithm for solving dynamic multidimensional knapsack problems
inferredcites →https://doi.org/10.1080/02331934.2016.1167207openalex-snapshot
Stable strong Fenchel and Lagrange duality for evenly convex optimization problems
inferredcites →https://doi.org/10.1137/0325033openalex-snapshot
Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems
inferredcites →https://doi.org/10.1137/s0097539700382820openalex-snapshot
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem
inferredcites →https://doi.org/10.1145/3428336openalex-snapshot
Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging
inferredcites →https://doi.org/10.1287/mnsc.2019.3365openalex-snapshot
A Re-Solving Heuristic with Uniformly Bounded Loss for Network Revenue Management
inferredcites →https://doi.org/10.1287/mnsc.42.12.1706openalex-snapshot
The Dynamic and Stochastic Knapsack Problem with Deadlines
inferredcites →https://doi.org/10.1287/mnsc.44.11.1577openalex-snapshot
An Analysis of Bid-Price Controls for Network Revenue Management
inferredcites →https://doi.org/10.1287/moor.1080.0330openalex-snapshot
Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity
inferredcites →https://doi.org/10.1287/msom.1070.0169openalex-snapshot
On the Choice-Based Linear Programming Model for Network Revenue Management
inferredcites →https://doi.org/10.1287/msom.2023.1188openalex-snapshot
Assign-to-Seat: Dynamic Capacity Control for Selling High-Speed Train Tickets
inferredcites →https://doi.org/10.1287/opre.1060.0368openalex-snapshot
Dynamic Bid Prices in Revenue Management
inferredcites →https://doi.org/10.1287/opre.2021.2173openalex-snapshot
Stochastic Knapsack Revisited: The Service Level Perspective
inferredcites →https://doi.org/10.1287/opre.45.1.24openalex-snapshot
A Multiproduct Dynamic Pricing Problem and Its Applications to Network Yield Management
inferredcites →https://doi.org/10.1287/opre.46.1.17openalex-snapshot
The Dynamic and Stochastic Knapsack Problem
inferredcites →https://doi.org/10.1287/opre.49.1.26.11185openalex-snapshot
The Dynamic and Stochastic Knapsack Problem with Random Sized Items
inferredcites →https://doi.org/10.1287/trsc.37.3.257.16047openalex-snapshot
Revenue Management in a Dynamic Network Environment
inferredcites →https://doi.org/10.3982/te700openalex-snapshot
Revenue maximization in the dynamic knapsack problem
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.