Solving network manpower problems with side constraints

DOI10.1016/0377-2217(84)90209-1zbMath0527.90055OpenAlexW2035762916MaRDI QIDQ595507

Marc Gravel, Wilson L. Price

Publication date: 1984

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(84)90209-1

zbMATH Keywords

side constraintsgoal-programmingnetwork manpower problems

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Operations research and management science (90B99)

Related Items

A parametric programming methodology to solve the Lagrangian dual for network problems with multiple side-constraints ⋮ Feature issue: Multiobjective programming and goal programming ⋮ Goal programming model: A glorious history and a promising future ⋮ A comprehensive simplex-like algorithm for network optimization and perturbation analysis

Cites Work

• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Modèle adaptant les politiques de personnel aux besoins prévisionnels
• Validation of subgradient optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item