Critical edges for the assignment problem : complexity and exact resolution
| Year of publication: |
2013
|
|---|---|
| Authors: | Bazgan, Cristina ; Toubaline, Sonia ; Vanderpooten, Daniel |
| Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 41.2013, 6, p. 685-689
|
| Subject: | Most vital edges | Min edge blocker | Assignment problem | Complexity | Approximation | Exact algorithm | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
A branch-and-cut algorithm for the Edge Interdiction Clique Problem
Furini, Fabio, (2021)
-
Rebalancing the assembly lines with total squared workload and total replacement distance objectives
Girit, Utku, (2021)
-
An iterative dynamic programming approach for the temporal knapsack problem
Clautiaux, François, (2021)
- More ...
-
Complexity of determining the most vital elements for the p-median and p-center location problems
Bazgan, Cristina, (2013)
-
Critical edges/nodes for the minimum spanning tree problem: complexity and approximation
Bazgan, Cristina, (2013)
-
Efficient determination of the k most vital edges for the minimum spanning tree problem
Bazgan, Cristina, (2012)
- More ...