scientific article; zbMATH DE number 221925

DOI10.1002/1520-6750(199304)40:3%3C325::AID-NAV3220400304%3E3.0.CO;2-WMaRDI QIDQ4697328zbMATH OpenFDO

Authors Ishwar Murthy

Publication date 29 June 1993

Full work available at URL https://doi.org/10.1002/1520-6750(199304)40:3%3C325::AID-NAV3220400304%3E3.0.CO;2-W

zbMATH Keywords

dual ascent approximate proceduredynamic network flowsmultiperiod assignmentstart-up costs

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Integer programming (90C10)

Recommendations

• A multi-period machine assignment problem
• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
• scientific article; zbMATH DE number 1084188
• scientific article; zbMATH DE number 515938
• Selected topics on assignment problems

Cites work

• Threshold assignment algorithm

Cited in

(5)

• Single facility location and relocation problem with time dependent weights and discrete planning horizon
• Optimized assignment patterns in mobile edge cloud networks
• Assignment problems with changeover cost
• A Nested Dual Ascent Procedure For The Dynamic Single File Allocation Problem
• Matheuristics: survey and synthesis

This page was built for publication:

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