Logo - springer
Slogan - springer

Mathematics | Journal of Combinatorial Optimization - incl. option to publish open access (Editorial Board)

We’re working on a new version of this journal site - preview it now
Journal of Combinatorial Optimization

Journal of Combinatorial Optimization

Editor-in-Chief: My T. Thai

ISSN: 1382-6905 (print version)
ISSN: 1573-2886 (electronic version)

Journal no. 10878

80,33 € Personal Rate e-only
Get Subscription

Online subscription, valid from January through December of current calendar year

Immediate access to this year's issues via SpringerLink

2 Volume(-s) with 8 issue(-s) per annual subscription

Automatic annual renewal

More information: >> FAQs // >> Policy


My T. Thai
University of Florida

Founding Editor:

Ding-Zhu Du
University of Texas at Dallas

Advisory Editors:

Egon Balas, Carnegie Mellon University; Ronald L. Graham, University of California at San Diego; T. Ibaraki, Kyoto University; Richard Karp, University of California, Berkeley; Alexander Schrijver, Center for Mathematics and Computer Science, Amsterdam; A.C.C. Yao, Princeton University

Editorial Board:

Sanjeev Arora, Princeton University; Marshall Bern, Xerox Corporation; Endre Boros, Rutgers University; Luciana Buriol, Instituto Informática/UFRGS; Rainer E. Burkard, Technische Universität Graz; Mao-cheng Cai, Chinese Academy of Sciences; Gerard Jennhwa Chang, National Taiwan University; Wanpracha Art Chaovalitwongse, Rutgers University; Bo Chen, University of Warwick; Xujin Chen, Chinese Academy of Sciences; Mauro dell'Amico, University of Modena and Reggio Emilia; Matteo Fischetti, University of Padova; Al Frieze, Carnegie Mellon UniversityBoris Goldengorin, University of Groningen; Fan Chung Graham, University of California at San Diego; Xiaodong Hu, Chinese Academy of Sciences; Frank K. Hwang, AT&T Bell Laboratories; Xiaohua Jia, City University of Hong Kong; Tao Jiang, University of California, Riverside; Ming-Yang Kao, Northwestern University; Marek Karpinski, University of Bonn; Naoki Katoh, Kyoto University; Asaf Levin, The Technion - Israel Institute of Technology; Ming Li, University of Waterloo; Chung-Shou Liao, Tsinghua University, Taiwan; Guohhui Lin, University of Alberta; Nimrod Megiddo, IBM Almaden Research Center; George L. Nemhauser, Georgia Institute of Technology; Takao Nishizeki, Tohoku UniversityPanos M. Pardalos, University of Florida; Ulrich Pferschy, Karl Franzens University Graz; William R. Pulleyblank, IBM Thomas J. Watson Research Center; Liqun Qi, The Hong Kong Polytechnic University; Franz Rendl, Universität Klagenfurt; Mauricio G.C. Resende, AT&T Bell LaboratoriesChristian Scheideler, Paderborn University; Sergey Sevastyanov, Sobolev Institute of Mathematics; Vitaly Strusevich, University of Greenwich; Zhiyi Tan, Zhejiang University; Shang-Hua Teng, Boston University; Kavitha Telikepalli, Tata Institute of Fundamental Research; My T. Thai, University of Florida; Doreen Thomas, Melbourne University; Cong Tian, Xidian University; Peter Varman, Rice University; Vijay Vazirani, Georgia Institute of Technology; Jie Wang, University of Massachusetts Lowell; Henry Wolkowicz, University of Waterloo; Mihalis Yannakakis, Columbia University; Frances Foong Yao, City University of Hong Kong; Wenan Zang, University of Hong Kong, Zhao Zhang, Xingjiang University.

Read this Journal on Springerlink

