A branch-price-and-cut algorithm for the minimum evolution problem
Year of publication: |
2015
|
---|---|
Authors: | Catanzaro, Daniele ; Aringhieri, Roberto ; Di Summa, Marco ; Pesenti, Raffaele |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 244.2015, 3 (1.8.), p. 753-765
|
Subject: | Combinatorial inequalities | Branch-price-and-cut | Symmetry breaking | Tree isomorphism | Computational biology | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Mathematische Optimierung | Mathematical programming | Graphentheorie | Graph theory |
-
A branch-price-and-cut algorithm for the minimum evolution problem
Catanzaro, Daniele, (2015)
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Population-based iterated greedy algorithm for the S-labeling problem
Lozano, Manuel, (2023)
- More ...
-
Optimal solutions for the balanced minimum evolution problem
Aringhieri, Roberto, (2011)
-
A branch-price-and-cut algorithm for the minimum evolution problem
Catanzaro, Daniele, (2015)
-
The convex hull of the all-different system with the inclusion property: a simple proof
Di Summa, Marco, (2013)
- More ...