The singly constrained assignment problem: An AP basis algorithm

DOI10.1007/BF01300862MaRDI QIDQ1908532zbMATH OpenOpenAlexFDO

Authors Farin Mohammadi, Jeffery L. Kennington

Publication date 31 March 1996

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

Full work available at URL https://doi.org/10.1007/bf01300862

zbMATH Keywords

near optimal integer solutionsspecialized primal simplex algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35) Integer programming (90C10) Boolean programming (90C09) Discrete location and assignment (90B80)

Recommendations

• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
• Resource-Constrained Assignment Scheduling
• A truncated exponential algorithm for the lightly constrained assignment problem
• A branch-and-bound algorithm for the singly constrained assignment problem
• Efficient dual simplex algorithms for the assignment problem

Cites work

• scientific article; zbMATH DE number 3791941 (Why is no real title available?)
• scientific article; zbMATH DE number 795215 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• A Lagrangean relaxation method for the constrained assignment problem
• A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
• A competitive (dual) simplex method for the assignment problem
• A new algorithm for the assignment problem
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• A streamlined simplex approach to the singly constrained transportation problem
• Implementing the Simplex Method: The Initial Basis
• Matching problems with generalized upper bound side constraints
• Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
• Resource-Constrained Assignment Scheduling
• Signature Methods for the Assignment Problem
• Solving Constrained Transportation Problems
• Solving the Assignment Problem by Relaxation
• The alternating basis algorithm for assignment problems
• The auction algorithm: A distributed relaxation method for the assignment problem

Cited in

(3)

• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
• A branch-and-bound algorithm for the singly constrained assignment problem
• scientific article; zbMATH DE number 4181140 (Why is no real title available?)

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: The singly constrained assignment problem: An AP basis algorithm

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