The singly constrained assignment problem: A Lagrangian relaxation heuristic algorithm
From MaRDI portal
Publication:1318275
DOI10.1007/BF01299389zbMath0802.90081OpenAlexW2071897115MaRDI QIDQ1318275
Farin Mohammadi, Jeffrey L. Kennington
Publication date: 27 March 1994
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01299389
heuristiccomputational comparisonsLagrangian dualitynear optimal integer solutionssingly constrained assignment
Programming involving graphs or networks (90C35) Integer programming (90C10) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Lagrangean relaxation method for the constrained assignment problem
- Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
- The singly constrained assignment problem: An AP basis algorithm
- Matching problems with generalized upper bound side constraints
- Resource-Constrained Assignment Scheduling
- A generalization of Polyak's convergence result for subgradient optimization
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
- An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
- Solving Constrained Transportation Problems
- The alternating basis algorithm for assignment problems
- A streamlined simplex approach to the singly constrained transportation problem
- A Survey of Lagrangean Techniques for Discrete Optimization
- A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem
- An Improved Implicit Enumeration Approach for Integer Programming
- Generalized Lagrange Multipliers in Integer Programming
