IDEAS home Printed from https://ideas.repec.org/a/wly/navres/v41y1994i3p395-421.html
   My bibliography  Save this article

Order‐preserving assignments

Author

Listed:
  • Manfred Padberg
  • Dimitris Alevras

Abstract

Given an ordered list of n items, p possible positions, and integer profits cij for assigning item i to position j, the order‐preserving assignment problem consists of finding a profit‐optimal assignment that assigns items to contiguous positions while preserving the original ranking, i.e., the highest‐ranked item that will be assigned is assigned to position 1 and so on. Positions must be assigned contiguously starting with position one, but items need not be assigned to any particular position. We formulate the problem as a zero‐one linear program, derive a minimal description of the associated polytope by linear inequalities, show that the diameter of the polytope equals two, and give a linear‐time algorithm for the optimization problem, i.e., one that runs in time that is linear in the number of variables of the problem. We do this for both cases where at most p positions and where exactly p positions must be assigned and discuss briefly two modifications of the basic model. © 1994 John Wiley & Sons, Inc.

Suggested Citation

  • Manfred Padberg & Dimitris Alevras, 1994. "Order‐preserving assignments," Naval Research Logistics (NRL), John Wiley & Sons, vol. 41(3), pages 395-421, April.
    • Handle: RePEc:wly:navres:v:41:y:1994:i:3:p:395-421
    DOI: 10.1002/1520-6750(199404)41:33.0.CO;2-W
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/1520-6750(199404)41:33.0.CO;2-W
    Download Restriction: no
    File URL: https://libkey.io/10.1002/1520-6750(199404)41:33.0.CO;2-W?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
    ---><---

    References listed on IDEAS

    as
    1. H. W. Kuhn, 1955. "The Hungarian method for the assignment problem," Naval Research Logistics Quarterly, John Wiley & Sons, vol. 2(1‐2), pages 83-97, March.
    2. M. L. Balinski, 1985. "Signature Methods for the Assignment Problem," Operations Research, INFORMS, vol. 33(3), pages 527-536, 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. Ivan Belik & Kurt Jornsten, 2018. "Critical objective function values in linear sum assignment problems," Journal of Combinatorial Optimization, Springer, vol. 35(3), pages 842-852, April.
    2. Jingqun Li & Thia Kirubarajan & R. Tharmarasa & Daly Brown & Krishna R. Pattipati, 2021. "A dual approach to multi-dimensional assignment problems," Journal of Global Optimization, Springer, vol. 81(3), pages 691-716, November.
    3. Jingqun Li & R. Tharmarasa & Daly Brown & Thia Kirubarajan & Krishna R. Pattipati, 2019. "A novel convex dual approach to three-dimensional assignment problem: theoretical analysis," Computational Optimization and Applications, Springer, vol. 74(2), pages 481-516, November.
    4. András Frank, 2005. "On Kuhn's Hungarian Method—A tribute from Hungary," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(1), pages 2-5, February.
    5. Amit Kumar & Anila Gupta, 2013. "Mehar’s methods for fuzzy assignment problems with restrictions," Fuzzy Information and Engineering, Springer, vol. 5(1), pages 27-44, March.
    6. Pritibhushan Sinha, 2009. "Assignment problems with changeover cost," Annals of Operations Research, Springer, vol. 172(1), pages 447-457, November.
    7. Parvin Ahmadi & Iman Gholampour & Mahmoud Tabandeh, 2018. "Cluster-based sparse topical coding for topic mining and document clustering," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 12(3), pages 537-558, September.
    8. Chenchen Ma & Jing Ouyang & Gongjun Xu, 2023. "Learning Latent and Hierarchical Structures in Cognitive Diagnosis Models," Psychometrika, Springer;The Psychometric Society, vol. 88(1), pages 175-207, March.
    9. Chen, Liang & Tokuda, Naoyuki, 2001. "A faster data assignment algorithm for maximum likelihood-based multitarget motion tracking with bearings-only measurements," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 57(1), pages 109-120.
    10. Aidin Rezaeian & Hamidreza Koosha & Mohammad Ranjbar & Saeed Poormoaied, 2024. "The assignment of project managers to projects in an uncertain dynamic environment," Annals of Operations Research, Springer, vol. 341(2), pages 1107-1134, October.
    11. Tran Hoang Hai, 2020. "Estimation of volatility causality in structural autoregressions with heteroskedasticity using independent component analysis," Statistical Papers, Springer, vol. 61(1), pages 1-16, February.
    12. Caplin, Andrew & Leahy, John, 2020. "Comparative statics in markets for indivisible goods," Journal of Mathematical Economics, Elsevier, vol. 90(C), pages 80-94.
    13. Biró, Péter & Gudmundsson, Jens, 2021. "Complexity of finding Pareto-efficient allocations of highest welfare," European Journal of Operational Research, Elsevier, vol. 291(2), pages 614-628.
    14. Péter Biró & Flip Klijn & Xenia Klimentova & Ana Viana, 2021. "Shapley-Scarf Housing Markets: Respecting Improvement, Integer Programming, and Kidney Exchange," Working Papers 1235, Barcelona School of Economics.
    15. Michal Brylinski, 2014. "eMatchSite: Sequence Order-Independent Structure Alignments of Ligand Binding Pockets in Protein Models," PLOS Computational Biology, Public Library of Science, vol. 10(9), pages 1-15, September.
    16. Qin, Xiaolin & Tang, Juan & Feng, Yong & Bachmann, Bernhard & Fritzson, Peter, 2016. "Efficient index reduction algorithm for large scale systems of differential algebraic equations," Applied Mathematics and Computation, Elsevier, vol. 277(C), pages 10-22.
    17. Chiwei Yan & Helin Zhu & Nikita Korolko & Dawn Woodard, 2020. "Dynamic pricing and matching in ride‐hailing platforms," Naval Research Logistics (NRL), John Wiley & Sons, vol. 67(8), pages 705-724, December.
    18. Fanrong Xie & Anuj Sharma & Zuoan Li, 2022. "An alternate approach to solve two-level priority based assignment problem," Computational Optimization and Applications, Springer, vol. 81(2), pages 613-656, March.
    19. Yan, Pengyu & Lee, Chung-Yee & Chu, Chengbin & Chen, Cynthia & Luo, Zhiqin, 2021. "Matching and pricing in ride-sharing: Optimality, stability, and financial sustainability," Omega, Elsevier, vol. 102(C).
    20. Morrill, Thayer & Roth, Alvin E., 2024. "Top trading cycles," Journal of Mathematical Economics, Elsevier, vol. 112(C).

    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:wly:navres:v:41:y:1994:i:3:p:395-421. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1520-6750 .

    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.