The singly constrained assignment problem: An AP basis algorithm

DOI10.1007/BF01300862zbMATH Open0841.90096OpenAlexW1993032505MaRDI QIDQ1908532FDOQ1908532

Jeffery L. Kennington, Farin Mohammadi

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)

Cites Work

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

Cited In (1)

• The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm

Uses Software

• CPLEX

Recommendations

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

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)