IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v20y2010i4d10.1007_s10878-009-9218-9.html
   My bibliography  Save this article

A polynomially solvable case of optimal linear extension problem of a poset

Author

Listed:
  • Biao Wu

    (Zhejiang University)

  • Enyu Yao

    (Zhejiang University)

  • Longcheng Liu

    (Xiamen University)

Abstract

In this paper, we consider an optimal linear extension problem of partial order. Under certain conditions, we prove the problem is polynomially solvable and present an algorithm to compute the solution.

Suggested Citation

  • Biao Wu & Enyu Yao & Longcheng Liu, 2010. "A polynomially solvable case of optimal linear extension problem of a poset," Journal of Combinatorial Optimization, Springer, vol. 20(4), pages 422-428, November.
    • Handle: RePEc:spr:jcomop:v:20:y:2010:i:4:d:10.1007_s10878-009-9218-9
    DOI: 10.1007/s10878-009-9218-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-009-9218-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s10878-009-9218-9?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bertacco, Livio & Brunetta, Lorenzo & Fischetti, Matteo, 2008. "The Linear Ordering Problem with cumulative costs," European Journal of Operational Research, Elsevier, vol. 189(3), pages 1345-1357, September.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Irène Charon & Olivier Hudry, 2010. "An updated survey on the linear ordering problem for weighted or unweighted tournaments," Annals of Operations Research, Springer, vol. 175(1), pages 107-158, March.
    2. J. Terán-Villanueva & Héctor Fraire Huacuja & Juan Carpio Valadez & Rodolfo Pazos Rangel & Héctor Puga Soberanes & José Martínez Flores, 2015. "A heterogeneous cellular processing algorithm for minimizing the power consumption in wireless communications systems," Computational Optimization and Applications, Springer, vol. 62(3), pages 787-814, December.
    3. Abraham Duarte & Manuel Laguna & Rafael Martí, 2011. "Tabu search for the linear ordering problem with cumulative costs," Computational Optimization and Applications, Springer, vol. 48(3), pages 697-715, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:20:y:2010:i:4:d:10.1007_s10878-009-9218-9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.