IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v2y1998i4d10.1023_a1009737108224.html
   My bibliography  Save this article

Sortabilities of Partition Properties

Author

Listed:
  • Gerard J. Chang

    (National Chiao Tung University)

  • Fu-Loong Chen

    (National Chiao Tung University)

  • Lingling Huang

    (National Chiao Tung University)

  • Frank K. Hwang

    (National Chiao Tung University)

  • Su-Tzu Nuan

    (National Chiao Tung University)

  • Uriel G. Rothblum

    (Technion—Israel Institute of Technology)

  • I-Fan Sun

    (National Chiao Tung University)

  • Jan-Wen Wang

    (National Chiao Tung University)

  • Hong-Gwa Yeh

    (National Chiao Tung University)

Abstract

Consider the partition of a set of integers into parts. Various partition properties have been proposed in the literature to facilitate the restriction of the focus of attention to some small class of partitions. Recently, Hwang, Rothblum and Yao defined and studied the sortability of these partition properties as a tool to prove the existence of a partition with such a property in a given family. In this paper we determine the sortability indices of the seven most interesting properties of partitions providing a complete solution to the sortability issue.

Suggested Citation

  • Gerard J. Chang & Fu-Loong Chen & Lingling Huang & Frank K. Hwang & Su-Tzu Nuan & Uriel G. Rothblum & I-Fan Sun & Jan-Wen Wang & Hong-Gwa Yeh, 1998. "Sortabilities of Partition Properties," Journal of Combinatorial Optimization, Springer, vol. 2(4), pages 413-427, December.
    • Handle: RePEc:spr:jcomop:v:2:y:1998:i:4:d:10.1023_a:1009737108224
    DOI: 10.1023/A:1009737108224
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1023/A:1009737108224
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1023/A:1009737108224?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. S. Anily & A. Federgruen, 1991. "Structured Partitioning Problems," Operations Research, INFORMS, vol. 39(1), pages 130-149, February.
    2. A. K. Chakravarty & J. B. Orlin & U. G. Rothblum, 1985. "Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment," Operations Research, INFORMS, vol. 33(4), pages 820-834, August.
    3. Shmuel Gal & Boris Klots, 1995. "Optimal Partitioning Which Maximizes the Sum of the Weighted Averages," Operations Research, INFORMS, vol. 43(3), pages 500-508, June.
    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. Chung‐Lun Li & Zhi‐Long Chen, 2006. "Bin‐packing problem with concave costs of bin utilization," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 298-308, June.
    2. Frank K. Hwang & Uriel G. Rothblum, 2011. "On the number of separable partitions," Journal of Combinatorial Optimization, Springer, vol. 21(4), pages 423-433, May.
    3. Huilan Chang & Frank K. Hwang & Uriel G. Rothblum, 2012. "A new approach to solve open-partition problems," Journal of Combinatorial Optimization, Springer, vol. 23(1), pages 61-78, January.
    4. Frank K. Hwang & Shmuel Onn & Uriel G. Rothblum, 2000. "Explicit solution of partitioning problems over a 1‐dimensional parameter space," Naval Research Logistics (NRL), John Wiley & Sons, vol. 47(6), pages 531-540, September.
    5. Yann Braouezec, 2013. "The Welfare Effects of Regulating the Number of Market Segments," Working Papers 2013-ECO-11, IESEG School of Management.
    6. Braouezec, Yann, 2016. "On the welfare effects of regulating the number of discriminatory prices," Research in Economics, Elsevier, vol. 70(4), pages 588-607.
    7. Roy Cerqueti & Paolo Falbo & Cristian Pelizzari & Federica Ricca & Andrea Scozzari, 2012. "A Mixed Integer Linear Programming Approach to Markov Chain Bootstrapping," Working Papers 67-2012, Macerata University, Department of Finance and Economic Sciences, revised Nov 2012.
    8. Amiya K. Chakravarty & G. E. Martin, 1989. "Discount pricing policies for inventories subject to declining demand," Naval Research Logistics (NRL), John Wiley & Sons, vol. 36(1), pages 89-102, February.
    9. Arbib, Claudio & Rossi, Fabrizio, 2000. "An optimization problem arising in the design of multiring systems," European Journal of Operational Research, Elsevier, vol. 124(1), pages 63-76, July.
    10. Inniss, Tasha R., 2006. "Seasonal clustering technique for time series data," European Journal of Operational Research, Elsevier, vol. 175(1), pages 376-384, November.
    11. N H Moin & S Salhi, 2007. "Inventory routing problems: a logistical overview," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 58(9), pages 1185-1194, September.
    12. Cerqueti, Roy & Falbo, Paolo & Guastaroba, Gianfranco & Pelizzari, Cristian, 2013. "A Tabu Search heuristic procedure in Markov chain bootstrapping," European Journal of Operational Research, Elsevier, vol. 227(2), pages 367-384.
    13. Max Shen, Zuo-Jun & Qi, Lian, 2007. "Incorporating inventory and routing costs in strategic location models," European Journal of Operational Research, Elsevier, vol. 179(2), pages 372-389, June.
    14. Jia Shu & Chung-Piaw Teo & Zuo-Jun Max Shen, 2005. "Stochastic Transportation-Inventory Network Design Problem," Operations Research, INFORMS, vol. 53(1), pages 48-60, February.
    15. Kumar Satyendra & Venkata Rao, V. & Tirupati Devanath, 2003. "A heuristic procedure for one dimensional bin packing problem with additional constraints," IIMA Working Papers WP2003-11-02, Indian Institute of Management Ahmedabad, Research and Publication Department.
    16. Baita, Flavio & Ukovich, Walter & Pesenti, Raffaele & Favaretto, Daniela, 1998. "Dynamic routing-and-inventory problems: a review," Transportation Research Part A: Policy and Practice, Elsevier, vol. 32(8), pages 585-598, November.

    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:2:y:1998:i:4:d:10.1023_a:1009737108224. 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.