{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:48:28Z","timestamp":1760597308115},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,11,2]],"date-time":"2007-11-02T00:00:00Z","timestamp":1193961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s10878-007-9106-0","type":"journal-article","created":{"date-parts":[[2007,11,2]],"date-time":"2007-11-02T15:18:13Z","timestamp":1194016693000},"page":"168-191","source":"Crossref","is-referenced-by-count":14,"title":["Lower bounds and a tabu search algorithm for\u00a0the\u00a0minimum deficiency problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Mathieu","family":"Bouchard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alain","family":"Hertz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guy","family":"Desaulniers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,11,2]]},"reference":[{"key":"9106_CR1","doi-asserted-by":"crossref","first-page":"1951","DOI":"10.1016\/j.disc.2006.11.001","volume":"307","author":"AS Asratian","year":"2006","unstructured":"Asratian AS, Casselgren CJ (2006) On interval edge colorings of (\u03b1,\u03b2)-biregular bipartite graphs. Discrete Math 307:1951\u20131956","journal-title":"Discrete Math"},{"key":"9106_CR2","first-page":"25","volume":"5","author":"AS Asratian","year":"1987","unstructured":"Asratian AS, Kamalian RR (1987) Interval colorings of the edges of a multigraph. Appl Math 5:25\u201334 (in Russian)","journal-title":"Appl Math"},{"key":"9106_CR3","first-page":"287","volume":"47","author":"K Giaro","year":"1997","unstructured":"Giaro K (1997) The complexity of consecutive \u0394-coloring of bipartite graphs: 4 is easy, 5 is hard. Ars Comb 47:287\u2013298","journal-title":"Ars Comb"},{"key":"9106_CR4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S0166-218X(99)00021-9","volume":"94","author":"K Giaro","year":"1999","unstructured":"Giaro K, Kubale M, Malafiejski M (1999a) On the deficiency of bipartite graphs. Discrete Appl Math 94:193\u2013203","journal-title":"Discrete Appl Math"},{"key":"9106_CR5","first-page":"37","volume":"37","author":"K Giaro","year":"1999","unstructured":"Giaro K, Kubale M, Malafiejski M (1999b) Compact scheduling in open shop with zero-one time operations. Infor 37:37\u201347","journal-title":"Infor"},{"key":"9106_CR6","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/S0012-365X(00)00437-4","volume":"236","author":"K Giaro","year":"2001","unstructured":"Giaro K, Kubale M, Malafiejski M (2001) Consecutive colorings of the edges of general graphs. Discrete Math 236:131\u2013143","journal-title":"Discrete Math"},{"key":"9106_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu Search. Kluwer Academic, Boston"},{"key":"9106_CR8","first-page":"69","volume":"18","author":"D Hanson","year":"1996","unstructured":"Hanson D, Loten COM, Toft B (1996) A lower bound for interval colouring of bi-regular bipartite graphs. Bull Inst Comb Appl 18:69\u201374","journal-title":"Bull Inst Comb Appl"},{"key":"9106_CR9","first-page":"23","volume":"50","author":"D Hanson","year":"1998","unstructured":"Hanson D, Loten COM, Toft B (1998) On interval colorings of bi-regular bipartite graphs. Ars Comb 50:23\u201332","journal-title":"Ars Comb"},{"key":"9106_CR10","unstructured":"Hertz A (1995) Email information"},{"key":"9106_CR11","first-page":"213","volume-title":"Proceedings of the thirty-fifth annual ACM symposium on theory of computing (STOC \u201903)","author":"JH Kim","year":"2003","unstructured":"Kim JH, Vu VH (2003) Generating random regular graphs. In: Proceedings of the thirty-fifth annual ACM symposium on theory of computing (STOC \u201903), San Diego, USA. ACM, New York, pp 213\u2013222"},{"issue":"2","key":"9106_CR12","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1002\/jgt.20021","volume":"47","author":"AV Piatkin","year":"2004","unstructured":"Piatkin AV (2004) Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs. J\u00a0Graph Theory 47(2):122\u2013128","journal-title":"J\u00a0Graph Theory"},{"key":"9106_CR13","doi-asserted-by":"crossref","first-page":"1947","DOI":"10.1016\/j.disc.2006.03.059","volume":"306","author":"A Schwartz","year":"2006","unstructured":"Schwartz A (2006) The deficiency of a regular graph. Discrete Math 306:1947\u20131954","journal-title":"Discrete Math"},{"key":"9106_CR14","first-page":"61","volume":"50","author":"SV Sevastianov","year":"1990","unstructured":"Sevastianov SV (1990) On interval edge colouring of bipartite graphs. Metody Diskret Anal 50:61\u201372 (in Russian)","journal-title":"Metody Diskret Anal"},{"key":"9106_CR15","first-page":"25","volume":"3","author":"VG Vizing","year":"1964","unstructured":"Vizing VG (1964) On an estimate of the chromatic class of a p-graph. Discret Anal 3:25\u201330","journal-title":"Discret Anal"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9106-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9106-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9106-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:12Z","timestamp":1559276292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9106-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,2]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["9106"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9106-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,2]]}}}