Towards the real time solution of strike force asset allocation problems

DOI10.1016/S0305-0548(02)00192-2MaRDI QIDQ1765539zbMATH OpenOpenAlexFDO

Authors Vincent C. Li, Guy L. Curry, E. Andrew Boyd

Publication date 23 February 2005

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

Full work available at URL https://doi.org/10.1016/s0305-0548(02)00192-2

zbMATH Keywords

Resource allocationInteger programmingAllocationMultiple choice multidimensional knapsackStriking asset allocation

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Recommendations

• On the equivalence of the static and dynamic asset allocation problems
• Multi-period asset allocation by stochastic dynamic programming
• An algorithmic approach to optimal asset liquidation problems
• A stochastic programming approach to managing liquid asset portfolios
• A continuous-time version of a delegated asset management problem
• scientific article; zbMATH DE number 2065346
• Strategic asset allocation and market timing: a reinforcement learning approach
• Near-optimal asset allocation in financial markets with trading constraints
• Strategic asset allocation in a continuous-time VAR model
• Generalized Bomber and Fighter Problems: Offline Optimal Allocation of a Discrete Asset

Cites work

• scientific article; zbMATH DE number 40470 (Why is no real title available?)
• scientific article; zbMATH DE number 1281676 (Why is no real title available?)
• scientific article; zbMATH DE number 1357793 (Why is no real title available?)
• A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems
• A heuristic algorithm for the multidimensional zero-one knapsack problem
• A simple dual algorithm for the generalised assignment problem
• A variation of the generalized assignment problem arising in the New Zealand dairy industry
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Heuristic algorithms for the multiple knapsack problem

Cited in

(9)

• Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search
• Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem
• Tight oscillations tabu search for multidimensional knapsack problems with generalized upper bound constraints
• An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
• Modeling multiple plant sourcing decisions
• Maximizing strike aircraft planning efficiency for a given class of ground targets
• Optimizing assignment of Tomahawk cruise missile missions to firing units
• A modeling/solution approach for optimal deployment of a weapons arsenal
• Solving the multidimensional knapsack problems with generalized upper bound constraints by the adaptive memory projection method

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Towards the real time solution of strike force asset allocation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765539)