Reducing multivalued discrete variables in solving separable task assignment problems

DOI10.1007/s40305-015-0087-xzbMath1338.90265OpenAlexW1187394670WikidataQ57432823 ScholiaQ57432823MaRDI QIDQ290332

Yao-Huei Huang, Qing-Wei Jin, Ling Gai, Yuan Tian

Publication date: 1 June 2016

Published in: Journal of the Operations Research Society of China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40305-015-0087-x

zbMATH Keywords

binary variablesmixed integer programming problemtask-assignment problemternary variables

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Assignment problems: a golden anniversary survey
• A survey of algorithms for the generalized assignment problem
• A hybrid genetic/optimization algorithm for a task allocation problem
• A hybrid heuristic to solve a task allocation problem
• A Superior Representation Method for Piecewise Linear Functions
• Global Optimization for Generalized Geometric Programs with Mixed Free-Sign Variables
• Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions
• Exact Solutions to Task Allocation Problems
• Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
• Generalized Assignment with Nonlinear Capacity Interaction
• Algorithms for the Multi-Resource Generalized Assignment Problem
• A branch and bound algorithm for the generalized assignment problem
• An efficient algorithm for a task allocation problem
• A Survey of the Generalized Assignment Problem and Its Applications

This page was built for publication: Reducing multivalued discrete variables in solving separable task assignment problems