IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v81y1998i0p233-25010.1023-a1018953006796.html
   My bibliography  Save this article

Reformulation of the set partitioning problem as apure network with special order set constraints

Author

Listed:
  • Agha Iqbal Ali

Abstract

In this paper, the set partitioning problem is reformulated as a network flow problemwith special order sets. The reformulation is based on identifying network structure that ishidden in the element-set incidence matrix. The special order sets and the revealed networkin the reformulation together define an effective structure for solution by enumeration. Theresulting enumeration procedure for the solution of the set partitioning problem is computationallyadvantageous since it uses a pure network relaxation that is solved using reoptimization,allows a large number of variables to be fixed in a subproblem, and is defined overa relatively small enumeration tree. Computational experience is included. Copyright Kluwer Academic Publishers 1998

Suggested Citation

  • Agha Iqbal Ali, 1998. "Reformulation of the set partitioning problem as apure network with special order set constraints," Annals of Operations Research, Springer, vol. 81(0), pages 233-250, June.
    • Handle: RePEc:spr:annopr:v:81:y:1998:i:0:p:233-250:10.1023/a:1018953006796
    DOI: 10.1023/A:1018953006796
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1023/A:1018953006796
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1023/A:1018953006796?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.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Abdelouahab Zaghrouti & Issmail El Hallaoui & François Soumis, 2020. "Improving set partitioning problem solutions by zooming around an improving direction," Annals of Operations Research, Springer, vol. 284(2), pages 645-671, January.

    More about this item

    Statistics

    Access and download statistics

    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:annopr:v:81:y:1998:i:0:p:233-250:10.1023/a:1018953006796. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.