On the submodularity of the profit function in a problem of transport planning

MaRDI QIDQ5743864zbMATH OpenFDO

Authors V. M. Montlevich

Publication date 8 February 2016

Full work available at URL http://mathnet.ru/eng/vsgu448

zbMATH Keywords

discrete optimizationlatticemethod of consecutive calculationspartially ordered setplant location problemsubmodularitysupermodularitytransportation problem

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Management decision making, including multiple objectives (90B50)

Recommendations

• A submodular optimization problem with side constraints
• A submodular optimization problem with side constraints
• scientific article; zbMATH DE number 3932791
• Submodular set functions and monotone systems in aggregation problems. II
• scientific article; zbMATH DE number 569962

Cited in

(4)

• An attack-defense model with inhomogeneous resources of the opponents
• A discrete multilevel attack-defense model with nonhomogeneous opponent resources
• Maximin problem of communication network synthesis
• Branch-and-cut algorithm for multiband robust discrete optimization problems

This page was built for publication: On the submodularity of the profit function in a problem of transport planning

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