Solving network manpower problems with side constraints

DOI10.1016/0377-2217(84)90209-1MaRDI QIDQ595507zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3175708 (Why is no real title available?)
• scientific article; zbMATH DE number 3748742 (Why is no real title available?)
• scientific article; zbMATH DE number 3591708 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• Modèle adaptant les politiques de personnel aux besoins prévisionnels
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Validation of subgradient optimization

Cited in

(4)

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

This page was built for publication: Solving network manpower problems with side constraints

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