The k-cardinality assignment problem

DOI10.1016/S0166-218X(97)00120-0zbMATH Open0882.90109MaRDI QIDQ1363745FDOQ1363745

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

Recommendations

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

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)

Cites Work

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

Cited In (26)

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

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)