Lower bounds and a tabu search algorithm for the minimum deficiency problem-Reference-Cited by-同舟云学术

Lower bounds and a tabu search algorithm for the minimum deficiency problem

Published:2007-11-02 Issue:2 Volume:17 Page:168-191
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Bouchard Mathieu,Hertz Alain,Desaulniers Guy

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/content/pdf/10.1007/s10878-007-9106-0.pdf

Reference15 articles.

1. Asratian AS, Casselgren CJ (2006) On interval edge colorings of (α,β)-biregular bipartite graphs. Discrete Math 307:1951–1956

2. Asratian AS, Kamalian RR (1987) Interval colorings of the edges of a multigraph. Appl Math 5:25–34 (in Russian)

3. Giaro K (1997) The complexity of consecutive Δ-coloring of bipartite graphs: 4 is easy, 5 is hard. Ars Comb 47:287–298

4. Giaro K, Kubale M, Malafiejski M (1999a) On the deficiency of bipartite graphs. Discrete Appl Math 94:193–203

5. Giaro K, Kubale M, Malafiejski M (1999b) Compact scheduling in open shop with zero-one time operations. Infor 37:37–47

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Feature selection in high dimensional data: A specific preordonnances-based memetic algorithm;Knowledge-Based Systems;2023-04

2. Compact Scheduling of Open Shops;International Series in Operations Research & Management Science;2021-10-31

3. Cyclic deficiency of graphs;Discrete Applied Mathematics;2019-08

4. Integer programming formulations for minimum deficiency interval coloring;Networks;2018-06-19

5. Further results on the deficiency of graphs;Discrete Applied Mathematics;2017-07