A truncated exponential algorithm for the lightly constrained assignment problem

DOI10.1023/A:1008679623419MaRDI QIDQ1369367zbMATH OpenOpenAlexFDO

Authors Farin Mohammadi, Jeffery L. Kennington

Publication date 20 October 1997

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008679623419

zbMATH Keywords

branching ruleconstrained assignment probleminteger programmingLagrangean relaxationnear optimal solutionsoftware implementationtruncated branch-and-bound algorithm

Mathematics Subject Classification ID

Integer programming (90C10)

Recommendations

• The singly constrained assignment problem: An AP basis algorithm
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
• A branch-and-bound algorithm for the singly constrained assignment problem
• An improved bounding procedure for the constrained assignment problem

Cited in

(9)

• A Lagrangean relaxation method for the constrained assignment problem
• An improved bounding procedure for the constrained assignment problem
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
• The singly constrained assignment problem: An AP basis algorithm
• A branch-and-bound algorithm for the singly constrained assignment problem
• scientific article; zbMATH DE number 4181140 (Why is no real title available?)
• Resource-Constrained Assignment Scheduling
• A branch and bound algorithm for allocation problems in which constraint coefficients depend upon decision variables
• A facet generation and relaxation technique applied to an assignment problem with side constraints

This page was built for publication: A truncated exponential algorithm for the lightly constrained assignment problem

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