scientific article; zbMATH DE number 221925

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199304)40:3<325::AID-NAV3220400304>3.0.CO;2-W" /><325::AID-NAV3220400304>3.0.CO;2-W 10.1002/1520-6750(199304)40:3<325::AID-NAV3220400304>3.0.CO;2-WzbMath0778.90030MaRDI QIDQ4697328

Ishwar Murthy

Publication date: 29 June 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic network flowsstart-up costsdual ascent approximate proceduremultiperiod assignment

Mathematics Subject Classification ID

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

Related Items (3)

Matheuristics: survey and synthesis ⋮ Optimized assignment patterns in mobile edge cloud networks ⋮ Single facility location and relocation problem with time dependent weights and discrete planning horizon

Cites Work

• Threshold assignment algorithm

This page was built for publication: