A truncated exponential algorithm for the lightly constrained assignment problem

DOI10.1023/A:1008679623419zbMATH Open0898.90095OpenAlexW413617904MaRDI QIDQ1369367FDOQ1369367

Jeffery L. Kennington, Farin Mohammadi

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

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

zbMATH Keywords

integer programmingbranching ruleLagrangean relaxationsoftware implementationnear optimal solutionconstrained assignment problemtruncated branch-and-bound algorithm

Mathematics Subject Classification ID

Integer programming (90C10)

Cited In (8)

• Title not available (Why is that?)
• A Lagrangean relaxation method for the constrained assignment problem
• Resource-Constrained Assignment Scheduling
• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
• A branch-and-bound algorithm for the singly constrained assignment problem
• The singly constrained assignment problem: An AP basis algorithm
• An improved bounding procedure for the constrained assignment problem
• A branch and bound algorithm for allocation problems in which constraint coefficients depend upon decision variables

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)