Total coloring and total matching : polyhedra and facets
Year of publication: |
2022
|
---|---|
Authors: | Ferrarini, Luca ; Gualandi, Stefano |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 303.2022, 1 (16.11.), p. 129-142
|
Subject: | Combinatorial Optimization | Integer Programming | Total Coloring | Total Matching | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Matching | Ganzzahlige Optimierung | Integer programming | Scheduling-Verfahren | Scheduling problem |
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
-
Adaptive perturbed neighbourhood search for the expanding capacity multiple-choice knapsack problem
Sbihi, A., (2013)
-
Finding exact solutions for the Geometric Firefighter Problem in practice
Zambon, Mauricio J. O., (2018)
- More ...
-
The total matching polytope of complete bipartite graphs
Faenza, Yuri, (2024)
-
Pareto tails in socio-economic phenomena: A kinetic description
Gualandi, Stefano, (2017)
-
Pareto tails in socio-economic phenomena: A kinetic description
Gualandi, Stefano, (2018)
- More ...