The \(k\)-cardinality assignment problem

DOI10.1016/S0166-218X(97)00120-0zbMath0882.90109MaRDI QIDQ1363745

Silvano Martello, Mauro Dell'Amico

Publication date: 10 March 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

2-matroid intersection

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (20)

Solving the \(k\)-cardinality assignment problem by transformation ⋮ Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking ⋮ Assignment problems: a golden anniversary survey ⋮ Computing the sequence of \(k\)-cardinality assignments ⋮ New bounds for optimum traffic assignment in satellite communication. ⋮ Solving the rectangular assignment problem and applications ⋮ Finding all essential terms of a characteristic maxpolynomial. ⋮ A two-objective fuzzy \(k\)-cardinality assignment problem ⋮ Competitive subset selection with two agents ⋮ Cardinality constrained minimum cut problems: complexity and algorithms. ⋮ On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches ⋮ Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm ⋮ A COMPREHENSIVE SURVEY OF THE REVIEWER ASSIGNMENT PROBLEM ⋮ The fuzzy quadratic assignment problem with penalty: new models and genetic algorithm ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Uncertain random assignment problem ⋮ Polynomial convolutions in max-plus algebra ⋮ Constrained weighted matchings and edge coverings in graphs ⋮ A pessimist's approach to one-sided matching ⋮ On the complexity of finding a largest common subtree of bounded degree

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• A Lagrangean relaxation method for the constrained assignment problem
• The Assignment Problem with Seniority and Job Priority Constraints
• Resource-Constrained Assignment Scheduling
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Some Facets for an Assignment Problem with Side Constraints
• An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
• Technical Note—A “Hard” Assignment Problem
• An Overview of Scheduling Problems Arising in Satellite Communications

This page was built for publication: The \(k\)-cardinality assignment problem