Solving the \(k\)-cardinality assignment problem by transformation

DOI10.1016/S0377-2217(03)00205-4zbMath1103.90062OpenAlexW2124825827MaRDI QIDQ1877052

A. Volgenant

Publication date: 16 August 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(03)00205-4

zbMATH Keywords

Linear assignment\(k\)-CardinalityGroup assignmentPartial sum criterion

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (3)

Computing the sequence of \(k\)-cardinality assignments ⋮ Solving the rectangular assignment problem and applications ⋮ A two-objective fuzzy \(k\)-cardinality assignment problem

Cites Work

• Unnamed Item
• Unnamed Item
• Traffic assignment in communication satellites
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Constrained weighted matchings and edge coverings in graphs
• The \(k\)-cardinality assignment problem
• Solving group Steiner problems as Steiner problems.
• Generalized Steiner problems and other variants
• Linear assignment procedures
• Algorithms and codes for dense assignment problems: The state of the art
• An improved approximation scheme for the Group Steiner Problem
• The Assignment Problem with Seniority and Job Priority Constraints
• A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
• Technical Note—A “Hard” Assignment Problem
• An Overview of Scheduling Problems Arising in Satellite Communications

This page was built for publication: Solving the \(k\)-cardinality assignment problem by transformation