An improved bounding procedure for the constrained assignment problem

DOI10.1016/0305-0548(91)90058-YzbMath0741.90049OpenAlexW1980257291MaRDI QIDQ1184442

Moshe B. Rosenwein

Publication date: 28 June 1992

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(91)90058-y

zbMATH Keywords

Lagrangean relaxationsubgradient methodbranch-and-boundconstrained assignmentimproved lower bound procedure

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Lagrangean relaxation method for the constrained assignment problem
• Layering strategies for creating exploitable structure in linear and integer programs
• An algorithm for the solution of the 0-1 knapsack problem
• Resource-Constrained Assignment Scheduling
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm

This page was built for publication: An improved bounding procedure for the constrained assignment problem