The labeled maximum matching problem
Year of publication: |
2009
|
---|---|
Authors: | Carrabs, Francesco ; Cerulli, Raffaele ; Gentili, Monica |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 36.2009, 6, p. 1859-1871
|
Subject: | Unterricht | Teaching | Kontrolle | Control | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming | Branch-and-Bound | Branch and Bound | Schule | School |
-
Neto, Teresa, (2013)
-
A branch-and-bound algorithm for the acyclic partitioning problem
Nossack, Jenny, (2014)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
- More ...
-
Maximizing lifetime in wireless sensor networks with multiple sensor families
Carrabs, Francesco, (2015)
-
An improved heuristic approach for the interval immune transportation problem
Carrabs, Francesco, (2021)
-
Lower and upper bounds for the spanning tree with minimum branch vertices
Carrabs, Francesco, (2013)
- More ...