An improved bounding procedure for the constrained assignment problem

DOI10.1016/0305-0548(91)90058-YMaRDI QIDQ1184442zbMATH OpenOpenAlexFDO

Authors 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

branch-and-boundconstrained assignmentimproved lower bound procedureLagrangean relaxationsubgradient method

Mathematics Subject Classification ID

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

Recommendations

• A branch-and-bound algorithm for the singly constrained assignment problem
• A truncated exponential algorithm for the lightly constrained assignment problem
• A Lagrangean relaxation method for the constrained assignment problem
• A facet generation and relaxation technique applied to an assignment problem with side constraints
• Resource-Constrained Assignment Scheduling

Cites work

• A Lagrangean relaxation method for the constrained assignment problem
• Accelerated Algorithms for Labeling and Relabeling of Trees, with Applications to Distribution Problems
• An algorithm for the solution of the 0-1 knapsack problem
• Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm
• scientific article; zbMATH DE number 3542191 (Why is no real title available?)
• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Layering strategies for creating exploitable structure in linear and integer programs
• Resource-Constrained Assignment Scheduling

Cited in

(6)

• A Lagrangean relaxation method for the constrained assignment problem
• A bound-improving approach to discrete programming problems
• A truncated exponential algorithm for the lightly constrained assignment problem
• A branch-and-bound algorithm for the singly constrained assignment problem
• A facet generation and relaxation technique applied to an assignment problem with side constraints
• A Lagrangian bound for many-to-many assignment problems

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

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