The k-cardinality assignment problem

DOI10.1016/S0166-218X(97)00120-0MaRDI QIDQ1363745zbMATH OpenFDO

Authors Mauro Dell'Amico, Silvano Martello

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) Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• Computing the sequence of \(k\)-cardinality assignments
• scientific article; zbMATH DE number 3989103
• Assignment Problems
• scientific article; zbMATH DE number 841607

Cites work

• scientific article; zbMATH DE number 3989103 (Why is no real title available?)
• scientific article; zbMATH DE number 3534506 (Why is no real title available?)
• scientific article; zbMATH DE number 3558962 (Why is no real title available?)
• A Lagrangean relaxation method for the constrained assignment problem
• A note on two problems in connexion with graphs
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• An Empirical Analysis of the Dense Assignment Problem: Sequential and Parallel Implementations
• An Overview of Scheduling Problems Arising in Satellite Communications
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Network flows. Theory, algorithms, and applications.
• Resource-Constrained Assignment Scheduling
• Some Facets for an Assignment Problem with Side Constraints
• Technical Note—A “Hard” Assignment Problem
• The assignment problem with seniority and job priority constraints

Cited in

(26)

• Cardinality constrained minimum cut problems: complexity and algorithms.
• Solving the many to many assignment problem by improving the Kuhn-Munkres algorithm with backtracking
• On the complexity of finding a largest common subtree of bounded degree
• Solving the rectangular assignment problem and applications
• Solving the \(k\)-cardinality assignment problem by transformation
• A simple solution to the k‐core problem
• Solving a combinatorial problem with network flows
• The hypergraph assignment problem
• Completing a (k − 1)-Assignment
• Competitive subset selection with two agents
• The fuzzy quadratic assignment problem with penalty: new models and genetic algorithm
• A two-objective fuzzy \(k\)-cardinality assignment problem
• scientific article; zbMATH DE number 7366679 (Why is no real title available?)
• The $k$ -Equal Problem
• A comprehensive survey of the reviewer assignment problem
• Polynomial convolutions in max-plus algebra
• Constrained weighted matchings and edge coverings in graphs
• A pessimist's approach to one-sided matching
• Finding all essential terms of a characteristic maxpolynomial.
• Uncertain random assignment problem
• Assignment problems: a golden anniversary survey
• On the kidney exchange problem: cardinality constrained cycle and chain problems on directed graphs: a survey of integer programming approaches
• New bounds for optimum traffic assignment in satellite communication.
• Computing the sequence of \(k\)-cardinality assignments
• Fuzzy weighted equilibrium multi-job assignment problem and genetic algorithm
• An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints

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

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