A branch-and-bound algorithm for the singly constrained assignment problem

DOI10.1016/j.ejor.2005.05.028zbMath1137.90695OpenAlexW2051605629MaRDI QIDQ2432890

A. Volgenant, P. M. D. Lieshout

Publication date: 25 October 2006

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

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.05.028

zbMATH Keywords

branch-and-boundlinear assignmentside constraint

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Exact solution approaches for bilevel assignment problems, Multipurpose machine scheduling with rejection and identical job processing times

Cites Work

• Unnamed Item
• Pyramidal tours and the traveling salesman problem
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• A Lagrangean relaxation method for the constrained assignment problem
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• An improved bounding procedure for the constrained assignment problem
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
• Algorithms and codes for dense assignment problems: The state of the art
• Resource-Constrained Assignment Scheduling
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A Tabu Search Algorithm for the Resource-Constrained Assignment Problem