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

DOI10.1016/J.EJOR.2005.05.028MaRDI QIDQ2432890zbMATH OpenOpenAlexFDO

Authors P. M. D. Lieshout, A. Volgenant

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)

Recommendations

• An improved bounding procedure for the constrained assignment problem
• The singly constrained assignment problem: An AP basis algorithm
• A truncated exponential algorithm for the lightly constrained assignment problem
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
• scientific article; zbMATH DE number 4066629

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Lagrangean relaxation method for the constrained assignment problem
• A Tabu Search Algorithm for the Resource-Constrained Assignment Problem
• A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Algorithms and codes for dense assignment problems: The state of the art
• An improved bounding procedure for the constrained assignment problem
• Pyramidal tours and the traveling salesman problem
• Resource-Constrained Assignment Scheduling
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm

Cited in

(9)

• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
• Exact solution approaches for bilevel assignment problems
• The singly constrained assignment problem: An AP basis algorithm
• Multipurpose machine scheduling with rejection and identical job processing times
• A branch-and-bound algorithm for the coupled task problem
• An improved bounding procedure for the constrained assignment problem
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
• Resource-Constrained Assignment Scheduling
• A BRANCH-AND-BOUND ALGORITHM FOR FINDING ALL OPTIMAL SOLUTIONS OF THE ASSIGNMENT PROBLEM

This page was built for publication: A branch-and-bound algorithm for the singly constrained assignment problem

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