For authors and editors

  • Journal Citation Reports®
    2018 Impact Factor
  • 0.816
  • Aims and Scope

    Aims and Scope


    The objective of Journal of Combinatorial Optimization is to advance and promote the theory and applications of combinatorial optimization, which is an area of research at the intersection of applied mathematics, computer science, and operations research and which overlaps with many other areas such as computation complexity, computational biology, VLSI design, communication networks, and management science. It includes complexity analysis and algorithm design for combinatorial optimization problems, numerical experiments and problem discovery with applications in science and engineering.

    The Journal of Combinatorial Optimization publishes refereed papers dealing with all theoretical, computational and applied aspects of combinatorial optimization. It also publishes reviews of appropriate books and special issues of journals.
  • Submit Online
  • Open Choice - Your Way to Open Access
  • Instructions for Authors

    Instructions for Authors


  • Author Academy: Training for Authors
  • Copyright Information

    Copyright Information


    Copyright Information

    For Authors

    Submission of a manuscript implies: that the work described has not been published before (except in form of an abstract or as part of a published lecture, review or thesis); that it is not under consideration for publication elsewhere; that its publication has been approved by all co-authors, if any, as well as – tacitly or explicitly – by the responsible authorities at the institution where the work was carried out.

    Author warrants (i) that he/she is the sole owner or has been authorized by any additional copyright owner to assign the right, (ii) that the article does not infringe any third party rights and no license from or payments to a third party is required to publish the article and (iii) that the article has not been previously published or licensed. The author signs for and accepts responsibility for releasing this material on behalf of any and all co-authors. Transfer of copyright to Springer (respective to owner if other than Springer) becomes effective if and when a Copyright Transfer Statement is signed or transferred electronically by the corresponding author. After submission of the Copyright Transfer Statement signed by the corresponding author, changes of authorship or in the order of the authors listed will not be accepted by Springer.

    The copyright to this article, including any graphic elements therein (e.g. illustrations, charts, moving images), is assigned for good and valuable consideration to Springer effective if and when the article is accepted for publication and to the extent assignable if assignability is restricted for by applicable law or regulations (e.g. for U.S. government or crown employees).

    The copyright assignment includes without limitation the exclusive, assignable and sublicensable right, unlimited in time and territory, to reproduce, publish, distribute, transmit, make available and store the article, including abstracts thereof, in all forms of media of expression now known or developed in the future, including pre- and reprints, translations, photographic reproductions and microform. Springer may use the article in whole or in part in electronic form, such as use in databases or data networks for display, print or download to stationary or portable devices. This includes interactive and multimedia use and the right to alter the article to the extent necessary for such use.

    Authors may self-archive the Author's accepted manuscript of their articles on their own websites. Authors may also deposit this version of the article in any repository, provided it is only made publicly available 12 months after official publication or later. He/she may not use the publisher's version (the final article), which is posted on SpringerLink and other Springer websites, for the purpose of self-archiving or deposit. Furthermore, the Author may only post his/her version provided acknowledgement is given to the original source of publication and a link is inserted to the published article on Springer's website. The link must be accompanied by the following text: "The final publication is available at link.springer.com".

    Prior versions of the article published on non-commercial pre-print servers like arXiv.org can remain on these servers and/or can be updated with Author's accepted version. The final published version (in pdf or html/xml format) cannot be used for this purpose. Acknowledgement needs to be given to the final publication and a link must be inserted to the published article on Springer's website, accompanied by the text "The final publication is available at link.springer.com". Author retains the right to use his/her article for his/her further scientific career by including the final published journal article in other publications such as dissertations and postdoctoral qualifications provided acknowledgement is given to the original source of publication.

    Author is requested to use the appropriate DOI for the article. Articles disseminated via link.springer.com are indexed, abstracted and referenced by many abstracting and information services, bibliographic networks, subscription agencies, library networks, and consortia.

    For Readers

    While the advice and information in this journal is believed to be true and accurate at the date of its publication, neither the authors, the editors, nor the publisher can accept any legal responsibility for any errors or omissions that may have been made. The publisher makes no warranty, express or implied, with respect to the material contained herein.

    All articles published in this journal are protected by copyright, which covers the exclusive rights to reproduce and distribute the article (e.g., as offprints), as well as all translation rights. No material published in this journal may be reproduced photographically or stored on microfilm, in electronic data bases, video disks, etc., without first obtaining written permission from the publisher (respective the copyright owner if other than Springer). The use of general descriptive names, trade names, trademarks, etc., in this publication, even if not specifically identified, does not imply that these names are not protected by the relevant laws and regulations.

    Springer has partnered with Copyright Clearance Center's RightsLink service to offer a variety of options for reusing Springer content. For permission to reuse our content please locate the material that you wish to use on link.springer.com or on springerimages.com and click on the permissions link or go to copyright.com, then enter the title of the publication that you wish to use. For assistance in placing a permission request, Copyright Clearance Center can be connected directly via phone: +1-855-239-3415, fax: +1-978-646-8600, or e-mail: info@copyright.com.

    © Springer Science+Business Media New York

Services for the Journal

Alerts for this journal


Get the table of contents of every new issue published in Journal of Combinatorial Optimization.