Narrow search
Showing 1 - 10 of 476
Cover Image
Minimum Spanning Trees with neighborhoods : mathematical programming formulations and solution methods
Blanco, Víctor; Fernández, Elena; Puerto, Justo - In: European journal of operational research : EJOR 262 (2017) 3, pp. 863-878
Persistent link: https://www.econbiz.de/10011802251
Cover Image
An optimal algorithm for finding a minimum clique covering of a circular-arc graph
Asano, Takao - 1989
Persistent link: https://www.econbiz.de/10000781122
Cover Image
Optimal parallel algorithms for cicular-arc graphs
Asano, Takao - 1990
Persistent link: https://www.econbiz.de/10000789273
Cover Image
Recognition and optimization algorithms for co-triangulated graphs
Hoàng, Chinh T. - 1990
Persistent link: https://www.econbiz.de/10000795060
Cover Image
Algorithms for minimum weighted colouring of perfectly ordered, comparability, triangulated, and clique separable graphs
Hoàng, Chinh T. - 1990
Persistent link: https://www.econbiz.de/10000798153
Cover Image
Efficient maximal cubic graph cuts : (extended abstract)
Loebl, Martin - 1990
Persistent link: https://www.econbiz.de/10000808995
Cover Image
Almost all Berge graphs are perfect
Prömel, Hans Jürgen; Steger, Angelika - 1991
Persistent link: https://www.econbiz.de/10000821427
Cover Image
A branch and bound algorithm for the job shop scheduling problem
Błażewicz, Jacek - In: Beyond manufacturing resource planning (MRP II) : …, (pp. 219-254). 1998
Persistent link: https://www.econbiz.de/10001303156
Cover Image
A polynomial algorithm for the max cut problem on graphs without long odd cycles
Grötschel, Martin; Nemhauser, George L. - 1982
Persistent link: https://www.econbiz.de/10000420033