AN INTEGER RESOURCE ALLOCATION PROBLEM WITH COST CONSTRAINT

DOI10.15807/JORSJ.41.470MaRDI QIDQ4538115zbMATH OpenOpenAlexFDO

Authors Ryusuke Hohzaki, Koji Iida

Publication date 11 July 2002

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.41.470

zbMATH Keywords

approximate algorithmassignment problembranch and bound methodcost constraintsdynamic programmingexponential objective functionnonlinear integer programmingsearch problemsensitivity analysissingle shot kill probabilityupper bound

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Programming involving graphs or networks (90C35) Dynamic programming (90C39) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 1357793
• The Nonlinear Resource Allocation Problem
• scientific article; zbMATH DE number 3982914
• A branch and bound algorithm for allocation problems in which constraint coefficients depend upon decision variables
• Exact and Heuristic Algorithms for the Weapon-Target Assignment Problem

Cited in

(1)

• A Stackelberg equilibrium for a missile procurement problem

This page was built for publication: AN INTEGER RESOURCE ALLOCATION PROBLEM WITH COST CONSTRAINT

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